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/memsafety-ext/tree_of_cslls_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 18:53:11,685 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 18:53:11,687 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 18:53:11,700 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 18:53:11,700 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 18:53:11,701 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 18:53:11,701 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 18:53:11,703 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 18:53:11,705 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 18:53:11,705 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 18:53:11,706 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 18:53:11,706 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 18:53:11,707 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 18:53:11,708 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 18:53:11,708 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 18:53:11,710 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 18:53:11,712 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 18:53:11,713 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 18:53:11,714 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 18:53:11,715 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 18:53:11,717 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 18:53:11,717 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 18:53:11,717 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 18:53:11,718 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 18:53:11,718 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 18:53:11,719 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 18:53:11,719 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 18:53:11,720 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 18:53:11,720 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 18:53:11,720 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 18:53:11,721 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 18:53:11,721 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-02 18:53:11,730 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 18:53:11,730 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 18:53:11,731 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 18:53:11,731 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 18:53:11,731 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 18:53:11,731 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 18:53:11,731 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 18:53:11,732 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 18:53:11,732 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 18:53:11,732 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 18:53:11,732 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 18:53:11,732 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 18:53:11,732 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 18:53:11,732 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 18:53:11,732 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 18:53:11,732 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 18:53:11,732 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 18:53:11,733 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 18:53:11,733 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 18:53:11,733 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 18:53:11,733 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 18:53:11,733 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 18:53:11,733 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 18:53:11,733 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 18:53:11,733 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 18:53:11,759 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 18:53:11,767 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 18:53:11,769 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 18:53:11,770 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 18:53:11,770 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 18:53:11,771 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/tree_of_cslls_true-valid-memsafety.i [2018-02-02 18:53:11,897 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 18:53:11,898 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 18:53:11,899 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 18:53:11,899 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 18:53:11,903 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 18:53:11,904 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 06:53:11" (1/1) ... [2018-02-02 18:53:11,905 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67bada75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:53:11, skipping insertion in model container [2018-02-02 18:53:11,906 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 06:53:11" (1/1) ... [2018-02-02 18:53:11,915 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 18:53:11,943 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 18:53:12,042 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 18:53:12,061 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 18:53:12,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:53:12 WrapperNode [2018-02-02 18:53:12,070 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 18:53:12,071 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 18:53:12,071 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 18:53:12,071 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 18:53:12,079 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:53:12" (1/1) ... [2018-02-02 18:53:12,079 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:53:12" (1/1) ... [2018-02-02 18:53:12,086 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:53:12" (1/1) ... [2018-02-02 18:53:12,087 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:53:12" (1/1) ... [2018-02-02 18:53:12,093 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:53:12" (1/1) ... [2018-02-02 18:53:12,097 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:53:12" (1/1) ... [2018-02-02 18:53:12,099 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:53:12" (1/1) ... [2018-02-02 18:53:12,101 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 18:53:12,102 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 18:53:12,102 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 18:53:12,102 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 18:53:12,103 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:53:12" (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-02 18:53:12,142 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 18:53:12,143 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 18:53:12,143 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 18:53:12,143 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 18:53:12,143 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 18:53:12,143 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 18:53:12,143 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 18:53:12,143 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 18:53:12,143 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 18:53:12,143 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 18:53:12,143 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 18:53:12,143 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 18:53:12,143 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 18:53:12,143 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 18:53:12,628 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 18:53:12,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 06:53:12 BoogieIcfgContainer [2018-02-02 18:53:12,629 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 18:53:12,629 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 18:53:12,629 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 18:53:12,631 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 18:53:12,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 06:53:11" (1/3) ... [2018-02-02 18:53:12,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47046c7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 06:53:12, skipping insertion in model container [2018-02-02 18:53:12,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:53:12" (2/3) ... [2018-02-02 18:53:12,632 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47046c7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 06:53:12, skipping insertion in model container [2018-02-02 18:53:12,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 06:53:12" (3/3) ... [2018-02-02 18:53:12,633 INFO L107 eAbstractionObserver]: Analyzing ICFG tree_of_cslls_true-valid-memsafety.i [2018-02-02 18:53:12,638 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 18:53:12,643 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 101 error locations. [2018-02-02 18:53:12,665 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 18:53:12,665 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 18:53:12,665 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 18:53:12,665 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 18:53:12,665 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 18:53:12,666 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 18:53:12,666 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 18:53:12,666 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 18:53:12,666 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 18:53:12,677 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states. [2018-02-02 18:53:12,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 18:53:12,683 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:53:12,684 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:53:12,684 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:53:12,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1603684078, now seen corresponding path program 1 times [2018-02-02 18:53:12,688 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:53:12,688 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:53:12,719 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:53:12,719 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:53:12,719 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:53:12,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:53:12,749 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:53:12,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:53:12,801 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:53:12,801 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:53:12,802 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:53:12,810 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:53:12,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:53:12,812 INFO L87 Difference]: Start difference. First operand 220 states. Second operand 4 states. [2018-02-02 18:53:13,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:53:13,226 INFO L93 Difference]: Finished difference Result 325 states and 349 transitions. [2018-02-02 18:53:13,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 18:53:13,228 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 18:53:13,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:53:13,240 INFO L225 Difference]: With dead ends: 325 [2018-02-02 18:53:13,240 INFO L226 Difference]: Without dead ends: 321 [2018-02-02 18:53:13,242 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-02 18:53:13,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-02-02 18:53:13,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 208. [2018-02-02 18:53:13,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-02 18:53:13,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 224 transitions. [2018-02-02 18:53:13,279 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 224 transitions. Word has length 8 [2018-02-02 18:53:13,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:53:13,279 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 224 transitions. [2018-02-02 18:53:13,279 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:53:13,279 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 224 transitions. [2018-02-02 18:53:13,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 18:53:13,280 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:53:13,280 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:53:13,280 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:53:13,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1603684077, now seen corresponding path program 1 times [2018-02-02 18:53:13,280 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:53:13,280 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:53:13,281 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:53:13,281 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:53:13,281 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:53:13,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:53:13,296 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:53:13,335 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-02 18:53:13,335 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:53:13,335 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:53:13,336 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:53:13,336 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:53:13,336 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:53:13,336 INFO L87 Difference]: Start difference. First operand 208 states and 224 transitions. Second operand 4 states. [2018-02-02 18:53:13,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:53:13,526 INFO L93 Difference]: Finished difference Result 206 states and 222 transitions. [2018-02-02 18:53:13,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 18:53:13,527 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 18:53:13,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:53:13,528 INFO L225 Difference]: With dead ends: 206 [2018-02-02 18:53:13,528 INFO L226 Difference]: Without dead ends: 206 [2018-02-02 18:53:13,529 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-02 18:53:13,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-02-02 18:53:13,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2018-02-02 18:53:13,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-02-02 18:53:13,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 222 transitions. [2018-02-02 18:53:13,538 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 222 transitions. Word has length 8 [2018-02-02 18:53:13,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:53:13,539 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 222 transitions. [2018-02-02 18:53:13,539 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:53:13,539 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 222 transitions. [2018-02-02 18:53:13,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-02 18:53:13,539 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:53:13,539 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:53:13,539 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:53:13,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1863813244, now seen corresponding path program 1 times [2018-02-02 18:53:13,540 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:53:13,540 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:53:13,542 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:53:13,542 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:53:13,542 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:53:13,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:53:13,557 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:53:13,605 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-02 18:53:13,606 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:53:13,606 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 18:53:13,606 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 18:53:13,606 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 18:53:13,606 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:53:13,607 INFO L87 Difference]: Start difference. First operand 206 states and 222 transitions. Second operand 5 states. [2018-02-02 18:53:13,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:53:13,891 INFO L93 Difference]: Finished difference Result 355 states and 383 transitions. [2018-02-02 18:53:13,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 18:53:13,891 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-02-02 18:53:13,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:53:13,892 INFO L225 Difference]: With dead ends: 355 [2018-02-02 18:53:13,892 INFO L226 Difference]: Without dead ends: 355 [2018-02-02 18:53:13,893 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-02-02 18:53:13,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-02-02 18:53:13,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 199. [2018-02-02 18:53:13,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-02-02 18:53:13,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 215 transitions. [2018-02-02 18:53:13,901 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 215 transitions. Word has length 11 [2018-02-02 18:53:13,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:53:13,901 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 215 transitions. [2018-02-02 18:53:13,901 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 18:53:13,901 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 215 transitions. [2018-02-02 18:53:13,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 18:53:13,902 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:53:13,902 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:53:13,902 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:53:13,902 INFO L82 PathProgramCache]: Analyzing trace with hash -476893285, now seen corresponding path program 1 times [2018-02-02 18:53:13,902 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:53:13,902 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:53:13,903 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:53:13,903 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:53:13,903 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:53:13,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:53:13,913 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:53:13,938 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-02 18:53:13,938 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:53:13,938 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 18:53:13,939 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 18:53:13,939 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 18:53:13,939 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:53:13,939 INFO L87 Difference]: Start difference. First operand 199 states and 215 transitions. Second operand 5 states. [2018-02-02 18:53:14,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:53:14,138 INFO L93 Difference]: Finished difference Result 274 states and 296 transitions. [2018-02-02 18:53:14,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 18:53:14,138 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-02 18:53:14,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:53:14,139 INFO L225 Difference]: With dead ends: 274 [2018-02-02 18:53:14,139 INFO L226 Difference]: Without dead ends: 274 [2018-02-02 18:53:14,139 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-02 18:53:14,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-02-02 18:53:14,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 198. [2018-02-02 18:53:14,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-02-02 18:53:14,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 214 transitions. [2018-02-02 18:53:14,145 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 214 transitions. Word has length 14 [2018-02-02 18:53:14,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:53:14,145 INFO L432 AbstractCegarLoop]: Abstraction has 198 states and 214 transitions. [2018-02-02 18:53:14,145 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 18:53:14,145 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 214 transitions. [2018-02-02 18:53:14,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 18:53:14,146 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:53:14,146 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:53:14,146 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:53:14,146 INFO L82 PathProgramCache]: Analyzing trace with hash -476893284, now seen corresponding path program 1 times [2018-02-02 18:53:14,146 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:53:14,146 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:53:14,147 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:53:14,147 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:53:14,148 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:53:14,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:53:14,155 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:53:14,199 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-02 18:53:14,199 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:53:14,199 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 18:53:14,199 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 18:53:14,200 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 18:53:14,200 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:53:14,200 INFO L87 Difference]: Start difference. First operand 198 states and 214 transitions. Second operand 5 states. [2018-02-02 18:53:14,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:53:14,396 INFO L93 Difference]: Finished difference Result 315 states and 345 transitions. [2018-02-02 18:53:14,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 18:53:14,397 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-02 18:53:14,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:53:14,398 INFO L225 Difference]: With dead ends: 315 [2018-02-02 18:53:14,398 INFO L226 Difference]: Without dead ends: 315 [2018-02-02 18:53:14,398 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 18:53:14,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-02-02 18:53:14,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 197. [2018-02-02 18:53:14,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-02-02 18:53:14,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 213 transitions. [2018-02-02 18:53:14,403 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 213 transitions. Word has length 14 [2018-02-02 18:53:14,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:53:14,403 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 213 transitions. [2018-02-02 18:53:14,403 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 18:53:14,403 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 213 transitions. [2018-02-02 18:53:14,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 18:53:14,403 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:53:14,404 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] [2018-02-02 18:53:14,404 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:53:14,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1521405160, now seen corresponding path program 1 times [2018-02-02 18:53:14,404 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:53:14,404 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:53:14,405 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:53:14,405 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:53:14,405 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:53:14,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:53:14,419 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:53:14,492 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-02 18:53:14,493 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:53:14,493 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 18:53:14,493 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 18:53:14,493 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 18:53:14,493 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 18:53:14,493 INFO L87 Difference]: Start difference. First operand 197 states and 213 transitions. Second operand 8 states. [2018-02-02 18:53:15,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:53:15,011 INFO L93 Difference]: Finished difference Result 369 states and 405 transitions. [2018-02-02 18:53:15,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 18:53:15,012 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-02-02 18:53:15,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:53:15,013 INFO L225 Difference]: With dead ends: 369 [2018-02-02 18:53:15,013 INFO L226 Difference]: Without dead ends: 369 [2018-02-02 18:53:15,014 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-02-02 18:53:15,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-02-02 18:53:15,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 204. [2018-02-02 18:53:15,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-02-02 18:53:15,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 222 transitions. [2018-02-02 18:53:15,019 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 222 transitions. Word has length 22 [2018-02-02 18:53:15,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:53:15,019 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 222 transitions. [2018-02-02 18:53:15,019 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 18:53:15,019 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 222 transitions. [2018-02-02 18:53:15,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 18:53:15,020 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:53:15,020 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] [2018-02-02 18:53:15,020 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:53:15,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1521405161, now seen corresponding path program 1 times [2018-02-02 18:53:15,021 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:53:15,021 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:53:15,021 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:53:15,022 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:53:15,022 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:53:15,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:53:15,034 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:53:15,126 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-02 18:53:15,127 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:53:15,127 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 18:53:15,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 18:53:15,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 18:53:15,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 18:53:15,128 INFO L87 Difference]: Start difference. First operand 204 states and 222 transitions. Second operand 8 states. [2018-02-02 18:53:15,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:53:15,781 INFO L93 Difference]: Finished difference Result 555 states and 611 transitions. [2018-02-02 18:53:15,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 18:53:15,782 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-02-02 18:53:15,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:53:15,783 INFO L225 Difference]: With dead ends: 555 [2018-02-02 18:53:15,784 INFO L226 Difference]: Without dead ends: 555 [2018-02-02 18:53:15,784 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-02-02 18:53:15,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2018-02-02 18:53:15,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 204. [2018-02-02 18:53:15,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-02-02 18:53:15,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 221 transitions. [2018-02-02 18:53:15,787 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 221 transitions. Word has length 22 [2018-02-02 18:53:15,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:53:15,787 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 221 transitions. [2018-02-02 18:53:15,787 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 18:53:15,788 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 221 transitions. [2018-02-02 18:53:15,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 18:53:15,788 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:53:15,788 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] [2018-02-02 18:53:15,788 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:53:15,789 INFO L82 PathProgramCache]: Analyzing trace with hash -115400475, now seen corresponding path program 1 times [2018-02-02 18:53:15,789 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:53:15,789 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:53:15,789 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:53:15,790 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:53:15,790 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:53:15,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:53:15,797 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:53:15,841 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-02 18:53:15,841 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:53:15,842 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:53:15,842 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:53:15,842 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:53:15,842 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:53:15,842 INFO L87 Difference]: Start difference. First operand 204 states and 221 transitions. Second operand 4 states. [2018-02-02 18:53:15,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:53:15,982 INFO L93 Difference]: Finished difference Result 273 states and 297 transitions. [2018-02-02 18:53:15,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 18:53:15,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-02-02 18:53:15,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:53:15,983 INFO L225 Difference]: With dead ends: 273 [2018-02-02 18:53:15,983 INFO L226 Difference]: Without dead ends: 273 [2018-02-02 18:53:15,983 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:53:15,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-02-02 18:53:15,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 197. [2018-02-02 18:53:15,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-02-02 18:53:15,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 218 transitions. [2018-02-02 18:53:15,985 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 218 transitions. Word has length 23 [2018-02-02 18:53:15,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:53:15,986 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 218 transitions. [2018-02-02 18:53:15,986 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:53:15,986 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 218 transitions. [2018-02-02 18:53:15,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 18:53:15,986 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:53:15,986 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] [2018-02-02 18:53:15,986 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:53:15,986 INFO L82 PathProgramCache]: Analyzing trace with hash -115400474, now seen corresponding path program 1 times [2018-02-02 18:53:15,986 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:53:15,987 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:53:15,987 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:53:15,987 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:53:15,987 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:53:15,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:53:15,995 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:53:16,040 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-02 18:53:16,040 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:53:16,040 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 18:53:16,040 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 18:53:16,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 18:53:16,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 18:53:16,041 INFO L87 Difference]: Start difference. First operand 197 states and 218 transitions. Second operand 6 states. [2018-02-02 18:53:16,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:53:16,303 INFO L93 Difference]: Finished difference Result 464 states and 518 transitions. [2018-02-02 18:53:16,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 18:53:16,303 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-02 18:53:16,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:53:16,304 INFO L225 Difference]: With dead ends: 464 [2018-02-02 18:53:16,305 INFO L226 Difference]: Without dead ends: 464 [2018-02-02 18:53:16,305 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-02-02 18:53:16,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-02-02 18:53:16,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 346. [2018-02-02 18:53:16,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-02-02 18:53:16,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 473 transitions. [2018-02-02 18:53:16,311 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 473 transitions. Word has length 23 [2018-02-02 18:53:16,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:53:16,312 INFO L432 AbstractCegarLoop]: Abstraction has 346 states and 473 transitions. [2018-02-02 18:53:16,312 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 18:53:16,312 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 473 transitions. [2018-02-02 18:53:16,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 18:53:16,312 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:53:16,312 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] [2018-02-02 18:53:16,312 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:53:16,313 INFO L82 PathProgramCache]: Analyzing trace with hash -81080279, now seen corresponding path program 1 times [2018-02-02 18:53:16,313 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:53:16,313 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:53:16,313 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:53:16,314 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:53:16,314 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:53:16,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:53:16,323 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:53:16,366 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-02 18:53:16,366 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:53:16,366 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:53:16,366 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:53:16,366 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:53:16,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:53:16,367 INFO L87 Difference]: Start difference. First operand 346 states and 473 transitions. Second operand 4 states. [2018-02-02 18:53:16,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:53:16,592 INFO L93 Difference]: Finished difference Result 701 states and 998 transitions. [2018-02-02 18:53:16,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 18:53:16,593 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-02-02 18:53:16,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:53:16,596 INFO L225 Difference]: With dead ends: 701 [2018-02-02 18:53:16,596 INFO L226 Difference]: Without dead ends: 701 [2018-02-02 18:53:16,597 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:53:16,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2018-02-02 18:53:16,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 345. [2018-02-02 18:53:16,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-02-02 18:53:16,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 472 transitions. [2018-02-02 18:53:16,610 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 472 transitions. Word has length 23 [2018-02-02 18:53:16,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:53:16,610 INFO L432 AbstractCegarLoop]: Abstraction has 345 states and 472 transitions. [2018-02-02 18:53:16,610 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:53:16,611 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 472 transitions. [2018-02-02 18:53:16,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 18:53:16,611 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:53:16,611 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] [2018-02-02 18:53:16,611 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:53:16,612 INFO L82 PathProgramCache]: Analyzing trace with hash -81080280, now seen corresponding path program 1 times [2018-02-02 18:53:16,612 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:53:16,612 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:53:16,613 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:53:16,613 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:53:16,613 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:53:16,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:53:16,625 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:53:16,647 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-02 18:53:16,648 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:53:16,648 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:53:16,648 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:53:16,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:53:16,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:53:16,649 INFO L87 Difference]: Start difference. First operand 345 states and 472 transitions. Second operand 4 states. [2018-02-02 18:53:16,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:53:16,994 INFO L93 Difference]: Finished difference Result 861 states and 1188 transitions. [2018-02-02 18:53:16,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 18:53:16,994 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-02-02 18:53:16,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:53:16,998 INFO L225 Difference]: With dead ends: 861 [2018-02-02 18:53:16,998 INFO L226 Difference]: Without dead ends: 861 [2018-02-02 18:53:16,998 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:53:16,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2018-02-02 18:53:17,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 343. [2018-02-02 18:53:17,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-02-02 18:53:17,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 467 transitions. [2018-02-02 18:53:17,008 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 467 transitions. Word has length 23 [2018-02-02 18:53:17,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:53:17,008 INFO L432 AbstractCegarLoop]: Abstraction has 343 states and 467 transitions. [2018-02-02 18:53:17,008 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:53:17,008 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 467 transitions. [2018-02-02 18:53:17,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 18:53:17,009 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:53:17,009 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] [2018-02-02 18:53:17,009 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:53:17,009 INFO L82 PathProgramCache]: Analyzing trace with hash 771701702, now seen corresponding path program 1 times [2018-02-02 18:53:17,009 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:53:17,009 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:53:17,010 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:53:17,010 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:53:17,010 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:53:17,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:53:17,017 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:53:17,033 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-02 18:53:17,033 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:53:17,033 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 18:53:17,033 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:53:17,034 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:53:17,034 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:53:17,034 INFO L87 Difference]: Start difference. First operand 343 states and 467 transitions. Second operand 4 states. [2018-02-02 18:53:17,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:53:17,055 INFO L93 Difference]: Finished difference Result 413 states and 541 transitions. [2018-02-02 18:53:17,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 18:53:17,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-02-02 18:53:17,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:53:17,057 INFO L225 Difference]: With dead ends: 413 [2018-02-02 18:53:17,057 INFO L226 Difference]: Without dead ends: 413 [2018-02-02 18:53:17,057 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:53:17,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-02-02 18:53:17,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 382. [2018-02-02 18:53:17,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-02-02 18:53:17,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 541 transitions. [2018-02-02 18:53:17,065 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 541 transitions. Word has length 25 [2018-02-02 18:53:17,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:53:17,065 INFO L432 AbstractCegarLoop]: Abstraction has 382 states and 541 transitions. [2018-02-02 18:53:17,065 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:53:17,065 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 541 transitions. [2018-02-02 18:53:17,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 18:53:17,066 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:53:17,066 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-02 18:53:17,066 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:53:17,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1690982226, now seen corresponding path program 1 times [2018-02-02 18:53:17,066 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:53:17,066 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:53:17,067 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:53:17,067 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:53:17,067 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:53:17,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:53:17,076 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:53:17,139 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-02 18:53:17,139 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:53:17,139 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 18:53:17,140 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 18:53:17,140 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 18:53:17,140 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 18:53:17,140 INFO L87 Difference]: Start difference. First operand 382 states and 541 transitions. Second operand 9 states. [2018-02-02 18:53:17,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:53:17,804 INFO L93 Difference]: Finished difference Result 1251 states and 1782 transitions. [2018-02-02 18:53:17,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 18:53:17,804 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-02-02 18:53:17,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:53:17,807 INFO L225 Difference]: With dead ends: 1251 [2018-02-02 18:53:17,808 INFO L226 Difference]: Without dead ends: 1251 [2018-02-02 18:53:17,808 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-02-02 18:53:17,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2018-02-02 18:53:17,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 381. [2018-02-02 18:53:17,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-02-02 18:53:17,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 540 transitions. [2018-02-02 18:53:17,822 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 540 transitions. Word has length 26 [2018-02-02 18:53:17,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:53:17,822 INFO L432 AbstractCegarLoop]: Abstraction has 381 states and 540 transitions. [2018-02-02 18:53:17,822 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 18:53:17,822 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 540 transitions. [2018-02-02 18:53:17,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 18:53:17,823 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:53:17,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, 1, 1, 1, 1, 1, 1] [2018-02-02 18:53:17,823 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:53:17,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1690982225, now seen corresponding path program 1 times [2018-02-02 18:53:17,823 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:53:17,823 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:53:17,824 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:53:17,824 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:53:17,824 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:53:17,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:53:17,839 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:53:17,944 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-02 18:53:17,945 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:53:17,945 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 18:53:17,945 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 18:53:17,945 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 18:53:17,945 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 18:53:17,945 INFO L87 Difference]: Start difference. First operand 381 states and 540 transitions. Second operand 9 states. [2018-02-02 18:53:18,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:53:18,588 INFO L93 Difference]: Finished difference Result 1250 states and 1781 transitions. [2018-02-02 18:53:18,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 18:53:18,588 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-02-02 18:53:18,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:53:18,590 INFO L225 Difference]: With dead ends: 1250 [2018-02-02 18:53:18,590 INFO L226 Difference]: Without dead ends: 1250 [2018-02-02 18:53:18,591 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-02-02 18:53:18,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2018-02-02 18:53:18,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 380. [2018-02-02 18:53:18,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-02-02 18:53:18,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 539 transitions. [2018-02-02 18:53:18,597 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 539 transitions. Word has length 26 [2018-02-02 18:53:18,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:53:18,597 INFO L432 AbstractCegarLoop]: Abstraction has 380 states and 539 transitions. [2018-02-02 18:53:18,597 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 18:53:18,597 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 539 transitions. [2018-02-02 18:53:18,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 18:53:18,597 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:53:18,597 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] [2018-02-02 18:53:18,597 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:53:18,598 INFO L82 PathProgramCache]: Analyzing trace with hash -679017658, now seen corresponding path program 1 times [2018-02-02 18:53:18,598 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:53:18,598 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:53:18,598 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:53:18,598 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:53:18,598 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:53:18,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:53:18,603 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:53:18,621 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-02 18:53:18,621 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:53:18,621 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:53:18,622 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 18:53:18,622 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 18:53:18,622 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 18:53:18,622 INFO L87 Difference]: Start difference. First operand 380 states and 539 transitions. Second operand 3 states. [2018-02-02 18:53:18,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:53:18,629 INFO L93 Difference]: Finished difference Result 384 states and 543 transitions. [2018-02-02 18:53:18,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 18:53:18,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-02-02 18:53:18,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:53:18,630 INFO L225 Difference]: With dead ends: 384 [2018-02-02 18:53:18,630 INFO L226 Difference]: Without dead ends: 384 [2018-02-02 18:53:18,631 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 18:53:18,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-02-02 18:53:18,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2018-02-02 18:53:18,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2018-02-02 18:53:18,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 543 transitions. [2018-02-02 18:53:18,637 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 543 transitions. Word has length 30 [2018-02-02 18:53:18,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:53:18,637 INFO L432 AbstractCegarLoop]: Abstraction has 384 states and 543 transitions. [2018-02-02 18:53:18,637 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 18:53:18,637 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 543 transitions. [2018-02-02 18:53:18,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 18:53:18,638 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:53:18,638 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] [2018-02-02 18:53:18,639 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:53:18,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1240786582, now seen corresponding path program 1 times [2018-02-02 18:53:18,639 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:53:18,639 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:53:18,640 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:53:18,640 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:53:18,640 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:53:18,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:53:18,647 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:53:18,657 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:53:18,658 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:53:18,658 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:53:18,658 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 18:53:18,658 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 18:53:18,658 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 18:53:18,659 INFO L87 Difference]: Start difference. First operand 384 states and 543 transitions. Second operand 3 states. [2018-02-02 18:53:18,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:53:18,666 INFO L93 Difference]: Finished difference Result 387 states and 546 transitions. [2018-02-02 18:53:18,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 18:53:18,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-02-02 18:53:18,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:53:18,667 INFO L225 Difference]: With dead ends: 387 [2018-02-02 18:53:18,667 INFO L226 Difference]: Without dead ends: 387 [2018-02-02 18:53:18,668 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 18:53:18,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-02-02 18:53:18,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 387. [2018-02-02 18:53:18,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-02-02 18:53:18,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 546 transitions. [2018-02-02 18:53:18,673 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 546 transitions. Word has length 31 [2018-02-02 18:53:18,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:53:18,674 INFO L432 AbstractCegarLoop]: Abstraction has 387 states and 546 transitions. [2018-02-02 18:53:18,674 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 18:53:18,674 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 546 transitions. [2018-02-02 18:53:18,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 18:53:18,675 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:53:18,675 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] [2018-02-02 18:53:18,675 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:53:18,675 INFO L82 PathProgramCache]: Analyzing trace with hash 348971873, now seen corresponding path program 1 times [2018-02-02 18:53:18,675 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:53:18,675 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:53:18,676 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:53:18,676 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:53:18,676 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:53:18,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:53:18,683 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:53:18,699 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-02 18:53:18,699 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:53:18,699 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:53:18,700 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 18:53:18,700 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 18:53:18,700 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 18:53:18,700 INFO L87 Difference]: Start difference. First operand 387 states and 546 transitions. Second operand 3 states. [2018-02-02 18:53:18,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:53:18,715 INFO L93 Difference]: Finished difference Result 428 states and 574 transitions. [2018-02-02 18:53:18,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 18:53:18,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-02-02 18:53:18,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:53:18,718 INFO L225 Difference]: With dead ends: 428 [2018-02-02 18:53:18,718 INFO L226 Difference]: Without dead ends: 428 [2018-02-02 18:53:18,718 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 18:53:18,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-02-02 18:53:18,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 379. [2018-02-02 18:53:18,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-02-02 18:53:18,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 526 transitions. [2018-02-02 18:53:18,723 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 526 transitions. Word has length 32 [2018-02-02 18:53:18,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:53:18,723 INFO L432 AbstractCegarLoop]: Abstraction has 379 states and 526 transitions. [2018-02-02 18:53:18,723 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 18:53:18,723 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 526 transitions. [2018-02-02 18:53:18,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 18:53:18,724 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:53:18,724 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] [2018-02-02 18:53:18,724 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:53:18,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1663635795, now seen corresponding path program 1 times [2018-02-02 18:53:18,724 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:53:18,724 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:53:18,725 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:53:18,725 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:53:18,725 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:53:18,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:53:18,731 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:53:18,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:53:18,878 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:53:18,878 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 18:53:18,879 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 18:53:18,879 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 18:53:18,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-02 18:53:18,879 INFO L87 Difference]: Start difference. First operand 379 states and 526 transitions. Second operand 10 states. [2018-02-02 18:53:19,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:53:19,422 INFO L93 Difference]: Finished difference Result 605 states and 777 transitions. [2018-02-02 18:53:19,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 18:53:19,422 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2018-02-02 18:53:19,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:53:19,423 INFO L225 Difference]: With dead ends: 605 [2018-02-02 18:53:19,423 INFO L226 Difference]: Without dead ends: 605 [2018-02-02 18:53:19,423 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2018-02-02 18:53:19,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2018-02-02 18:53:19,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 396. [2018-02-02 18:53:19,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-02-02 18:53:19,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 548 transitions. [2018-02-02 18:53:19,429 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 548 transitions. Word has length 33 [2018-02-02 18:53:19,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:53:19,429 INFO L432 AbstractCegarLoop]: Abstraction has 396 states and 548 transitions. [2018-02-02 18:53:19,429 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 18:53:19,430 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 548 transitions. [2018-02-02 18:53:19,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 18:53:19,430 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:53:19,430 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] [2018-02-02 18:53:19,430 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:53:19,430 INFO L82 PathProgramCache]: Analyzing trace with hash 768774257, now seen corresponding path program 1 times [2018-02-02 18:53:19,430 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:53:19,431 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:53:19,431 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:53:19,431 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:53:19,431 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:53:19,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:53:19,441 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:53:19,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:53:19,653 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:53:19,653 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-02 18:53:19,660 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:53:19,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:53:19,687 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:53:19,793 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-02 18:53:19,796 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-02 18:53:19,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:53:19,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:53:19,809 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-02 18:53:19,811 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-02 18:53:19,811 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:53:19,812 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:53:19,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:53:19,818 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-02-02 18:53:19,846 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-02 18:53:19,848 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:53:19,850 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-02 18:53:19,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:53:19,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:53:19,870 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-02 18:53:19,872 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:53:19,872 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-02 18:53:19,872 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:53:19,876 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:53:19,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:53:19,884 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:52, output treesize:44 [2018-02-02 18:53:19,908 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:53:19,908 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:53:19,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 18:53:19,909 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:53:19,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:53:19,917 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:43 [2018-02-02 18:53:19,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-02-02 18:53:19,943 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:53:19,944 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:53:19,945 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:53:19,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-02-02 18:53:19,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:53:19,953 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:53:19,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-02-02 18:53:19,981 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:53:19,982 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:53:19,982 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:53:19,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-02-02 18:53:19,985 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:53:19,991 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:53:20,005 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-02 18:53:20,005 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:69, output treesize:49 [2018-02-02 18:53:20,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2018-02-02 18:53:20,062 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 14 treesize of output 13 [2018-02-02 18:53:20,062 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:53:20,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:53:20,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 57 [2018-02-02 18:53:20,082 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 14 treesize of output 13 [2018-02-02 18:53:20,083 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:53:20,088 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:53:20,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:53:20,097 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:95, output treesize:49 [2018-02-02 18:53:20,125 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 34 treesize of output 26 [2018-02-02 18:53:20,128 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:53:20,129 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:53:20,129 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:53:20,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2018-02-02 18:53:20,132 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:53:20,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:53:20,152 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-02 18:53:20,153 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:53:20,154 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-02 18:53:20,154 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:53:20,162 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:53:20,166 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-02 18:53:20,166 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:63, output treesize:7 [2018-02-02 18:53:20,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:53:20,220 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 18:53:20,220 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [13] total 24 [2018-02-02 18:53:20,220 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 18:53:20,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 18:53:20,220 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2018-02-02 18:53:20,221 INFO L87 Difference]: Start difference. First operand 396 states and 548 transitions. Second operand 24 states. [2018-02-02 18:53:22,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:53:22,621 INFO L93 Difference]: Finished difference Result 609 states and 779 transitions. [2018-02-02 18:53:22,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 18:53:22,621 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 34 [2018-02-02 18:53:22,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:53:22,622 INFO L225 Difference]: With dead ends: 609 [2018-02-02 18:53:22,623 INFO L226 Difference]: Without dead ends: 609 [2018-02-02 18:53:22,623 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=509, Invalid=1747, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 18:53:22,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2018-02-02 18:53:22,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 441. [2018-02-02 18:53:22,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2018-02-02 18:53:22,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 623 transitions. [2018-02-02 18:53:22,632 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 623 transitions. Word has length 34 [2018-02-02 18:53:22,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:53:22,632 INFO L432 AbstractCegarLoop]: Abstraction has 441 states and 623 transitions. [2018-02-02 18:53:22,632 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 18:53:22,632 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 623 transitions. [2018-02-02 18:53:22,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 18:53:22,633 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:53:22,633 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:53:22,633 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:53:22,633 INFO L82 PathProgramCache]: Analyzing trace with hash -700463843, now seen corresponding path program 1 times [2018-02-02 18:53:22,633 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:53:22,633 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:53:22,634 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:53:22,634 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:53:22,634 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:53:22,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:53:22,646 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:53:22,802 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:53:22,803 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:53:22,803 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-02 18:53:22,808 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:53:22,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:53:22,826 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:53:22,829 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:53:22,829 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:53:22,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 18:53:22,830 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:53:22,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:53:22,831 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-02-02 18:53:22,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-02 18:53:22,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-02 18:53:22,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:53:22,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:53:22,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:53:22,849 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-02-02 18:53:22,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-02-02 18:53:22,867 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 14 treesize of output 13 [2018-02-02 18:53:22,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:53:22,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:53:22,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:53:22,875 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:16 [2018-02-02 18:53:22,887 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:53:22,887 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:53:22,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 18:53:22,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:53:22,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:53:22,891 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:15 [2018-02-02 18:53:22,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2018-02-02 18:53:22,931 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-02 18:53:22,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:53:22,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:53:22,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:53:22,938 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:15 [2018-02-02 18:53:22,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-02-02 18:53:22,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-02-02 18:53:22,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:53:22,975 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:53:22,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:53:22,980 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:36 [2018-02-02 18:53:25,021 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 18 treesize of output 17 [2018-02-02 18:53:25,021 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:53:25,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 18:53:25,026 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:41 [2018-02-02 18:53:27,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 31 [2018-02-02 18:53:27,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-02-02 18:53:27,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:53:27,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2018-02-02 18:53:27,056 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 18:53:27,057 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:53:27,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:53:27,060 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:45, output treesize:5 [2018-02-02 18:53:27,088 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:53:27,113 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:53:27,114 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 14 [2018-02-02 18:53:27,114 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 18:53:27,114 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 18:53:27,114 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=173, Unknown=1, NotChecked=0, Total=210 [2018-02-02 18:53:27,114 INFO L87 Difference]: Start difference. First operand 441 states and 623 transitions. Second operand 15 states. [2018-02-02 18:53:47,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:53:47,999 INFO L93 Difference]: Finished difference Result 752 states and 987 transitions. [2018-02-02 18:53:47,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 18:53:47,999 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-02-02 18:53:47,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:53:48,000 INFO L225 Difference]: With dead ends: 752 [2018-02-02 18:53:48,000 INFO L226 Difference]: Without dead ends: 752 [2018-02-02 18:53:48,001 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 27 SyntacticMatches, 10 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=184, Invalid=509, Unknown=9, NotChecked=0, Total=702 [2018-02-02 18:53:48,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2018-02-02 18:53:48,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 440. [2018-02-02 18:53:48,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2018-02-02 18:53:48,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 622 transitions. [2018-02-02 18:53:48,007 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 622 transitions. Word has length 34 [2018-02-02 18:53:48,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:53:48,008 INFO L432 AbstractCegarLoop]: Abstraction has 440 states and 622 transitions. [2018-02-02 18:53:48,008 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 18:53:48,008 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 622 transitions. [2018-02-02 18:53:48,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 18:53:48,008 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:53:48,008 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:53:48,008 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:53:48,009 INFO L82 PathProgramCache]: Analyzing trace with hash -700463842, now seen corresponding path program 1 times [2018-02-02 18:53:48,009 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:53:48,009 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:53:48,009 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:53:48,010 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:53:48,010 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:53:48,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:53:48,024 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:53:48,213 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:53:48,214 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:53:48,214 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-02 18:53:48,218 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:53:48,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:53:48,236 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:53:48,238 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:53:48,239 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:53:48,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 18:53:48,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:53:48,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:53:48,249 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-02-02 18:53:48,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-02 18:53:48,258 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-02 18:53:48,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:53:48,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:53:48,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-02 18:53:48,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-02 18:53:48,265 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:53:48,267 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:53:48,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:53:48,270 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 [2018-02-02 18:53:48,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-02-02 18:53:48,283 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 14 treesize of output 13 [2018-02-02 18:53:48,283 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:53:48,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:53:48,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2018-02-02 18:53:48,300 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 14 treesize of output 13 [2018-02-02 18:53:48,300 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:53:48,303 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:53:48,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:53:48,308 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:71, output treesize:25 [2018-02-02 18:53:48,312 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:53:48,313 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:53:48,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 18:53:48,313 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:53:48,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:53:48,316 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:24 [2018-02-02 18:53:48,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-02-02 18:53:48,362 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-02 18:53:48,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:53:48,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:53:48,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2018-02-02 18:53:48,379 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-02 18:53:48,379 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:53:48,383 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:53:48,390 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-02 18:53:48,390 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:76, output treesize:46 [2018-02-02 18:53:48,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 73 [2018-02-02 18:53:48,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-02-02 18:53:48,501 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:53:48,507 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:53:48,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-02-02 18:53:48,518 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 14 treesize of output 13 [2018-02-02 18:53:48,519 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:53:48,522 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:53:48,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:53:48,529 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:100, output treesize:56 [2018-02-02 18:53:52,556 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:53:52,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-02-02 18:53:52,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:53:52,567 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:53:52,567 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:53:52,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 10 [2018-02-02 18:53:52,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:53:52,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 18:53:52,574 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:67, output treesize:60 [2018-02-02 18:53:52,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 39 [2018-02-02 18:53:52,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-02-02 18:53:52,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:53:52,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 14 [2018-02-02 18:53:52,611 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 18:53:52,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:53:52,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-02-02 18:53:52,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-02-02 18:53:52,620 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 18:53:52,622 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:53:52,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:53:52,626 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:78, output treesize:18 [2018-02-02 18:53:52,644 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:53:52,662 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:53:52,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 17 [2018-02-02 18:53:52,662 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 18:53:52,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 18:53:52,662 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=253, Unknown=2, NotChecked=0, Total=306 [2018-02-02 18:53:52,662 INFO L87 Difference]: Start difference. First operand 440 states and 622 transitions. Second operand 18 states. [2018-02-02 18:54:40,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:54:40,670 INFO L93 Difference]: Finished difference Result 752 states and 987 transitions. [2018-02-02 18:54:40,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 18:54:40,670 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-02-02 18:54:40,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:54:40,672 INFO L225 Difference]: With dead ends: 752 [2018-02-02 18:54:40,672 INFO L226 Difference]: Without dead ends: 752 [2018-02-02 18:54:40,672 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 23 SyntacticMatches, 10 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 28.7s TimeCoverageRelationStatistics Valid=246, Invalid=732, Unknown=14, NotChecked=0, Total=992 [2018-02-02 18:54:40,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2018-02-02 18:54:40,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 435. [2018-02-02 18:54:40,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-02-02 18:54:40,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 617 transitions. [2018-02-02 18:54:40,679 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 617 transitions. Word has length 34 [2018-02-02 18:54:40,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:54:40,680 INFO L432 AbstractCegarLoop]: Abstraction has 435 states and 617 transitions. [2018-02-02 18:54:40,680 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 18:54:40,680 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 617 transitions. [2018-02-02 18:54:40,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 18:54:40,680 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:54:40,680 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] [2018-02-02 18:54:40,680 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:54:40,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1878204096, now seen corresponding path program 1 times [2018-02-02 18:54:40,681 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:54:40,681 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:54:40,681 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:40,682 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:54:40,682 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:40,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:54:40,693 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:54:40,816 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-02 18:54:40,816 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:54:40,816 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 18:54:40,817 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 18:54:40,817 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 18:54:40,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-02-02 18:54:40,817 INFO L87 Difference]: Start difference. First operand 435 states and 617 transitions. Second operand 11 states. [2018-02-02 18:54:41,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:54:41,363 INFO L93 Difference]: Finished difference Result 670 states and 884 transitions. [2018-02-02 18:54:41,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 18:54:41,364 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2018-02-02 18:54:41,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:54:41,366 INFO L225 Difference]: With dead ends: 670 [2018-02-02 18:54:41,366 INFO L226 Difference]: Without dead ends: 670 [2018-02-02 18:54:41,366 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=175, Invalid=475, Unknown=0, NotChecked=0, Total=650 [2018-02-02 18:54:41,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2018-02-02 18:54:41,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 445. [2018-02-02 18:54:41,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-02-02 18:54:41,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 629 transitions. [2018-02-02 18:54:41,372 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 629 transitions. Word has length 35 [2018-02-02 18:54:41,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:54:41,372 INFO L432 AbstractCegarLoop]: Abstraction has 445 states and 629 transitions. [2018-02-02 18:54:41,372 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 18:54:41,372 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 629 transitions. [2018-02-02 18:54:41,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 18:54:41,372 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:54:41,373 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] [2018-02-02 18:54:41,373 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:54:41,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1878204095, now seen corresponding path program 1 times [2018-02-02 18:54:41,373 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:54:41,373 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:54:41,374 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:41,374 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:54:41,374 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:41,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:54:41,381 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:54:41,486 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-02 18:54:41,486 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:54:41,486 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 18:54:41,487 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 18:54:41,487 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 18:54:41,487 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 18:54:41,487 INFO L87 Difference]: Start difference. First operand 445 states and 629 transitions. Second operand 9 states. [2018-02-02 18:54:42,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:54:42,008 INFO L93 Difference]: Finished difference Result 855 states and 1135 transitions. [2018-02-02 18:54:42,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 18:54:42,008 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-02-02 18:54:42,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:54:42,009 INFO L225 Difference]: With dead ends: 855 [2018-02-02 18:54:42,010 INFO L226 Difference]: Without dead ends: 855 [2018-02-02 18:54:42,010 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-02-02 18:54:42,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2018-02-02 18:54:42,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 445. [2018-02-02 18:54:42,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-02-02 18:54:42,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 628 transitions. [2018-02-02 18:54:42,016 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 628 transitions. Word has length 35 [2018-02-02 18:54:42,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:54:42,016 INFO L432 AbstractCegarLoop]: Abstraction has 445 states and 628 transitions. [2018-02-02 18:54:42,016 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 18:54:42,016 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 628 transitions. [2018-02-02 18:54:42,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 18:54:42,016 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:54:42,016 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] [2018-02-02 18:54:42,017 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:54:42,017 INFO L82 PathProgramCache]: Analyzing trace with hash 672897990, now seen corresponding path program 1 times [2018-02-02 18:54:42,017 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:54:42,017 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:54:42,017 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:42,018 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:54:42,018 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:42,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:54:42,025 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:54:42,046 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-02 18:54:42,046 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:54:42,047 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:54:42,047 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:54:42,047 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:54:42,047 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:54:42,047 INFO L87 Difference]: Start difference. First operand 445 states and 628 transitions. Second operand 4 states. [2018-02-02 18:54:42,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:54:42,232 INFO L93 Difference]: Finished difference Result 1124 states and 1602 transitions. [2018-02-02 18:54:42,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 18:54:42,233 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-02-02 18:54:42,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:54:42,235 INFO L225 Difference]: With dead ends: 1124 [2018-02-02 18:54:42,236 INFO L226 Difference]: Without dead ends: 1124 [2018-02-02 18:54:42,236 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:54:42,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2018-02-02 18:54:42,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 442. [2018-02-02 18:54:42,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-02-02 18:54:42,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 626 transitions. [2018-02-02 18:54:42,243 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 626 transitions. Word has length 35 [2018-02-02 18:54:42,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:54:42,243 INFO L432 AbstractCegarLoop]: Abstraction has 442 states and 626 transitions. [2018-02-02 18:54:42,243 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:54:42,243 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 626 transitions. [2018-02-02 18:54:42,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 18:54:42,243 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:54:42,243 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] [2018-02-02 18:54:42,244 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:54:42,244 INFO L82 PathProgramCache]: Analyzing trace with hash 672897991, now seen corresponding path program 1 times [2018-02-02 18:54:42,244 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:54:42,244 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:54:42,244 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:42,245 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:54:42,245 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:42,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:54:42,251 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:54:42,294 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-02 18:54:42,294 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:54:42,294 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:54:42,294 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:54:42,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:54:42,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:54:42,294 INFO L87 Difference]: Start difference. First operand 442 states and 626 transitions. Second operand 4 states. [2018-02-02 18:54:42,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:54:42,393 INFO L93 Difference]: Finished difference Result 444 states and 627 transitions. [2018-02-02 18:54:42,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 18:54:42,393 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-02-02 18:54:42,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:54:42,394 INFO L225 Difference]: With dead ends: 444 [2018-02-02 18:54:42,394 INFO L226 Difference]: Without dead ends: 444 [2018-02-02 18:54:42,394 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-02 18:54:42,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-02-02 18:54:42,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 443. [2018-02-02 18:54:42,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-02-02 18:54:42,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 626 transitions. [2018-02-02 18:54:42,399 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 626 transitions. Word has length 35 [2018-02-02 18:54:42,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:54:42,399 INFO L432 AbstractCegarLoop]: Abstraction has 443 states and 626 transitions. [2018-02-02 18:54:42,399 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:54:42,399 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 626 transitions. [2018-02-02 18:54:42,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 18:54:42,400 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:54:42,400 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] [2018-02-02 18:54:42,400 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:54:42,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1767576820, now seen corresponding path program 1 times [2018-02-02 18:54:42,400 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:54:42,400 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:54:42,401 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:42,401 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:54:42,401 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:42,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:54:42,408 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:54:42,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:54:42,455 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:54:42,456 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 18:54:42,456 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 18:54:42,456 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 18:54:42,456 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 18:54:42,456 INFO L87 Difference]: Start difference. First operand 443 states and 626 transitions. Second operand 6 states. [2018-02-02 18:54:42,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:54:42,615 INFO L93 Difference]: Finished difference Result 541 states and 775 transitions. [2018-02-02 18:54:42,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 18:54:42,615 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-02-02 18:54:42,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:54:42,616 INFO L225 Difference]: With dead ends: 541 [2018-02-02 18:54:42,616 INFO L226 Difference]: Without dead ends: 541 [2018-02-02 18:54:42,616 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-02-02 18:54:42,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2018-02-02 18:54:42,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 452. [2018-02-02 18:54:42,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-02-02 18:54:42,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 638 transitions. [2018-02-02 18:54:42,619 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 638 transitions. Word has length 36 [2018-02-02 18:54:42,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:54:42,620 INFO L432 AbstractCegarLoop]: Abstraction has 452 states and 638 transitions. [2018-02-02 18:54:42,620 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 18:54:42,620 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 638 transitions. [2018-02-02 18:54:42,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 18:54:42,620 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:54:42,620 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] [2018-02-02 18:54:42,620 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:54:42,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1761851182, now seen corresponding path program 1 times [2018-02-02 18:54:42,620 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:54:42,620 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:54:42,621 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:42,621 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:54:42,621 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:42,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:54:42,628 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:54:42,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:54:42,812 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:54:42,812 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 18:54:42,812 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 18:54:42,812 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 18:54:42,812 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-02-02 18:54:42,812 INFO L87 Difference]: Start difference. First operand 452 states and 638 transitions. Second operand 13 states. [2018-02-02 18:54:43,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:54:43,473 INFO L93 Difference]: Finished difference Result 574 states and 779 transitions. [2018-02-02 18:54:43,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 18:54:43,473 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-02-02 18:54:43,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:54:43,474 INFO L225 Difference]: With dead ends: 574 [2018-02-02 18:54:43,474 INFO L226 Difference]: Without dead ends: 574 [2018-02-02 18:54:43,475 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2018-02-02 18:54:43,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2018-02-02 18:54:43,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 410. [2018-02-02 18:54:43,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-02-02 18:54:43,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 565 transitions. [2018-02-02 18:54:43,477 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 565 transitions. Word has length 36 [2018-02-02 18:54:43,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:54:43,477 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 565 transitions. [2018-02-02 18:54:43,477 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 18:54:43,478 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 565 transitions. [2018-02-02 18:54:43,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 18:54:43,478 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:54:43,478 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] [2018-02-02 18:54:43,478 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:54:43,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1255975311, now seen corresponding path program 1 times [2018-02-02 18:54:43,478 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:54:43,478 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:54:43,479 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:43,479 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:54:43,479 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:43,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:54:43,486 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:54:43,578 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-02 18:54:43,578 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:54:43,578 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 18:54:43,578 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 18:54:43,578 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 18:54:43,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-02-02 18:54:43,579 INFO L87 Difference]: Start difference. First operand 410 states and 565 transitions. Second operand 11 states. [2018-02-02 18:54:43,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:54:43,964 INFO L93 Difference]: Finished difference Result 610 states and 784 transitions. [2018-02-02 18:54:43,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 18:54:43,964 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-02-02 18:54:43,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:54:43,965 INFO L225 Difference]: With dead ends: 610 [2018-02-02 18:54:43,965 INFO L226 Difference]: Without dead ends: 610 [2018-02-02 18:54:43,966 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=371, Unknown=0, NotChecked=0, Total=506 [2018-02-02 18:54:43,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2018-02-02 18:54:43,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 413. [2018-02-02 18:54:43,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-02-02 18:54:43,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 570 transitions. [2018-02-02 18:54:43,968 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 570 transitions. Word has length 38 [2018-02-02 18:54:43,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:54:43,968 INFO L432 AbstractCegarLoop]: Abstraction has 413 states and 570 transitions. [2018-02-02 18:54:43,969 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 18:54:43,969 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 570 transitions. [2018-02-02 18:54:43,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 18:54:43,969 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:54:43,969 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] [2018-02-02 18:54:43,969 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:54:43,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1255975312, now seen corresponding path program 1 times [2018-02-02 18:54:43,969 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:54:43,969 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:54:43,970 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:43,970 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:54:43,970 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:43,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:54:43,975 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:54:44,008 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-02 18:54:44,008 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:54:44,008 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 18:54:44,009 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 18:54:44,009 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 18:54:44,009 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:54:44,009 INFO L87 Difference]: Start difference. First operand 413 states and 570 transitions. Second operand 5 states. [2018-02-02 18:54:44,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:54:44,155 INFO L93 Difference]: Finished difference Result 412 states and 565 transitions. [2018-02-02 18:54:44,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 18:54:44,155 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-02-02 18:54:44,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:54:44,157 INFO L225 Difference]: With dead ends: 412 [2018-02-02 18:54:44,157 INFO L226 Difference]: Without dead ends: 412 [2018-02-02 18:54:44,157 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-02 18:54:44,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2018-02-02 18:54:44,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 412. [2018-02-02 18:54:44,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2018-02-02 18:54:44,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 565 transitions. [2018-02-02 18:54:44,161 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 565 transitions. Word has length 38 [2018-02-02 18:54:44,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:54:44,161 INFO L432 AbstractCegarLoop]: Abstraction has 412 states and 565 transitions. [2018-02-02 18:54:44,161 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 18:54:44,161 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 565 transitions. [2018-02-02 18:54:44,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 18:54:44,162 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:54:44,162 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] [2018-02-02 18:54:44,162 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:54:44,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1255976497, now seen corresponding path program 1 times [2018-02-02 18:54:44,162 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:54:44,162 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:54:44,163 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:44,163 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:54:44,163 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:44,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:54:44,169 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:54:44,201 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-02 18:54:44,202 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:54:44,202 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 18:54:44,202 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 18:54:44,202 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 18:54:44,202 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:54:44,203 INFO L87 Difference]: Start difference. First operand 412 states and 565 transitions. Second operand 5 states. [2018-02-02 18:54:44,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:54:44,316 INFO L93 Difference]: Finished difference Result 411 states and 561 transitions. [2018-02-02 18:54:44,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 18:54:44,317 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-02-02 18:54:44,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:54:44,317 INFO L225 Difference]: With dead ends: 411 [2018-02-02 18:54:44,318 INFO L226 Difference]: Without dead ends: 411 [2018-02-02 18:54:44,318 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-02 18:54:44,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-02-02 18:54:44,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2018-02-02 18:54:44,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-02-02 18:54:44,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 561 transitions. [2018-02-02 18:54:44,320 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 561 transitions. Word has length 38 [2018-02-02 18:54:44,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:54:44,320 INFO L432 AbstractCegarLoop]: Abstraction has 411 states and 561 transitions. [2018-02-02 18:54:44,320 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 18:54:44,320 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 561 transitions. [2018-02-02 18:54:44,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 18:54:44,321 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:54:44,321 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] [2018-02-02 18:54:44,321 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:54:44,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1255976498, now seen corresponding path program 1 times [2018-02-02 18:54:44,321 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:54:44,321 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:54:44,321 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:44,322 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:54:44,322 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:44,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:54:44,328 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:54:44,367 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-02 18:54:44,367 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:54:44,367 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 18:54:44,367 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 18:54:44,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 18:54:44,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:54:44,368 INFO L87 Difference]: Start difference. First operand 411 states and 561 transitions. Second operand 5 states. [2018-02-02 18:54:44,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:54:44,508 INFO L93 Difference]: Finished difference Result 410 states and 557 transitions. [2018-02-02 18:54:44,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 18:54:44,508 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-02-02 18:54:44,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:54:44,509 INFO L225 Difference]: With dead ends: 410 [2018-02-02 18:54:44,509 INFO L226 Difference]: Without dead ends: 410 [2018-02-02 18:54:44,509 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-02 18:54:44,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-02-02 18:54:44,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2018-02-02 18:54:44,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-02-02 18:54:44,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 557 transitions. [2018-02-02 18:54:44,512 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 557 transitions. Word has length 38 [2018-02-02 18:54:44,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:54:44,512 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 557 transitions. [2018-02-02 18:54:44,512 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 18:54:44,512 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 557 transitions. [2018-02-02 18:54:44,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 18:54:44,512 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:54:44,512 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] [2018-02-02 18:54:44,512 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:54:44,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1691774874, now seen corresponding path program 1 times [2018-02-02 18:54:44,513 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:54:44,513 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:54:44,513 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:44,513 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:54:44,513 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:44,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:54:44,519 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:54:44,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:54:44,574 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:54:44,574 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 18:54:44,575 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 18:54:44,575 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 18:54:44,575 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-02 18:54:44,575 INFO L87 Difference]: Start difference. First operand 410 states and 557 transitions. Second operand 6 states. [2018-02-02 18:54:44,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:54:44,790 INFO L93 Difference]: Finished difference Result 852 states and 1192 transitions. [2018-02-02 18:54:44,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 18:54:44,790 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-02-02 18:54:44,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:54:44,791 INFO L225 Difference]: With dead ends: 852 [2018-02-02 18:54:44,791 INFO L226 Difference]: Without dead ends: 852 [2018-02-02 18:54:44,792 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-02-02 18:54:44,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2018-02-02 18:54:44,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 414. [2018-02-02 18:54:44,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2018-02-02 18:54:44,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 561 transitions. [2018-02-02 18:54:44,795 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 561 transitions. Word has length 38 [2018-02-02 18:54:44,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:54:44,795 INFO L432 AbstractCegarLoop]: Abstraction has 414 states and 561 transitions. [2018-02-02 18:54:44,795 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 18:54:44,795 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 561 transitions. [2018-02-02 18:54:44,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 18:54:44,796 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:54:44,796 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] [2018-02-02 18:54:44,796 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:54:44,796 INFO L82 PathProgramCache]: Analyzing trace with hash 156771650, now seen corresponding path program 1 times [2018-02-02 18:54:44,796 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:54:44,796 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:54:44,797 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:44,797 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:54:44,797 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:44,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:54:44,802 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:54:44,816 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-02 18:54:44,816 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:54:44,816 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:54:44,817 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:54:44,817 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:54:44,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:54:44,817 INFO L87 Difference]: Start difference. First operand 414 states and 561 transitions. Second operand 4 states. [2018-02-02 18:54:44,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:54:44,980 INFO L93 Difference]: Finished difference Result 1097 states and 1518 transitions. [2018-02-02 18:54:44,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 18:54:44,981 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-02-02 18:54:44,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:54:44,982 INFO L225 Difference]: With dead ends: 1097 [2018-02-02 18:54:44,982 INFO L226 Difference]: Without dead ends: 1097 [2018-02-02 18:54:44,983 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:54:44,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2018-02-02 18:54:44,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 413. [2018-02-02 18:54:44,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-02-02 18:54:44,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 560 transitions. [2018-02-02 18:54:44,987 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 560 transitions. Word has length 39 [2018-02-02 18:54:44,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:54:44,987 INFO L432 AbstractCegarLoop]: Abstraction has 413 states and 560 transitions. [2018-02-02 18:54:44,987 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:54:44,987 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 560 transitions. [2018-02-02 18:54:44,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 18:54:44,987 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:54:44,987 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] [2018-02-02 18:54:44,987 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:54:44,987 INFO L82 PathProgramCache]: Analyzing trace with hash 156771651, now seen corresponding path program 1 times [2018-02-02 18:54:44,987 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:54:44,987 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:54:44,988 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:44,988 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:54:44,988 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:44,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:54:44,993 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:54:45,035 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-02 18:54:45,036 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:54:45,036 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:54:45,036 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:54:45,036 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:54:45,036 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:54:45,036 INFO L87 Difference]: Start difference. First operand 413 states and 560 transitions. Second operand 4 states. [2018-02-02 18:54:45,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:54:45,124 INFO L93 Difference]: Finished difference Result 411 states and 558 transitions. [2018-02-02 18:54:45,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 18:54:45,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-02-02 18:54:45,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:54:45,125 INFO L225 Difference]: With dead ends: 411 [2018-02-02 18:54:45,125 INFO L226 Difference]: Without dead ends: 411 [2018-02-02 18:54:45,125 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-02 18:54:45,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-02-02 18:54:45,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2018-02-02 18:54:45,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-02-02 18:54:45,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 558 transitions. [2018-02-02 18:54:45,127 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 558 transitions. Word has length 39 [2018-02-02 18:54:45,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:54:45,127 INFO L432 AbstractCegarLoop]: Abstraction has 411 states and 558 transitions. [2018-02-02 18:54:45,127 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:54:45,127 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 558 transitions. [2018-02-02 18:54:45,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 18:54:45,128 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:54:45,128 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] [2018-02-02 18:54:45,128 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:54:45,128 INFO L82 PathProgramCache]: Analyzing trace with hash 106473297, now seen corresponding path program 1 times [2018-02-02 18:54:45,128 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:54:45,128 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:54:45,129 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:45,129 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:54:45,129 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:45,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:54:45,133 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:54:45,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:54:45,267 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:54:45,267 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-02 18:54:45,267 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 18:54:45,267 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 18:54:45,267 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2018-02-02 18:54:45,267 INFO L87 Difference]: Start difference. First operand 411 states and 558 transitions. Second operand 15 states. [2018-02-02 18:54:45,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:54:45,984 INFO L93 Difference]: Finished difference Result 722 states and 905 transitions. [2018-02-02 18:54:45,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 18:54:45,984 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2018-02-02 18:54:45,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:54:45,985 INFO L225 Difference]: With dead ends: 722 [2018-02-02 18:54:45,985 INFO L226 Difference]: Without dead ends: 722 [2018-02-02 18:54:45,986 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=328, Invalid=1154, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 18:54:45,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2018-02-02 18:54:45,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 438. [2018-02-02 18:54:45,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-02-02 18:54:45,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 600 transitions. [2018-02-02 18:54:45,989 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 600 transitions. Word has length 40 [2018-02-02 18:54:45,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:54:45,989 INFO L432 AbstractCegarLoop]: Abstraction has 438 states and 600 transitions. [2018-02-02 18:54:45,989 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 18:54:45,989 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 600 transitions. [2018-02-02 18:54:45,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 18:54:45,989 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:54:45,989 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] [2018-02-02 18:54:45,990 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:54:45,990 INFO L82 PathProgramCache]: Analyzing trace with hash -958985529, now seen corresponding path program 1 times [2018-02-02 18:54:45,990 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:54:45,990 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:54:45,990 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:45,990 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:54:45,990 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:45,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:54:45,994 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:54:46,183 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-02 18:54:46,184 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:54:46,184 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-02-02 18:54:46,184 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 18:54:46,184 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 18:54:46,184 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-02-02 18:54:46,184 INFO L87 Difference]: Start difference. First operand 438 states and 600 transitions. Second operand 16 states. [2018-02-02 18:54:46,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:54:46,751 INFO L93 Difference]: Finished difference Result 755 states and 959 transitions. [2018-02-02 18:54:46,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 18:54:46,816 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2018-02-02 18:54:46,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:54:46,818 INFO L225 Difference]: With dead ends: 755 [2018-02-02 18:54:46,818 INFO L226 Difference]: Without dead ends: 755 [2018-02-02 18:54:46,818 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=729, Unknown=0, NotChecked=0, Total=870 [2018-02-02 18:54:46,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2018-02-02 18:54:46,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 443. [2018-02-02 18:54:46,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-02-02 18:54:46,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 606 transitions. [2018-02-02 18:54:46,821 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 606 transitions. Word has length 41 [2018-02-02 18:54:46,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:54:46,821 INFO L432 AbstractCegarLoop]: Abstraction has 443 states and 606 transitions. [2018-02-02 18:54:46,821 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 18:54:46,821 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 606 transitions. [2018-02-02 18:54:46,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 18:54:46,821 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:54:46,821 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] [2018-02-02 18:54:46,821 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr96RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr100EnsuresViolation, mainErr87RequiresViolation, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr92RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr93RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr97RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr99RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr98RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 18:54:46,822 INFO L82 PathProgramCache]: Analyzing trace with hash -958985528, now seen corresponding path program 1 times [2018-02-02 18:54:46,822 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:54:46,822 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:54:46,822 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:46,822 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:54:46,822 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:54:46,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:54:46,827 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-02-02 18:54:46,855 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 18:54:46,860 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 18:54:46,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 06:54:46 BoogieIcfgContainer [2018-02-02 18:54:46,860 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 18:54:46,861 INFO L168 Benchmark]: Toolchain (without parser) took 94963.42 ms. Allocated memory was 399.0 MB in the beginning and 809.5 MB in the end (delta: 410.5 MB). Free memory was 355.7 MB in the beginning and 526.5 MB in the end (delta: -170.8 MB). Peak memory consumption was 239.7 MB. Max. memory is 5.3 GB. [2018-02-02 18:54:46,862 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 399.0 MB. Free memory is still 362.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 18:54:46,862 INFO L168 Benchmark]: CACSL2BoogieTranslator took 171.38 ms. Allocated memory is still 399.0 MB. Free memory was 355.7 MB in the beginning and 343.8 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. [2018-02-02 18:54:46,863 INFO L168 Benchmark]: Boogie Preprocessor took 31.07 ms. Allocated memory is still 399.0 MB. Free memory was 343.8 MB in the beginning and 342.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 18:54:46,863 INFO L168 Benchmark]: RCFGBuilder took 526.90 ms. Allocated memory is still 399.0 MB. Free memory was 342.5 MB in the beginning and 288.0 MB in the end (delta: 54.5 MB). Peak memory consumption was 54.5 MB. Max. memory is 5.3 GB. [2018-02-02 18:54:46,863 INFO L168 Benchmark]: TraceAbstraction took 94231.40 ms. Allocated memory was 399.0 MB in the beginning and 809.5 MB in the end (delta: 410.5 MB). Free memory was 286.7 MB in the beginning and 526.5 MB in the end (delta: -239.8 MB). Peak memory consumption was 170.7 MB. Max. memory is 5.3 GB. [2018-02-02 18:54:46,864 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.11 ms. Allocated memory is still 399.0 MB. Free memory is still 362.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 171.38 ms. Allocated memory is still 399.0 MB. Free memory was 355.7 MB in the beginning and 343.8 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.07 ms. Allocated memory is still 399.0 MB. Free memory was 343.8 MB in the beginning and 342.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 526.90 ms. Allocated memory is still 399.0 MB. Free memory was 342.5 MB in the beginning and 288.0 MB in the end (delta: 54.5 MB). Peak memory consumption was 54.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 94231.40 ms. Allocated memory was 399.0 MB in the beginning and 809.5 MB in the end (delta: 410.5 MB). Free memory was 286.7 MB in the beginning and 526.5 MB in the end (delta: -239.8 MB). Peak memory consumption was 170.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 698). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 694). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 718). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 709). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 682). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 703). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 718). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 676). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 689). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 722). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 668). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 718). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 689). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 630]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 682). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 720). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 674). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 722). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 720). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 689). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 722). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 674). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 722). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 689). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 692). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 703). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 682). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 676). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 718). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 668). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 682). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 675). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 723). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 692). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 705). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 698). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 709). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 723). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 694). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 705). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 675). Cancelled while BasicCegarLoop was analyzing trace of length 42 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 40 interpolants. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 220 locations, 101 error locations. TIMEOUT Result, 94.1s OverallTime, 37 OverallIterations, 2 TraceHistogramMax, 81.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6398 SDtfs, 18871 SDslu, 18532 SDs, 0 SdLazy, 19457 SolverSat, 1137 SolverUnsat, 13 SolverUnknown, 0 SolverNotchecked, 35.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 562 GetRequests, 128 SyntacticMatches, 34 SemanticMatches, 400 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1447 ImplicationChecksByTransitivity, 53.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=452occurred in iteration=26, 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.2s AutomataMinimizationTime, 36 MinimizatonAttempts, 8359 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 11.7s InterpolantComputationTime, 1159 NumberOfCodeBlocks, 1159 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1120 ConstructedInterpolants, 16 QuantifiedInterpolants, 310991 SizeOfPredicates, 52 NumberOfNonLiveVariables, 477 ConjunctsInSsa, 93 ConjunctsInUnsatCore, 39 InterpolantComputations, 34 PerfectInterpolantSequences, 10/40 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_of_cslls_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_18-54-46-872.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_of_cslls_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_18-54-46-872.csv Completed graceful shutdown