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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-01_false-unreach-call_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 01:37:18,588 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 01:37:18,589 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 01:37:18,598 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 01:37:18,598 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 01:37:18,599 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 01:37:18,599 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 01:37:18,601 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 01:37:18,602 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 01:37:18,603 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 01:37:18,603 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 01:37:18,603 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 01:37:18,604 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 01:37:18,605 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 01:37:18,606 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 01:37:18,607 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 01:37:18,609 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 01:37:18,610 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 01:37:18,611 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 01:37:18,612 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 01:37:18,613 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 01:37:18,613 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 01:37:18,614 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 01:37:18,614 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 01:37:18,615 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 01:37:18,616 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 01:37:18,616 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 01:37:18,617 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 01:37:18,617 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 01:37:18,617 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 01:37:18,617 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 01:37:18,618 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-04 01:37:18,627 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 01:37:18,628 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 01:37:18,629 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 01:37:18,629 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 01:37:18,629 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 01:37:18,629 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 01:37:18,629 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 01:37:18,629 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 01:37:18,630 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 01:37:18,630 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 01:37:18,630 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 01:37:18,630 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 01:37:18,630 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 01:37:18,630 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 01:37:18,630 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 01:37:18,631 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 01:37:18,631 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 01:37:18,631 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 01:37:18,631 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 01:37:18,631 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 01:37:18,631 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 01:37:18,631 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 01:37:18,632 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 01:37:18,632 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 01:37:18,632 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 01:37:18,656 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 01:37:18,664 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 01:37:18,666 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 01:37:18,667 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 01:37:18,668 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 01:37:18,668 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-01_false-unreach-call_false-valid-deref.i [2018-02-04 01:37:18,820 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 01:37:18,821 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 01:37:18,822 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 01:37:18,822 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 01:37:18,826 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 01:37:18,826 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:37:18" (1/1) ... [2018-02-04 01:37:18,828 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@143a12bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:37:18, skipping insertion in model container [2018-02-04 01:37:18,828 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:37:18" (1/1) ... [2018-02-04 01:37:18,837 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 01:37:18,869 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 01:37:18,964 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 01:37:18,984 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 01:37:18,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:37:18 WrapperNode [2018-02-04 01:37:18,991 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 01:37:18,992 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 01:37:18,992 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 01:37:18,992 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 01:37:19,002 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:37:18" (1/1) ... [2018-02-04 01:37:19,003 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:37:18" (1/1) ... [2018-02-04 01:37:19,010 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:37:18" (1/1) ... [2018-02-04 01:37:19,010 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:37:18" (1/1) ... [2018-02-04 01:37:19,016 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:37:18" (1/1) ... [2018-02-04 01:37:19,021 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:37:18" (1/1) ... [2018-02-04 01:37:19,022 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:37:18" (1/1) ... [2018-02-04 01:37:19,025 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 01:37:19,025 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 01:37:19,025 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 01:37:19,025 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 01:37:19,026 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:37:18" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-04 01:37:19,065 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 01:37:19,065 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 01:37:19,065 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 01:37:19,065 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 01:37:19,065 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 01:37:19,065 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 01:37:19,065 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 01:37:19,065 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 01:37:19,065 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 01:37:19,066 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 01:37:19,066 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 01:37:19,066 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-04 01:37:19,066 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 01:37:19,066 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 01:37:19,066 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 01:37:19,442 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 01:37:19,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:37:19 BoogieIcfgContainer [2018-02-04 01:37:19,443 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 01:37:19,444 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 01:37:19,444 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 01:37:19,447 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 01:37:19,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 01:37:18" (1/3) ... [2018-02-04 01:37:19,448 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c39aa90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:37:19, skipping insertion in model container [2018-02-04 01:37:19,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:37:18" (2/3) ... [2018-02-04 01:37:19,448 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c39aa90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:37:19, skipping insertion in model container [2018-02-04 01:37:19,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:37:19" (3/3) ... [2018-02-04 01:37:19,450 INFO L107 eAbstractionObserver]: Analyzing ICFG sll-01_false-unreach-call_false-valid-deref.i [2018-02-04 01:37:19,457 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 01:37:19,464 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 65 error locations. [2018-02-04 01:37:19,494 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 01:37:19,494 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 01:37:19,494 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 01:37:19,494 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 01:37:19,494 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 01:37:19,494 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 01:37:19,495 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 01:37:19,495 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 01:37:19,495 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 01:37:19,508 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states. [2018-02-04 01:37:19,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-04 01:37:19,516 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:37:19,516 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:37:19,517 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:37:19,520 INFO L82 PathProgramCache]: Analyzing trace with hash 2039196070, now seen corresponding path program 1 times [2018-02-04 01:37:19,522 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:37:19,522 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:37:19,570 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:19,570 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:37:19,571 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:19,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:37:19,608 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:37:19,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:37:19,656 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:37:19,656 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 01:37:19,658 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 01:37:19,670 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 01:37:19,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 01:37:19,673 INFO L87 Difference]: Start difference. First operand 188 states. Second operand 4 states. [2018-02-04 01:37:19,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:37:19,895 INFO L93 Difference]: Finished difference Result 215 states and 227 transitions. [2018-02-04 01:37:19,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 01:37:19,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-04 01:37:19,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:37:19,906 INFO L225 Difference]: With dead ends: 215 [2018-02-04 01:37:19,906 INFO L226 Difference]: Without dead ends: 211 [2018-02-04 01:37:19,907 INFO L554 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-02-04 01:37:19,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-02-04 01:37:19,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 181. [2018-02-04 01:37:19,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-02-04 01:37:19,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 194 transitions. [2018-02-04 01:37:19,943 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 194 transitions. Word has length 8 [2018-02-04 01:37:19,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:37:19,943 INFO L432 AbstractCegarLoop]: Abstraction has 181 states and 194 transitions. [2018-02-04 01:37:19,943 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 01:37:19,944 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 194 transitions. [2018-02-04 01:37:19,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-04 01:37:19,944 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:37:19,944 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:37:19,944 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:37:19,944 INFO L82 PathProgramCache]: Analyzing trace with hash 2039196071, now seen corresponding path program 1 times [2018-02-04 01:37:19,944 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:37:19,945 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:37:19,945 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:19,946 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:37:19,946 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:37:19,961 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:37:20,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:37:20,018 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:37:20,018 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 01:37:20,019 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 01:37:20,020 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 01:37:20,020 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 01:37:20,020 INFO L87 Difference]: Start difference. First operand 181 states and 194 transitions. Second operand 4 states. [2018-02-04 01:37:20,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:37:20,143 INFO L93 Difference]: Finished difference Result 204 states and 216 transitions. [2018-02-04 01:37:20,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 01:37:20,143 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-04 01:37:20,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:37:20,145 INFO L225 Difference]: With dead ends: 204 [2018-02-04 01:37:20,145 INFO L226 Difference]: Without dead ends: 204 [2018-02-04 01:37:20,146 INFO L554 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-02-04 01:37:20,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-02-04 01:37:20,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 193. [2018-02-04 01:37:20,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-02-04 01:37:20,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 213 transitions. [2018-02-04 01:37:20,155 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 213 transitions. Word has length 8 [2018-02-04 01:37:20,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:37:20,155 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 213 transitions. [2018-02-04 01:37:20,155 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 01:37:20,155 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 213 transitions. [2018-02-04 01:37:20,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 01:37:20,156 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:37:20,156 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:37:20,156 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:37:20,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1799051431, now seen corresponding path program 1 times [2018-02-04 01:37:20,156 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:37:20,156 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:37:20,157 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:20,157 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:37:20,157 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:20,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:37:20,171 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:37:20,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:37:20,205 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:37:20,205 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 01:37:20,205 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 01:37:20,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 01:37:20,205 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:37:20,206 INFO L87 Difference]: Start difference. First operand 193 states and 213 transitions. Second operand 5 states. [2018-02-04 01:37:20,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:37:20,498 INFO L93 Difference]: Finished difference Result 329 states and 358 transitions. [2018-02-04 01:37:20,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 01:37:20,503 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-04 01:37:20,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:37:20,504 INFO L225 Difference]: With dead ends: 329 [2018-02-04 01:37:20,504 INFO L226 Difference]: Without dead ends: 329 [2018-02-04 01:37:20,504 INFO L554 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-02-04 01:37:20,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-02-04 01:37:20,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 192. [2018-02-04 01:37:20,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-02-04 01:37:20,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 212 transitions. [2018-02-04 01:37:20,510 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 212 transitions. Word has length 17 [2018-02-04 01:37:20,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:37:20,510 INFO L432 AbstractCegarLoop]: Abstraction has 192 states and 212 transitions. [2018-02-04 01:37:20,510 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 01:37:20,510 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 212 transitions. [2018-02-04 01:37:20,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 01:37:20,510 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:37:20,510 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:37:20,510 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:37:20,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1799051430, now seen corresponding path program 1 times [2018-02-04 01:37:20,511 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:37:20,511 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:37:20,511 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:20,511 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:37:20,511 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:20,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:37:20,523 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:37:20,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:37:20,573 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:37:20,573 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 01:37:20,573 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 01:37:20,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 01:37:20,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:37:20,573 INFO L87 Difference]: Start difference. First operand 192 states and 212 transitions. Second operand 5 states. [2018-02-04 01:37:20,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:37:20,813 INFO L93 Difference]: Finished difference Result 358 states and 397 transitions. [2018-02-04 01:37:20,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 01:37:20,814 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-04 01:37:20,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:37:20,815 INFO L225 Difference]: With dead ends: 358 [2018-02-04 01:37:20,815 INFO L226 Difference]: Without dead ends: 358 [2018-02-04 01:37:20,815 INFO L554 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-02-04 01:37:20,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-02-04 01:37:20,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 191. [2018-02-04 01:37:20,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-02-04 01:37:20,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 211 transitions. [2018-02-04 01:37:20,822 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 211 transitions. Word has length 17 [2018-02-04 01:37:20,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:37:20,823 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 211 transitions. [2018-02-04 01:37:20,823 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 01:37:20,823 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 211 transitions. [2018-02-04 01:37:20,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 01:37:20,823 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:37:20,823 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:37:20,824 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:37:20,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1355722779, now seen corresponding path program 1 times [2018-02-04 01:37:20,824 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:37:20,824 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:37:20,825 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:20,825 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:37:20,825 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:20,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:37:20,840 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:37:20,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:37:20,912 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:37:20,912 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 01:37:20,912 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 01:37:20,912 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 01:37:20,912 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:37:20,913 INFO L87 Difference]: Start difference. First operand 191 states and 211 transitions. Second operand 8 states. [2018-02-04 01:37:21,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:37:21,279 INFO L93 Difference]: Finished difference Result 332 states and 359 transitions. [2018-02-04 01:37:21,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 01:37:21,280 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-02-04 01:37:21,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:37:21,281 INFO L225 Difference]: With dead ends: 332 [2018-02-04 01:37:21,281 INFO L226 Difference]: Without dead ends: 332 [2018-02-04 01:37:21,281 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-02-04 01:37:21,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-02-04 01:37:21,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 190. [2018-02-04 01:37:21,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-02-04 01:37:21,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 210 transitions. [2018-02-04 01:37:21,293 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 210 transitions. Word has length 20 [2018-02-04 01:37:21,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:37:21,293 INFO L432 AbstractCegarLoop]: Abstraction has 190 states and 210 transitions. [2018-02-04 01:37:21,293 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 01:37:21,293 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 210 transitions. [2018-02-04 01:37:21,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 01:37:21,294 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:37:21,294 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:37:21,294 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:37:21,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1355722780, now seen corresponding path program 1 times [2018-02-04 01:37:21,295 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:37:21,295 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:37:21,295 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:21,295 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:37:21,295 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:21,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:37:21,307 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:37:21,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:37:21,392 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:37:21,393 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 01:37:21,393 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 01:37:21,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 01:37:21,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:37:21,393 INFO L87 Difference]: Start difference. First operand 190 states and 210 transitions. Second operand 8 states. [2018-02-04 01:37:22,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:37:22,004 INFO L93 Difference]: Finished difference Result 334 states and 361 transitions. [2018-02-04 01:37:22,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 01:37:22,004 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-02-04 01:37:22,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:37:22,005 INFO L225 Difference]: With dead ends: 334 [2018-02-04 01:37:22,006 INFO L226 Difference]: Without dead ends: 334 [2018-02-04 01:37:22,006 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-02-04 01:37:22,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-02-04 01:37:22,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 189. [2018-02-04 01:37:22,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-02-04 01:37:22,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 209 transitions. [2018-02-04 01:37:22,012 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 209 transitions. Word has length 20 [2018-02-04 01:37:22,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:37:22,012 INFO L432 AbstractCegarLoop]: Abstraction has 189 states and 209 transitions. [2018-02-04 01:37:22,012 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 01:37:22,012 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 209 transitions. [2018-02-04 01:37:22,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 01:37:22,013 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:37:22,013 INFO L351 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-02-04 01:37:22,013 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:37:22,013 INFO L82 PathProgramCache]: Analyzing trace with hash -778525244, now seen corresponding path program 1 times [2018-02-04 01:37:22,014 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:37:22,014 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:37:22,014 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:22,014 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:37:22,015 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:22,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:37:22,023 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:37:22,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:37:22,064 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:37:22,065 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 01:37:22,065 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 01:37:22,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 01:37:22,065 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:37:22,066 INFO L87 Difference]: Start difference. First operand 189 states and 209 transitions. Second operand 5 states. [2018-02-04 01:37:22,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:37:22,158 INFO L93 Difference]: Finished difference Result 282 states and 308 transitions. [2018-02-04 01:37:22,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 01:37:22,158 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-02-04 01:37:22,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:37:22,159 INFO L225 Difference]: With dead ends: 282 [2018-02-04 01:37:22,159 INFO L226 Difference]: Without dead ends: 282 [2018-02-04 01:37:22,160 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-02-04 01:37:22,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-02-04 01:37:22,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 193. [2018-02-04 01:37:22,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-02-04 01:37:22,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 213 transitions. [2018-02-04 01:37:22,164 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 213 transitions. Word has length 26 [2018-02-04 01:37:22,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:37:22,164 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 213 transitions. [2018-02-04 01:37:22,164 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 01:37:22,165 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 213 transitions. [2018-02-04 01:37:22,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 01:37:22,165 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:37:22,165 INFO L351 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] [2018-02-04 01:37:22,165 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:37:22,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1814157193, now seen corresponding path program 1 times [2018-02-04 01:37:22,165 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:37:22,165 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:37:22,166 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:22,166 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:37:22,166 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:22,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:37:22,173 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:37:22,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:37:22,221 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:37:22,222 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 01:37:22,222 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 01:37:22,222 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 01:37:22,222 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:37:22,222 INFO L87 Difference]: Start difference. First operand 193 states and 213 transitions. Second operand 5 states. [2018-02-04 01:37:22,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:37:22,325 INFO L93 Difference]: Finished difference Result 203 states and 216 transitions. [2018-02-04 01:37:22,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 01:37:22,325 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-02-04 01:37:22,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:37:22,326 INFO L225 Difference]: With dead ends: 203 [2018-02-04 01:37:22,326 INFO L226 Difference]: Without dead ends: 203 [2018-02-04 01:37:22,326 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:37:22,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-02-04 01:37:22,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 185. [2018-02-04 01:37:22,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-02-04 01:37:22,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 205 transitions. [2018-02-04 01:37:22,329 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 205 transitions. Word has length 28 [2018-02-04 01:37:22,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:37:22,329 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 205 transitions. [2018-02-04 01:37:22,329 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 01:37:22,329 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 205 transitions. [2018-02-04 01:37:22,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 01:37:22,329 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:37:22,329 INFO L351 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] [2018-02-04 01:37:22,330 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:37:22,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1814157194, now seen corresponding path program 1 times [2018-02-04 01:37:22,330 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:37:22,330 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:37:22,330 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:22,330 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:37:22,331 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:22,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:37:22,336 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:37:22,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:37:22,404 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:37:22,405 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 01:37:22,405 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 01:37:22,405 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 01:37:22,405 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 01:37:22,405 INFO L87 Difference]: Start difference. First operand 185 states and 205 transitions. Second operand 7 states. [2018-02-04 01:37:22,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:37:22,597 INFO L93 Difference]: Finished difference Result 242 states and 259 transitions. [2018-02-04 01:37:22,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 01:37:22,598 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-02-04 01:37:22,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:37:22,599 INFO L225 Difference]: With dead ends: 242 [2018-02-04 01:37:22,599 INFO L226 Difference]: Without dead ends: 242 [2018-02-04 01:37:22,599 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-02-04 01:37:22,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-02-04 01:37:22,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 215. [2018-02-04 01:37:22,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-02-04 01:37:22,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 246 transitions. [2018-02-04 01:37:22,604 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 246 transitions. Word has length 28 [2018-02-04 01:37:22,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:37:22,604 INFO L432 AbstractCegarLoop]: Abstraction has 215 states and 246 transitions. [2018-02-04 01:37:22,604 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 01:37:22,604 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 246 transitions. [2018-02-04 01:37:22,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 01:37:22,605 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:37:22,605 INFO L351 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] [2018-02-04 01:37:22,605 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:37:22,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1983523681, now seen corresponding path program 1 times [2018-02-04 01:37:22,606 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:37:22,606 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:37:22,606 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:22,607 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:37:22,607 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:22,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:37:22,615 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:37:22,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:37:22,649 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:37:22,649 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 01:37:22,649 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 01:37:22,649 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 01:37:22,649 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 01:37:22,650 INFO L87 Difference]: Start difference. First operand 215 states and 246 transitions. Second operand 6 states. [2018-02-04 01:37:22,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:37:22,805 INFO L93 Difference]: Finished difference Result 311 states and 359 transitions. [2018-02-04 01:37:22,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 01:37:22,805 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-02-04 01:37:22,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:37:22,806 INFO L225 Difference]: With dead ends: 311 [2018-02-04 01:37:22,806 INFO L226 Difference]: Without dead ends: 311 [2018-02-04 01:37:22,807 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-04 01:37:22,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-02-04 01:37:22,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 214. [2018-02-04 01:37:22,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-02-04 01:37:22,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 245 transitions. [2018-02-04 01:37:22,810 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 245 transitions. Word has length 31 [2018-02-04 01:37:22,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:37:22,810 INFO L432 AbstractCegarLoop]: Abstraction has 214 states and 245 transitions. [2018-02-04 01:37:22,810 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 01:37:22,810 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 245 transitions. [2018-02-04 01:37:22,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 01:37:22,810 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:37:22,811 INFO L351 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] [2018-02-04 01:37:22,811 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:37:22,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1983523682, now seen corresponding path program 1 times [2018-02-04 01:37:22,811 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:37:22,811 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:37:22,811 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:22,812 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:37:22,812 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:22,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:37:22,819 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:37:22,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:37:22,865 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:37:22,865 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 01:37:22,865 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 01:37:22,865 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 01:37:22,865 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 01:37:22,866 INFO L87 Difference]: Start difference. First operand 214 states and 245 transitions. Second operand 6 states. [2018-02-04 01:37:23,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:37:23,059 INFO L93 Difference]: Finished difference Result 333 states and 389 transitions. [2018-02-04 01:37:23,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 01:37:23,059 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-02-04 01:37:23,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:37:23,060 INFO L225 Difference]: With dead ends: 333 [2018-02-04 01:37:23,060 INFO L226 Difference]: Without dead ends: 333 [2018-02-04 01:37:23,061 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-02-04 01:37:23,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-02-04 01:37:23,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 199. [2018-02-04 01:37:23,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-02-04 01:37:23,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 229 transitions. [2018-02-04 01:37:23,063 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 229 transitions. Word has length 31 [2018-02-04 01:37:23,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:37:23,063 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 229 transitions. [2018-02-04 01:37:23,063 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 01:37:23,063 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 229 transitions. [2018-02-04 01:37:23,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 01:37:23,064 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:37:23,064 INFO L351 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-02-04 01:37:23,064 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:37:23,064 INFO L82 PathProgramCache]: Analyzing trace with hash -706076137, now seen corresponding path program 1 times [2018-02-04 01:37:23,064 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:37:23,064 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:37:23,065 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:23,065 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:37:23,065 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:23,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:37:23,069 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:37:23,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:37:23,089 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:37:23,089 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 01:37:23,089 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 01:37:23,089 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 01:37:23,089 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:37:23,089 INFO L87 Difference]: Start difference. First operand 199 states and 229 transitions. Second operand 5 states. [2018-02-04 01:37:23,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:37:23,141 INFO L93 Difference]: Finished difference Result 222 states and 238 transitions. [2018-02-04 01:37:23,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 01:37:23,142 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-02-04 01:37:23,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:37:23,143 INFO L225 Difference]: With dead ends: 222 [2018-02-04 01:37:23,143 INFO L226 Difference]: Without dead ends: 222 [2018-02-04 01:37:23,143 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-02-04 01:37:23,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-02-04 01:37:23,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 199. [2018-02-04 01:37:23,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-02-04 01:37:23,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 227 transitions. [2018-02-04 01:37:23,147 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 227 transitions. Word has length 36 [2018-02-04 01:37:23,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:37:23,147 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 227 transitions. [2018-02-04 01:37:23,147 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 01:37:23,148 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 227 transitions. [2018-02-04 01:37:23,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 01:37:23,148 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:37:23,149 INFO L351 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-02-04 01:37:23,149 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:37:23,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1650873960, now seen corresponding path program 1 times [2018-02-04 01:37:23,149 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:37:23,149 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:37:23,150 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:23,150 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:37:23,150 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:23,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:37:23,162 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:37:23,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:37:23,320 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:37:23,320 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 01:37:23,321 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 01:37:23,321 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 01:37:23,321 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-04 01:37:23,321 INFO L87 Difference]: Start difference. First operand 199 states and 227 transitions. Second operand 10 states. [2018-02-04 01:37:23,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:37:23,719 INFO L93 Difference]: Finished difference Result 322 states and 354 transitions. [2018-02-04 01:37:23,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 01:37:23,719 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2018-02-04 01:37:23,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:37:23,720 INFO L225 Difference]: With dead ends: 322 [2018-02-04 01:37:23,720 INFO L226 Difference]: Without dead ends: 322 [2018-02-04 01:37:23,720 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2018-02-04 01:37:23,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-02-04 01:37:23,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 240. [2018-02-04 01:37:23,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-02-04 01:37:23,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 272 transitions. [2018-02-04 01:37:23,724 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 272 transitions. Word has length 42 [2018-02-04 01:37:23,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:37:23,724 INFO L432 AbstractCegarLoop]: Abstraction has 240 states and 272 transitions. [2018-02-04 01:37:23,725 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 01:37:23,725 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 272 transitions. [2018-02-04 01:37:23,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 01:37:23,725 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:37:23,726 INFO L351 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-02-04 01:37:23,726 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:37:23,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1611877026, now seen corresponding path program 1 times [2018-02-04 01:37:23,726 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:37:23,726 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:37:23,727 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:23,727 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:37:23,727 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:23,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:37:23,735 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:37:23,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:37:23,772 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:37:23,772 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 01:37:23,772 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 01:37:23,772 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 01:37:23,773 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:37:23,773 INFO L87 Difference]: Start difference. First operand 240 states and 272 transitions. Second operand 5 states. [2018-02-04 01:37:23,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:37:23,920 INFO L93 Difference]: Finished difference Result 359 states and 410 transitions. [2018-02-04 01:37:23,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 01:37:23,920 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-02-04 01:37:23,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:37:23,921 INFO L225 Difference]: With dead ends: 359 [2018-02-04 01:37:23,921 INFO L226 Difference]: Without dead ends: 359 [2018-02-04 01:37:23,921 INFO L554 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-02-04 01:37:23,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-02-04 01:37:23,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 239. [2018-02-04 01:37:23,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-02-04 01:37:23,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 271 transitions. [2018-02-04 01:37:23,924 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 271 transitions. Word has length 43 [2018-02-04 01:37:23,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:37:23,924 INFO L432 AbstractCegarLoop]: Abstraction has 239 states and 271 transitions. [2018-02-04 01:37:23,924 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 01:37:23,925 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 271 transitions. [2018-02-04 01:37:23,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 01:37:23,925 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:37:23,925 INFO L351 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-02-04 01:37:23,925 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:37:23,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1611877025, now seen corresponding path program 1 times [2018-02-04 01:37:23,926 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:37:23,926 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:37:23,926 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:23,927 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:37:23,927 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:23,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:37:23,935 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:37:24,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:37:24,022 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:37:24,022 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 01:37:24,022 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 01:37:24,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 01:37:24,023 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:37:24,023 INFO L87 Difference]: Start difference. First operand 239 states and 271 transitions. Second operand 5 states. [2018-02-04 01:37:24,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:37:24,229 INFO L93 Difference]: Finished difference Result 391 states and 449 transitions. [2018-02-04 01:37:24,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 01:37:24,230 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-02-04 01:37:24,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:37:24,231 INFO L225 Difference]: With dead ends: 391 [2018-02-04 01:37:24,231 INFO L226 Difference]: Without dead ends: 391 [2018-02-04 01:37:24,232 INFO L554 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-02-04 01:37:24,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-02-04 01:37:24,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 238. [2018-02-04 01:37:24,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-02-04 01:37:24,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 270 transitions. [2018-02-04 01:37:24,239 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 270 transitions. Word has length 43 [2018-02-04 01:37:24,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:37:24,240 INFO L432 AbstractCegarLoop]: Abstraction has 238 states and 270 transitions. [2018-02-04 01:37:24,240 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 01:37:24,240 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 270 transitions. [2018-02-04 01:37:24,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 01:37:24,241 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:37:24,241 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:37:24,241 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:37:24,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1934711090, now seen corresponding path program 1 times [2018-02-04 01:37:24,241 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:37:24,241 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:37:24,242 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:24,242 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:37:24,242 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:24,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:37:24,250 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:37:24,340 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:37:24,341 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 01:37:24,341 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 01:37:24,352 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:37:24,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:37:24,391 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 01:37:24,451 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-02-04 01:37:24,456 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-02-04 01:37:24,457 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:24,458 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:24,464 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-02-04 01:37:24,467 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-02-04 01:37:24,468 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:24,469 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:24,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:24,473 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-02-04 01:37:24,512 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 21 treesize of output 16 [2018-02-04 01:37:24,516 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:24,519 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-02-04 01:37:24,519 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:24,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:24,560 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 21 treesize of output 16 [2018-02-04 01:37:24,564 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:24,565 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-02-04 01:37:24,565 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:24,569 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:24,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:24,578 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-02-04 01:37:24,627 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 24 treesize of output 18 [2018-02-04 01:37:24,632 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:24,633 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-02-04 01:37:24,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:24,637 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:24,645 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 24 treesize of output 18 [2018-02-04 01:37:24,648 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:24,649 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-02-04 01:37:24,649 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:24,652 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:24,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:24,658 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:7 [2018-02-04 01:37:24,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:37:24,707 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 01:37:24,707 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 11 [2018-02-04 01:37:24,715 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 01:37:24,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 01:37:24,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-02-04 01:37:24,715 INFO L87 Difference]: Start difference. First operand 238 states and 270 transitions. Second operand 11 states. [2018-02-04 01:37:25,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:37:25,126 INFO L93 Difference]: Finished difference Result 383 states and 417 transitions. [2018-02-04 01:37:25,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 01:37:25,127 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2018-02-04 01:37:25,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:37:25,128 INFO L225 Difference]: With dead ends: 383 [2018-02-04 01:37:25,128 INFO L226 Difference]: Without dead ends: 383 [2018-02-04 01:37:25,128 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2018-02-04 01:37:25,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-02-04 01:37:25,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 285. [2018-02-04 01:37:25,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-02-04 01:37:25,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 329 transitions. [2018-02-04 01:37:25,134 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 329 transitions. Word has length 44 [2018-02-04 01:37:25,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:37:25,134 INFO L432 AbstractCegarLoop]: Abstraction has 285 states and 329 transitions. [2018-02-04 01:37:25,134 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 01:37:25,135 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 329 transitions. [2018-02-04 01:37:25,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 01:37:25,135 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:37:25,135 INFO L351 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] [2018-02-04 01:37:25,135 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:37:25,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1693979189, now seen corresponding path program 1 times [2018-02-04 01:37:25,136 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:37:25,136 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:37:25,137 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:25,137 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:37:25,137 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:25,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:37:25,148 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:37:25,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:37:25,205 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:37:25,205 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 01:37:25,205 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 01:37:25,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 01:37:25,205 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:37:25,206 INFO L87 Difference]: Start difference. First operand 285 states and 329 transitions. Second operand 8 states. [2018-02-04 01:37:25,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:37:25,470 INFO L93 Difference]: Finished difference Result 302 states and 348 transitions. [2018-02-04 01:37:25,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 01:37:25,470 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-02-04 01:37:25,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:37:25,472 INFO L225 Difference]: With dead ends: 302 [2018-02-04 01:37:25,472 INFO L226 Difference]: Without dead ends: 302 [2018-02-04 01:37:25,472 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-02-04 01:37:25,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-02-04 01:37:25,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 284. [2018-02-04 01:37:25,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-02-04 01:37:25,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 328 transitions. [2018-02-04 01:37:25,477 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 328 transitions. Word has length 46 [2018-02-04 01:37:25,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:37:25,478 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 328 transitions. [2018-02-04 01:37:25,478 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 01:37:25,478 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 328 transitions. [2018-02-04 01:37:25,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 01:37:25,479 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:37:25,479 INFO L351 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] [2018-02-04 01:37:25,479 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:37:25,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1693979188, now seen corresponding path program 1 times [2018-02-04 01:37:25,479 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:37:25,479 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:37:25,480 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:25,480 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:37:25,480 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:37:25,491 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:37:25,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:37:25,581 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:37:25,582 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 01:37:25,582 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 01:37:25,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 01:37:25,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:37:25,582 INFO L87 Difference]: Start difference. First operand 284 states and 328 transitions. Second operand 8 states. [2018-02-04 01:37:25,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:37:25,899 INFO L93 Difference]: Finished difference Result 301 states and 347 transitions. [2018-02-04 01:37:25,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 01:37:25,899 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-02-04 01:37:25,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:37:25,901 INFO L225 Difference]: With dead ends: 301 [2018-02-04 01:37:25,901 INFO L226 Difference]: Without dead ends: 301 [2018-02-04 01:37:25,901 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-02-04 01:37:25,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-02-04 01:37:25,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 283. [2018-02-04 01:37:25,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-02-04 01:37:25,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 327 transitions. [2018-02-04 01:37:25,905 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 327 transitions. Word has length 46 [2018-02-04 01:37:25,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:37:25,906 INFO L432 AbstractCegarLoop]: Abstraction has 283 states and 327 transitions. [2018-02-04 01:37:25,906 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 01:37:25,906 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 327 transitions. [2018-02-04 01:37:25,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 01:37:25,906 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:37:25,907 INFO L351 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-02-04 01:37:25,907 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:37:25,907 INFO L82 PathProgramCache]: Analyzing trace with hash -944056626, now seen corresponding path program 1 times [2018-02-04 01:37:25,907 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:37:25,907 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:37:25,908 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:25,908 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:37:25,908 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:25,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:37:25,918 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:37:26,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:37:26,010 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:37:26,010 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 01:37:26,010 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 01:37:26,010 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 01:37:26,010 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-04 01:37:26,011 INFO L87 Difference]: Start difference. First operand 283 states and 327 transitions. Second operand 11 states. [2018-02-04 01:37:26,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:37:26,535 INFO L93 Difference]: Finished difference Result 543 states and 601 transitions. [2018-02-04 01:37:26,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 01:37:26,536 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-02-04 01:37:26,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:37:26,539 INFO L225 Difference]: With dead ends: 543 [2018-02-04 01:37:26,539 INFO L226 Difference]: Without dead ends: 543 [2018-02-04 01:37:26,540 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2018-02-04 01:37:26,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-02-04 01:37:26,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 289. [2018-02-04 01:37:26,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-02-04 01:37:26,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 332 transitions. [2018-02-04 01:37:26,547 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 332 transitions. Word has length 47 [2018-02-04 01:37:26,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:37:26,547 INFO L432 AbstractCegarLoop]: Abstraction has 289 states and 332 transitions. [2018-02-04 01:37:26,547 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 01:37:26,547 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 332 transitions. [2018-02-04 01:37:26,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 01:37:26,548 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:37:26,548 INFO L351 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-02-04 01:37:26,548 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:37:26,548 INFO L82 PathProgramCache]: Analyzing trace with hash -944056625, now seen corresponding path program 1 times [2018-02-04 01:37:26,548 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:37:26,549 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:37:26,549 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:26,550 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:37:26,550 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:26,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:37:26,559 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:37:26,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:37:26,734 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:37:26,734 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 01:37:26,734 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 01:37:26,734 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 01:37:26,734 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-04 01:37:26,735 INFO L87 Difference]: Start difference. First operand 289 states and 332 transitions. Second operand 11 states. [2018-02-04 01:37:27,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:37:27,323 INFO L93 Difference]: Finished difference Result 596 states and 655 transitions. [2018-02-04 01:37:27,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 01:37:27,323 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-02-04 01:37:27,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:37:27,325 INFO L225 Difference]: With dead ends: 596 [2018-02-04 01:37:27,325 INFO L226 Difference]: Without dead ends: 596 [2018-02-04 01:37:27,325 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2018-02-04 01:37:27,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2018-02-04 01:37:27,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 296. [2018-02-04 01:37:27,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-02-04 01:37:27,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 338 transitions. [2018-02-04 01:37:27,332 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 338 transitions. Word has length 47 [2018-02-04 01:37:27,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:37:27,332 INFO L432 AbstractCegarLoop]: Abstraction has 296 states and 338 transitions. [2018-02-04 01:37:27,332 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 01:37:27,332 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 338 transitions. [2018-02-04 01:37:27,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-04 01:37:27,333 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:37:27,333 INFO L351 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, 1, 1, 1] [2018-02-04 01:37:27,333 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:37:27,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1546550031, now seen corresponding path program 1 times [2018-02-04 01:37:27,333 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:37:27,333 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:37:27,334 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:27,334 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:37:27,334 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:27,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:37:27,341 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:37:27,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 01:37:27,420 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:37:27,420 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 01:37:27,420 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 01:37:27,421 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 01:37:27,421 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-04 01:37:27,421 INFO L87 Difference]: Start difference. First operand 296 states and 338 transitions. Second operand 7 states. [2018-02-04 01:37:27,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:37:27,542 INFO L93 Difference]: Finished difference Result 312 states and 354 transitions. [2018-02-04 01:37:27,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 01:37:27,542 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-02-04 01:37:27,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:37:27,543 INFO L225 Difference]: With dead ends: 312 [2018-02-04 01:37:27,543 INFO L226 Difference]: Without dead ends: 312 [2018-02-04 01:37:27,543 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-02-04 01:37:27,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-02-04 01:37:27,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 308. [2018-02-04 01:37:27,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-02-04 01:37:27,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 350 transitions. [2018-02-04 01:37:27,548 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 350 transitions. Word has length 53 [2018-02-04 01:37:27,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:37:27,548 INFO L432 AbstractCegarLoop]: Abstraction has 308 states and 350 transitions. [2018-02-04 01:37:27,548 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 01:37:27,548 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 350 transitions. [2018-02-04 01:37:27,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 01:37:27,549 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:37:27,549 INFO L351 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, 1, 1, 1, 1, 1] [2018-02-04 01:37:27,549 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:37:27,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1009176340, now seen corresponding path program 1 times [2018-02-04 01:37:27,549 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:37:27,549 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:37:27,550 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:27,550 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:37:27,550 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:27,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:37:27,557 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:37:27,623 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:37:27,623 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 01:37:27,623 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 01:37:27,632 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:37:27,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:37:27,651 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 01:37:27,661 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-02-04 01:37:27,663 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 10 treesize of output 9 [2018-02-04 01:37:27,663 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:27,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:27,669 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-02-04 01:37:27,670 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 10 treesize of output 9 [2018-02-04 01:37:27,670 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 01:37:27,671 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:27,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 01:37:27,674 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-02-04 01:37:27,814 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 24 treesize of output 18 [2018-02-04 01:37:27,817 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:27,819 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:27,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2018-02-04 01:37:27,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 01:37:27,834 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 01:37:27,845 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 24 treesize of output 18 [2018-02-04 01:37:27,848 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:27,849 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 01:37:27,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2018-02-04 01:37:27,855 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-04 01:37:27,863 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 01:37:27,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 01:37:27,877 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:18 [2018-02-04 01:37:27,922 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:37:27,939 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 01:37:27,939 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 17 [2018-02-04 01:37:27,939 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 01:37:27,940 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 01:37:27,940 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=224, Unknown=5, NotChecked=0, Total=272 [2018-02-04 01:37:27,940 INFO L87 Difference]: Start difference. First operand 308 states and 350 transitions. Second operand 17 states. [2018-02-04 01:37:28,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:37:28,920 INFO L93 Difference]: Finished difference Result 588 states and 632 transitions. [2018-02-04 01:37:28,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 01:37:28,920 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 55 [2018-02-04 01:37:28,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:37:28,922 INFO L225 Difference]: With dead ends: 588 [2018-02-04 01:37:28,922 INFO L226 Difference]: Without dead ends: 588 [2018-02-04 01:37:28,922 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=231, Invalid=1091, Unknown=10, NotChecked=0, Total=1332 [2018-02-04 01:37:28,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2018-02-04 01:37:28,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 336. [2018-02-04 01:37:28,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-02-04 01:37:28,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 385 transitions. [2018-02-04 01:37:28,926 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 385 transitions. Word has length 55 [2018-02-04 01:37:28,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:37:28,926 INFO L432 AbstractCegarLoop]: Abstraction has 336 states and 385 transitions. [2018-02-04 01:37:28,926 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 01:37:28,926 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 385 transitions. [2018-02-04 01:37:28,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 01:37:28,926 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:37:28,926 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:37:28,926 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:37:28,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1219696535, now seen corresponding path program 1 times [2018-02-04 01:37:28,927 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:37:28,927 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:37:28,927 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:28,927 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:37:28,928 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:28,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:37:28,933 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:37:28,970 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 01:37:28,970 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 01:37:28,970 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 01:37:28,978 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:37:28,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:37:28,994 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 01:37:29,038 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~list~0.base Int)) (and (= |c_#valid| (store |c_old(#valid)| main_~list~0.base 0)) (not (= 0 main_~list~0.base)) (= (select |c_old(#valid)| main_~list~0.base) 0))) is different from true [2018-02-04 01:37:29,054 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2018-02-04 01:37:29,071 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 01:37:29,071 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7] total 9 [2018-02-04 01:37:29,072 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 01:37:29,072 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 01:37:29,072 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=55, Unknown=1, NotChecked=14, Total=90 [2018-02-04 01:37:29,072 INFO L87 Difference]: Start difference. First operand 336 states and 385 transitions. Second operand 10 states. [2018-02-04 01:37:29,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:37:29,262 INFO L93 Difference]: Finished difference Result 375 states and 424 transitions. [2018-02-04 01:37:29,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 01:37:29,262 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2018-02-04 01:37:29,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:37:29,263 INFO L225 Difference]: With dead ends: 375 [2018-02-04 01:37:29,263 INFO L226 Difference]: Without dead ends: 345 [2018-02-04 01:37:29,263 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=134, Unknown=1, NotChecked=24, Total=210 [2018-02-04 01:37:29,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-02-04 01:37:29,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 344. [2018-02-04 01:37:29,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-02-04 01:37:29,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 393 transitions. [2018-02-04 01:37:29,266 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 393 transitions. Word has length 56 [2018-02-04 01:37:29,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:37:29,266 INFO L432 AbstractCegarLoop]: Abstraction has 344 states and 393 transitions. [2018-02-04 01:37:29,266 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 01:37:29,266 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 393 transitions. [2018-02-04 01:37:29,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-04 01:37:29,266 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:37:29,267 INFO L351 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, 1, 1, 1, 1] [2018-02-04 01:37:29,267 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 01:37:29,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1674520475, now seen corresponding path program 1 times [2018-02-04 01:37:29,267 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 01:37:29,267 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 01:37:29,267 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:29,267 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 01:37:29,267 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 01:37:29,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 01:37:29,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 01:37:29,300 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 01:37:29,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 01:37:29 BoogieIcfgContainer [2018-02-04 01:37:29,330 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 01:37:29,331 INFO L168 Benchmark]: Toolchain (without parser) took 10510.28 ms. Allocated memory was 402.1 MB in the beginning and 813.2 MB in the end (delta: 411.0 MB). Free memory was 356.0 MB in the beginning and 498.4 MB in the end (delta: -142.4 MB). Peak memory consumption was 268.6 MB. Max. memory is 5.3 GB. [2018-02-04 01:37:29,332 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 402.1 MB. Free memory is still 362.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 01:37:29,332 INFO L168 Benchmark]: CACSL2BoogieTranslator took 169.72 ms. Allocated memory is still 402.1 MB. Free memory was 356.0 MB in the beginning and 344.1 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. [2018-02-04 01:37:29,332 INFO L168 Benchmark]: Boogie Preprocessor took 32.72 ms. Allocated memory is still 402.1 MB. Free memory was 344.1 MB in the beginning and 341.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 01:37:29,333 INFO L168 Benchmark]: RCFGBuilder took 418.17 ms. Allocated memory is still 402.1 MB. Free memory was 341.4 MB in the beginning and 295.1 MB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 5.3 GB. [2018-02-04 01:37:29,333 INFO L168 Benchmark]: TraceAbstraction took 9886.76 ms. Allocated memory was 402.1 MB in the beginning and 813.2 MB in the end (delta: 411.0 MB). Free memory was 295.1 MB in the beginning and 498.4 MB in the end (delta: -203.3 MB). Peak memory consumption was 207.8 MB. Max. memory is 5.3 GB. [2018-02-04 01:37:29,334 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.15 ms. Allocated memory is still 402.1 MB. Free memory is still 362.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 169.72 ms. Allocated memory is still 402.1 MB. Free memory was 356.0 MB in the beginning and 344.1 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.72 ms. Allocated memory is still 402.1 MB. Free memory was 344.1 MB in the beginning and 341.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 418.17 ms. Allocated memory is still 402.1 MB. Free memory was 341.4 MB in the beginning and 295.1 MB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 9886.76 ms. Allocated memory was 402.1 MB in the beginning and 813.2 MB in the end (delta: 411.0 MB). Free memory was 295.1 MB in the beginning and 498.4 MB in the end (delta: -203.3 MB). Peak memory consumption was 207.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L991] EXPR, FCALL malloc(sizeof(SLL)) VAL [malloc(sizeof(SLL))={11:0}] [L991] SLL* list = malloc(sizeof(SLL)); VAL [list={11:0}, malloc(sizeof(SLL))={11:0}] [L992] FCALL list->next = ((void*)0) VAL [list={11:0}, malloc(sizeof(SLL))={11:0}] [L993] COND FALSE !(!(list != ((void*)0))) VAL [list={11:0}, malloc(sizeof(SLL))={11:0}] [L993] COND FALSE !(0) VAL [list={11:0}, malloc(sizeof(SLL))={11:0}] [L993] COND FALSE !(__VERIFIER_nondet_int()) [L993] EXPR, FCALL malloc(sizeof(SLL)) VAL [list={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L993] FCALL list->inner = malloc(sizeof(SLL)) VAL [list={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L993] EXPR, FCALL list->inner VAL [list={11:0}, list->inner={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L993] FCALL list->inner->next = ((void*)0) VAL [list={11:0}, list->inner={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L993] EXPR, FCALL list->inner VAL [list={11:0}, list->inner={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L993] FCALL list->inner->inner = ((void*)0) VAL [list={11:0}, list->inner={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L993] EXPR, FCALL list->inner VAL [list={11:0}, list->inner={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L993] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={11:0}, list->inner={10:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L993] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L993] COND FALSE !(0) VAL [list={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L995] SLL* end = list; VAL [end={11:0}, list={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L998] COND FALSE !(__VERIFIER_nondet_int()) [L1008] end = ((void*)0) [L1009] end = list VAL [end={11:0}, list={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1012] COND FALSE !(!(((void*)0) != end)) VAL [end={11:0}, list={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1012] COND FALSE !(0) VAL [end={11:0}, list={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1014] COND TRUE ((void*)0) != end [L1016] int len = 0; VAL [end={11:0}, len=0, list={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1017] EXPR, FCALL end->inner VAL [end={11:0}, end->inner={10:0}, len=0, list={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1017] SLL* inner = end->inner; [L1018] COND TRUE ((void*)0) != inner VAL [end={11:0}, inner={10:0}, len=0, list={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1020] COND TRUE len == 0 [L1021] len = 1 VAL [end={11:0}, inner={10:0}, len=1, list={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1024] COND FALSE !(!(((void*)0) != inner)) VAL [end={11:0}, inner={10:0}, len=1, list={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1024] COND FALSE !(0) VAL [end={11:0}, inner={10:0}, len=1, list={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1025] EXPR, FCALL inner->inner VAL [end={11:0}, inner={10:0}, inner->inner={0:0}, len=1, list={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1025] COND FALSE !(!(((void*)0) == inner->inner)) [L1025] COND FALSE !(0) VAL [end={11:0}, inner={10:0}, len=1, list={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1026] EXPR, FCALL inner->next VAL [end={11:0}, inner={10:0}, inner->next={0:0}, len=1, list={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1026] COND FALSE !(!(((void*)0) == inner->next)) [L1026] COND FALSE !(0) VAL [end={11:0}, inner={10:0}, len=1, list={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1027] EXPR, FCALL inner->inner VAL [end={11:0}, inner={10:0}, inner->inner={0:0}, len=1, list={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1027] inner = inner->inner [L1028] COND TRUE len == 1 VAL [end={11:0}, inner={0:0}, len=1, list={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1029] FCALL inner->inner VAL [end={11:0}, inner={0:0}, len=1, list={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 188 locations, 65 error locations. UNSAFE Result, 9.8s OverallTime, 24 OverallIterations, 2 TraceHistogramMax, 6.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3786 SDtfs, 8308 SDslu, 12565 SDs, 0 SdLazy, 8499 SolverSat, 474 SolverUnsat, 71 SolverUnknown, 0 SolverNotchecked, 4.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 440 GetRequests, 175 SyntacticMatches, 12 SemanticMatches, 253 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=344occurred in iteration=23, 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.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 2320 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1004 NumberOfCodeBlocks, 1004 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 921 ConstructedInterpolants, 14 QuantifiedInterpolants, 394232 SizeOfPredicates, 24 NumberOfNonLiveVariables, 500 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 26 InterpolantComputations, 20 PerfectInterpolantSequences, 10/26 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-01_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_01-37-29-339.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-01_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_01-37-29-339.csv Received shutdown request...