java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 13:14:31,977 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 13:14:31,979 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 13:14:31,996 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 13:14:31,996 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 13:14:31,998 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 13:14:32,000 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 13:14:32,003 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 13:14:32,004 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 13:14:32,005 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 13:14:32,006 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 13:14:32,007 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 13:14:32,008 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 13:14:32,009 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 13:14:32,010 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 13:14:32,011 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 13:14:32,012 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 13:14:32,013 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 13:14:32,014 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 13:14:32,016 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 13:14:32,018 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 13:14:32,019 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 13:14:32,020 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 13:14:32,023 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 13:14:32,027 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 13:14:32,027 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 13:14:32,027 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 13:14:32,028 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 13:14:32,030 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 13:14:32,031 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 13:14:32,031 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 13:14:32,033 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 13:14:32,034 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 13:14:32,036 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 13:14:32,039 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 13:14:32,040 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 13:14:32,040 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 13:14:32,041 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 13:14:32,041 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 13:14:32,042 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 13:14:32,044 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 13:14:32,044 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 13:14:32,072 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 13:14:32,072 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 13:14:32,075 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 13:14:32,075 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 13:14:32,075 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 13:14:32,075 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 13:14:32,076 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 13:14:32,076 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 13:14:32,076 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 13:14:32,076 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 13:14:32,077 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 13:14:32,077 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 13:14:32,078 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 13:14:32,078 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 13:14:32,078 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 13:14:32,078 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 13:14:32,079 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 13:14:32,079 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 13:14:32,079 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 13:14:32,079 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 13:14:32,080 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 13:14:32,080 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:14:32,080 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 13:14:32,080 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 13:14:32,081 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 13:14:32,081 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 13:14:32,081 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 13:14:32,081 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 13:14:32,081 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 13:14:32,117 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 13:14:32,130 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 13:14:32,133 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 13:14:32,135 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 13:14:32,135 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 13:14:32,136 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-08 13:14:32,198 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f959705d8/610d2c0bad544b4281fb1b1a51226b0a/FLAG406e66816 [2019-09-08 13:14:32,804 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 13:14:32,805 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-08 13:14:32,845 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f959705d8/610d2c0bad544b4281fb1b1a51226b0a/FLAG406e66816 [2019-09-08 13:14:33,042 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f959705d8/610d2c0bad544b4281fb1b1a51226b0a [2019-09-08 13:14:33,055 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 13:14:33,057 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 13:14:33,058 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 13:14:33,058 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 13:14:33,063 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 13:14:33,064 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:14:33" (1/1) ... [2019-09-08 13:14:33,068 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51e0c27a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:14:33, skipping insertion in model container [2019-09-08 13:14:33,069 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:14:33" (1/1) ... [2019-09-08 13:14:33,077 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 13:14:33,193 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 13:14:34,174 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:14:34,203 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 13:14:34,501 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:14:34,524 INFO L192 MainTranslator]: Completed translation [2019-09-08 13:14:34,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:14:34 WrapperNode [2019-09-08 13:14:34,525 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 13:14:34,526 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 13:14:34,526 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 13:14:34,527 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 13:14:34,542 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:14:34" (1/1) ... [2019-09-08 13:14:34,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:14:34" (1/1) ... [2019-09-08 13:14:34,566 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:14:34" (1/1) ... [2019-09-08 13:14:34,566 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:14:34" (1/1) ... [2019-09-08 13:14:34,620 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:14:34" (1/1) ... [2019-09-08 13:14:34,655 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:14:34" (1/1) ... [2019-09-08 13:14:34,670 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:14:34" (1/1) ... [2019-09-08 13:14:34,691 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 13:14:34,695 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 13:14:34,695 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 13:14:34,695 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 13:14:34,697 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:14:34" (1/1) ... No working directory specified, using /storage/repos/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 [2019-09-08 13:14:34,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 13:14:34,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 13:14:34,789 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 13:14:34,798 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 13:14:34,799 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 13:14:34,799 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 13:14:34,800 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 13:14:34,800 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 13:14:34,800 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 13:14:34,801 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 13:14:34,801 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 13:14:34,801 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 13:14:34,802 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 13:14:34,802 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 13:14:34,804 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 13:14:34,804 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 13:14:34,807 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 13:14:34,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 13:14:34,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 13:14:37,427 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 13:14:37,428 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 13:14:37,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:14:37 BoogieIcfgContainer [2019-09-08 13:14:37,430 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 13:14:37,431 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 13:14:37,431 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 13:14:37,434 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 13:14:37,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:14:33" (1/3) ... [2019-09-08 13:14:37,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60a1c8b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:14:37, skipping insertion in model container [2019-09-08 13:14:37,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:14:34" (2/3) ... [2019-09-08 13:14:37,436 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60a1c8b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:14:37, skipping insertion in model container [2019-09-08 13:14:37,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:14:37" (3/3) ... [2019-09-08 13:14:37,438 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-08 13:14:37,448 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 13:14:37,458 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-09-08 13:14:37,475 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-09-08 13:14:37,515 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 13:14:37,515 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 13:14:37,516 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 13:14:37,516 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 13:14:37,516 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 13:14:37,516 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 13:14:37,516 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 13:14:37,516 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 13:14:37,517 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 13:14:37,551 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states. [2019-09-08 13:14:37,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-09-08 13:14:37,581 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:14:37,582 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:14:37,585 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:14:37,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:14:37,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1175145062, now seen corresponding path program 1 times [2019-09-08 13:14:37,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:14:37,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:14:37,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:14:37,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:14:37,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:14:38,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:14:38,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:14:38,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:14:38,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:14:38,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:14:38,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:14:38,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:14:38,903 INFO L87 Difference]: Start difference. First operand 676 states. Second operand 4 states. [2019-09-08 13:14:39,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:14:39,283 INFO L93 Difference]: Finished difference Result 1981 states and 3537 transitions. [2019-09-08 13:14:39,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 13:14:39,286 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 247 [2019-09-08 13:14:39,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:14:39,313 INFO L225 Difference]: With dead ends: 1981 [2019-09-08 13:14:39,314 INFO L226 Difference]: Without dead ends: 1312 [2019-09-08 13:14:39,326 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:14:39,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2019-09-08 13:14:39,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1276. [2019-09-08 13:14:39,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1276 states. [2019-09-08 13:14:39,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 1995 transitions. [2019-09-08 13:14:39,509 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 1995 transitions. Word has length 247 [2019-09-08 13:14:39,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:14:39,511 INFO L475 AbstractCegarLoop]: Abstraction has 1276 states and 1995 transitions. [2019-09-08 13:14:39,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:14:39,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1995 transitions. [2019-09-08 13:14:39,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-08 13:14:39,526 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:14:39,526 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:14:39,527 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:14:39,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:14:39,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1529579486, now seen corresponding path program 1 times [2019-09-08 13:14:39,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:14:39,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:14:39,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:14:39,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:14:39,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:14:39,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:14:39,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:14:39,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:14:39,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:14:39,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:14:39,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:14:39,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:14:39,810 INFO L87 Difference]: Start difference. First operand 1276 states and 1995 transitions. Second operand 3 states. [2019-09-08 13:14:40,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:14:40,037 INFO L93 Difference]: Finished difference Result 3648 states and 5675 transitions. [2019-09-08 13:14:40,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:14:40,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 249 [2019-09-08 13:14:40,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:14:40,055 INFO L225 Difference]: With dead ends: 3648 [2019-09-08 13:14:40,055 INFO L226 Difference]: Without dead ends: 2501 [2019-09-08 13:14:40,059 INFO L628 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 [2019-09-08 13:14:40,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2501 states. [2019-09-08 13:14:40,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2501 to 2467. [2019-09-08 13:14:40,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2467 states. [2019-09-08 13:14:40,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 3843 transitions. [2019-09-08 13:14:40,179 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 3843 transitions. Word has length 249 [2019-09-08 13:14:40,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:14:40,182 INFO L475 AbstractCegarLoop]: Abstraction has 2467 states and 3843 transitions. [2019-09-08 13:14:40,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:14:40,182 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 3843 transitions. [2019-09-08 13:14:40,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-08 13:14:40,190 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:14:40,191 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:14:40,191 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:14:40,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:14:40,192 INFO L82 PathProgramCache]: Analyzing trace with hash -810008519, now seen corresponding path program 1 times [2019-09-08 13:14:40,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:14:40,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:14:40,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:14:40,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:14:40,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:14:40,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:14:40,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:14:40,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:14:40,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:14:40,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:14:40,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:14:40,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:14:40,327 INFO L87 Difference]: Start difference. First operand 2467 states and 3843 transitions. Second operand 3 states. [2019-09-08 13:14:40,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:14:40,590 INFO L93 Difference]: Finished difference Result 7326 states and 11405 transitions. [2019-09-08 13:14:40,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:14:40,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 249 [2019-09-08 13:14:40,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:14:40,631 INFO L225 Difference]: With dead ends: 7326 [2019-09-08 13:14:40,631 INFO L226 Difference]: Without dead ends: 4901 [2019-09-08 13:14:40,644 INFO L628 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 [2019-09-08 13:14:40,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4901 states. [2019-09-08 13:14:40,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4901 to 2486. [2019-09-08 13:14:40,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2486 states. [2019-09-08 13:14:40,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 2486 states and 3871 transitions. [2019-09-08 13:14:40,937 INFO L78 Accepts]: Start accepts. Automaton has 2486 states and 3871 transitions. Word has length 249 [2019-09-08 13:14:40,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:14:40,937 INFO L475 AbstractCegarLoop]: Abstraction has 2486 states and 3871 transitions. [2019-09-08 13:14:40,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:14:40,938 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 3871 transitions. [2019-09-08 13:14:40,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-09-08 13:14:40,951 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:14:40,951 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:14:40,952 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:14:40,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:14:40,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1379810240, now seen corresponding path program 1 times [2019-09-08 13:14:40,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:14:40,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:14:40,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:14:40,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:14:40,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:14:40,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:14:41,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:14:41,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:14:41,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:14:41,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:14:41,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:14:41,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:14:41,161 INFO L87 Difference]: Start difference. First operand 2486 states and 3871 transitions. Second operand 3 states. [2019-09-08 13:14:41,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:14:41,407 INFO L93 Difference]: Finished difference Result 7345 states and 11426 transitions. [2019-09-08 13:14:41,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:14:41,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 250 [2019-09-08 13:14:41,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:14:41,434 INFO L225 Difference]: With dead ends: 7345 [2019-09-08 13:14:41,434 INFO L226 Difference]: Without dead ends: 4919 [2019-09-08 13:14:41,442 INFO L628 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 [2019-09-08 13:14:41,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4919 states. [2019-09-08 13:14:41,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4919 to 2504. [2019-09-08 13:14:41,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2504 states. [2019-09-08 13:14:41,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2504 states to 2504 states and 3892 transitions. [2019-09-08 13:14:41,663 INFO L78 Accepts]: Start accepts. Automaton has 2504 states and 3892 transitions. Word has length 250 [2019-09-08 13:14:41,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:14:41,663 INFO L475 AbstractCegarLoop]: Abstraction has 2504 states and 3892 transitions. [2019-09-08 13:14:41,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:14:41,664 INFO L276 IsEmpty]: Start isEmpty. Operand 2504 states and 3892 transitions. [2019-09-08 13:14:41,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-09-08 13:14:41,680 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:14:41,680 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:14:41,681 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:14:41,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:14:41,681 INFO L82 PathProgramCache]: Analyzing trace with hash 697546131, now seen corresponding path program 1 times [2019-09-08 13:14:41,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:14:41,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:14:41,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:14:41,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:14:41,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:14:41,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:14:41,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:14:41,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:14:41,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:14:41,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:14:41,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:14:41,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:14:41,972 INFO L87 Difference]: Start difference. First operand 2504 states and 3892 transitions. Second operand 3 states. [2019-09-08 13:14:42,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:14:42,259 INFO L93 Difference]: Finished difference Result 5033 states and 7866 transitions. [2019-09-08 13:14:42,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:14:42,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 251 [2019-09-08 13:14:42,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:14:42,277 INFO L225 Difference]: With dead ends: 5033 [2019-09-08 13:14:42,277 INFO L226 Difference]: Without dead ends: 3352 [2019-09-08 13:14:42,284 INFO L628 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 [2019-09-08 13:14:42,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3352 states. [2019-09-08 13:14:42,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3352 to 2992. [2019-09-08 13:14:42,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2992 states. [2019-09-08 13:14:42,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2992 states to 2992 states and 4698 transitions. [2019-09-08 13:14:42,458 INFO L78 Accepts]: Start accepts. Automaton has 2992 states and 4698 transitions. Word has length 251 [2019-09-08 13:14:42,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:14:42,459 INFO L475 AbstractCegarLoop]: Abstraction has 2992 states and 4698 transitions. [2019-09-08 13:14:42,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:14:42,459 INFO L276 IsEmpty]: Start isEmpty. Operand 2992 states and 4698 transitions. [2019-09-08 13:14:42,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-09-08 13:14:42,466 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:14:42,467 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:14:42,467 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:14:42,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:14:42,467 INFO L82 PathProgramCache]: Analyzing trace with hash -731341597, now seen corresponding path program 1 times [2019-09-08 13:14:42,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:14:42,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:14:42,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:14:42,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:14:42,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:14:42,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:14:42,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:14:42,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:14:42,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:14:42,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:14:42,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:14:42,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:14:42,691 INFO L87 Difference]: Start difference. First operand 2992 states and 4698 transitions. Second operand 3 states. [2019-09-08 13:14:43,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:14:43,062 INFO L93 Difference]: Finished difference Result 8516 states and 13317 transitions. [2019-09-08 13:14:43,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:14:43,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 251 [2019-09-08 13:14:43,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:14:43,089 INFO L225 Difference]: With dead ends: 8516 [2019-09-08 13:14:43,089 INFO L226 Difference]: Without dead ends: 5769 [2019-09-08 13:14:43,095 INFO L628 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 [2019-09-08 13:14:43,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5769 states. [2019-09-08 13:14:43,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5769 to 5737. [2019-09-08 13:14:43,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5737 states. [2019-09-08 13:14:43,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5737 states to 5737 states and 8952 transitions. [2019-09-08 13:14:43,505 INFO L78 Accepts]: Start accepts. Automaton has 5737 states and 8952 transitions. Word has length 251 [2019-09-08 13:14:43,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:14:43,508 INFO L475 AbstractCegarLoop]: Abstraction has 5737 states and 8952 transitions. [2019-09-08 13:14:43,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:14:43,508 INFO L276 IsEmpty]: Start isEmpty. Operand 5737 states and 8952 transitions. [2019-09-08 13:14:43,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-09-08 13:14:43,520 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:14:43,520 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:14:43,520 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:14:43,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:14:43,524 INFO L82 PathProgramCache]: Analyzing trace with hash 816882406, now seen corresponding path program 1 times [2019-09-08 13:14:43,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:14:43,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:14:43,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:14:43,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:14:43,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:14:43,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:14:44,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:14:44,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:14:44,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:14:44,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:14:44,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:14:44,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:14:44,027 INFO L87 Difference]: Start difference. First operand 5737 states and 8952 transitions. Second operand 4 states. [2019-09-08 13:14:44,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:14:44,740 INFO L93 Difference]: Finished difference Result 15687 states and 24321 transitions. [2019-09-08 13:14:44,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:14:44,741 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 251 [2019-09-08 13:14:44,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:14:44,781 INFO L225 Difference]: With dead ends: 15687 [2019-09-08 13:14:44,781 INFO L226 Difference]: Without dead ends: 10490 [2019-09-08 13:14:44,794 INFO L628 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 [2019-09-08 13:14:44,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10490 states. [2019-09-08 13:14:45,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10490 to 5972. [2019-09-08 13:14:45,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5972 states. [2019-09-08 13:14:45,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5972 states to 5972 states and 9340 transitions. [2019-09-08 13:14:45,169 INFO L78 Accepts]: Start accepts. Automaton has 5972 states and 9340 transitions. Word has length 251 [2019-09-08 13:14:45,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:14:45,170 INFO L475 AbstractCegarLoop]: Abstraction has 5972 states and 9340 transitions. [2019-09-08 13:14:45,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:14:45,170 INFO L276 IsEmpty]: Start isEmpty. Operand 5972 states and 9340 transitions. [2019-09-08 13:14:45,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-09-08 13:14:45,182 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:14:45,182 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:14:45,182 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:14:45,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:14:45,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1584390844, now seen corresponding path program 1 times [2019-09-08 13:14:45,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:14:45,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:14:45,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:14:45,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:14:45,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:14:45,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:14:45,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:14:45,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:14:45,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:14:45,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:14:45,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:14:45,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:14:45,343 INFO L87 Difference]: Start difference. First operand 5972 states and 9340 transitions. Second operand 3 states. [2019-09-08 13:14:45,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:14:45,833 INFO L93 Difference]: Finished difference Result 12210 states and 19289 transitions. [2019-09-08 13:14:45,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:14:45,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 253 [2019-09-08 13:14:45,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:14:45,854 INFO L225 Difference]: With dead ends: 12210 [2019-09-08 13:14:45,855 INFO L226 Difference]: Without dead ends: 8313 [2019-09-08 13:14:45,865 INFO L628 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 [2019-09-08 13:14:45,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8313 states. [2019-09-08 13:14:46,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8313 to 7696. [2019-09-08 13:14:46,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7696 states. [2019-09-08 13:14:46,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7696 states to 7696 states and 12172 transitions. [2019-09-08 13:14:46,429 INFO L78 Accepts]: Start accepts. Automaton has 7696 states and 12172 transitions. Word has length 253 [2019-09-08 13:14:46,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:14:46,429 INFO L475 AbstractCegarLoop]: Abstraction has 7696 states and 12172 transitions. [2019-09-08 13:14:46,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:14:46,429 INFO L276 IsEmpty]: Start isEmpty. Operand 7696 states and 12172 transitions. [2019-09-08 13:14:46,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-09-08 13:14:46,447 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:14:46,448 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:14:46,448 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:14:46,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:14:46,449 INFO L82 PathProgramCache]: Analyzing trace with hash -551410647, now seen corresponding path program 1 times [2019-09-08 13:14:46,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:14:46,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:14:46,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:14:46,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:14:46,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:14:46,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:14:46,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:14:46,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:14:46,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:14:46,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:14:46,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:14:46,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:14:46,587 INFO L87 Difference]: Start difference. First operand 7696 states and 12172 transitions. Second operand 3 states. [2019-09-08 13:14:47,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:14:47,338 INFO L93 Difference]: Finished difference Result 21518 states and 33797 transitions. [2019-09-08 13:14:47,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:14:47,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 253 [2019-09-08 13:14:47,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:14:47,373 INFO L225 Difference]: With dead ends: 21518 [2019-09-08 13:14:47,373 INFO L226 Difference]: Without dead ends: 14625 [2019-09-08 13:14:47,390 INFO L628 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 [2019-09-08 13:14:47,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14625 states. [2019-09-08 13:14:47,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14625 to 7800. [2019-09-08 13:14:47,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7800 states. [2019-09-08 13:14:47,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7800 states to 7800 states and 12315 transitions. [2019-09-08 13:14:47,905 INFO L78 Accepts]: Start accepts. Automaton has 7800 states and 12315 transitions. Word has length 253 [2019-09-08 13:14:47,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:14:47,906 INFO L475 AbstractCegarLoop]: Abstraction has 7800 states and 12315 transitions. [2019-09-08 13:14:47,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:14:47,906 INFO L276 IsEmpty]: Start isEmpty. Operand 7800 states and 12315 transitions. [2019-09-08 13:14:47,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-09-08 13:14:47,918 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:14:47,918 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:14:47,919 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:14:47,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:14:47,919 INFO L82 PathProgramCache]: Analyzing trace with hash -473843140, now seen corresponding path program 1 times [2019-09-08 13:14:47,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:14:47,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:14:47,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:14:47,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:14:47,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:14:48,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:14:48,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:14:48,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:14:48,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 13:14:48,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 13:14:48,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 13:14:48,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:14:48,278 INFO L87 Difference]: Start difference. First operand 7800 states and 12315 transitions. Second operand 5 states. [2019-09-08 13:14:49,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:14:49,725 INFO L93 Difference]: Finished difference Result 18667 states and 29709 transitions. [2019-09-08 13:14:49,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 13:14:49,726 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 254 [2019-09-08 13:14:49,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:14:49,758 INFO L225 Difference]: With dead ends: 18667 [2019-09-08 13:14:49,758 INFO L226 Difference]: Without dead ends: 12718 [2019-09-08 13:14:49,776 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 13:14:49,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12718 states. [2019-09-08 13:14:51,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12718 to 12716. [2019-09-08 13:14:51,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12716 states. [2019-09-08 13:14:51,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12716 states to 12716 states and 20175 transitions. [2019-09-08 13:14:51,310 INFO L78 Accepts]: Start accepts. Automaton has 12716 states and 20175 transitions. Word has length 254 [2019-09-08 13:14:51,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:14:51,319 INFO L475 AbstractCegarLoop]: Abstraction has 12716 states and 20175 transitions. [2019-09-08 13:14:51,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 13:14:51,319 INFO L276 IsEmpty]: Start isEmpty. Operand 12716 states and 20175 transitions. [2019-09-08 13:14:51,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-09-08 13:14:51,334 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:14:51,334 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:14:51,335 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:14:51,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:14:51,335 INFO L82 PathProgramCache]: Analyzing trace with hash -873233055, now seen corresponding path program 1 times [2019-09-08 13:14:51,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:14:51,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:14:51,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:14:51,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:14:51,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:14:51,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:14:51,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:14:51,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:14:51,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 13:14:51,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 13:14:51,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 13:14:51,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:14:51,829 INFO L87 Difference]: Start difference. First operand 12716 states and 20175 transitions. Second operand 9 states. [2019-09-08 13:14:54,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:14:54,959 INFO L93 Difference]: Finished difference Result 40385 states and 64523 transitions. [2019-09-08 13:14:54,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 13:14:54,960 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 254 [2019-09-08 13:14:54,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:14:55,027 INFO L225 Difference]: With dead ends: 40385 [2019-09-08 13:14:55,028 INFO L226 Difference]: Without dead ends: 29664 [2019-09-08 13:14:55,066 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-09-08 13:14:55,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29664 states. [2019-09-08 13:14:56,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29664 to 15960. [2019-09-08 13:14:56,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15960 states. [2019-09-08 13:14:56,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15960 states to 15960 states and 24847 transitions. [2019-09-08 13:14:56,202 INFO L78 Accepts]: Start accepts. Automaton has 15960 states and 24847 transitions. Word has length 254 [2019-09-08 13:14:56,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:14:56,203 INFO L475 AbstractCegarLoop]: Abstraction has 15960 states and 24847 transitions. [2019-09-08 13:14:56,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 13:14:56,203 INFO L276 IsEmpty]: Start isEmpty. Operand 15960 states and 24847 transitions. [2019-09-08 13:14:56,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-09-08 13:14:56,219 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:14:56,219 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:14:56,220 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:14:56,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:14:56,220 INFO L82 PathProgramCache]: Analyzing trace with hash -608288722, now seen corresponding path program 1 times [2019-09-08 13:14:56,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:14:56,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:14:56,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:14:56,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:14:56,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:14:56,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:14:56,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:14:56,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:14:56,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:14:56,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:14:56,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:14:56,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:14:56,817 INFO L87 Difference]: Start difference. First operand 15960 states and 24847 transitions. Second operand 4 states. [2019-09-08 13:14:59,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:14:59,611 INFO L93 Difference]: Finished difference Result 46871 states and 72998 transitions. [2019-09-08 13:14:59,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:14:59,612 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 254 [2019-09-08 13:14:59,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:14:59,676 INFO L225 Difference]: With dead ends: 46871 [2019-09-08 13:14:59,677 INFO L226 Difference]: Without dead ends: 30983 [2019-09-08 13:14:59,716 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:14:59,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30983 states. [2019-09-08 13:15:01,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30983 to 30956. [2019-09-08 13:15:01,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30956 states. [2019-09-08 13:15:01,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30956 states to 30956 states and 48004 transitions. [2019-09-08 13:15:01,457 INFO L78 Accepts]: Start accepts. Automaton has 30956 states and 48004 transitions. Word has length 254 [2019-09-08 13:15:01,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:15:01,458 INFO L475 AbstractCegarLoop]: Abstraction has 30956 states and 48004 transitions. [2019-09-08 13:15:01,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:15:01,458 INFO L276 IsEmpty]: Start isEmpty. Operand 30956 states and 48004 transitions. [2019-09-08 13:15:01,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-08 13:15:01,487 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:15:01,488 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:15:01,488 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:15:01,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:15:01,488 INFO L82 PathProgramCache]: Analyzing trace with hash 760775911, now seen corresponding path program 1 times [2019-09-08 13:15:01,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:15:01,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:15:01,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:01,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:15:01,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:01,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:15:01,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:15:01,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:15:01,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:15:01,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:15:01,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:15:01,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:15:01,677 INFO L87 Difference]: Start difference. First operand 30956 states and 48004 transitions. Second operand 3 states. [2019-09-08 13:15:04,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:15:04,690 INFO L93 Difference]: Finished difference Result 89651 states and 138810 transitions. [2019-09-08 13:15:04,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:15:04,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 256 [2019-09-08 13:15:04,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:15:04,792 INFO L225 Difference]: With dead ends: 89651 [2019-09-08 13:15:04,792 INFO L226 Difference]: Without dead ends: 60092 [2019-09-08 13:15:05,854 INFO L628 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 [2019-09-08 13:15:05,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60092 states. [2019-09-08 13:15:09,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60092 to 60067. [2019-09-08 13:15:09,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60067 states. [2019-09-08 13:15:09,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60067 states to 60067 states and 92763 transitions. [2019-09-08 13:15:09,133 INFO L78 Accepts]: Start accepts. Automaton has 60067 states and 92763 transitions. Word has length 256 [2019-09-08 13:15:09,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:15:09,133 INFO L475 AbstractCegarLoop]: Abstraction has 60067 states and 92763 transitions. [2019-09-08 13:15:09,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:15:09,134 INFO L276 IsEmpty]: Start isEmpty. Operand 60067 states and 92763 transitions. [2019-09-08 13:15:09,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-08 13:15:09,179 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:15:09,179 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:15:09,180 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:15:09,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:15:09,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1124780888, now seen corresponding path program 1 times [2019-09-08 13:15:09,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:15:09,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:15:09,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:09,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:15:09,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:09,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:15:09,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:15:09,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:15:09,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:15:09,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:15:09,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:15:09,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:15:09,288 INFO L87 Difference]: Start difference. First operand 60067 states and 92763 transitions. Second operand 3 states. [2019-09-08 13:15:16,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:15:16,613 INFO L93 Difference]: Finished difference Result 175567 states and 270554 transitions. [2019-09-08 13:15:16,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:15:16,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 256 [2019-09-08 13:15:16,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:15:16,790 INFO L225 Difference]: With dead ends: 175567 [2019-09-08 13:15:16,791 INFO L226 Difference]: Without dead ends: 117915 [2019-09-08 13:15:16,869 INFO L628 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 [2019-09-08 13:15:16,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117915 states. [2019-09-08 13:15:20,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117915 to 60553. [2019-09-08 13:15:20,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60553 states. [2019-09-08 13:15:20,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60553 states to 60553 states and 93316 transitions. [2019-09-08 13:15:20,719 INFO L78 Accepts]: Start accepts. Automaton has 60553 states and 93316 transitions. Word has length 256 [2019-09-08 13:15:20,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:15:20,719 INFO L475 AbstractCegarLoop]: Abstraction has 60553 states and 93316 transitions. [2019-09-08 13:15:20,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:15:20,719 INFO L276 IsEmpty]: Start isEmpty. Operand 60553 states and 93316 transitions. [2019-09-08 13:15:20,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-08 13:15:20,740 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:15:20,740 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:15:20,740 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:15:20,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:15:20,741 INFO L82 PathProgramCache]: Analyzing trace with hash -58340363, now seen corresponding path program 1 times [2019-09-08 13:15:20,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:15:20,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:15:20,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:20,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:15:20,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:20,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:15:20,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:15:20,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:15:20,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:15:20,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:15:20,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:15:20,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:15:20,896 INFO L87 Difference]: Start difference. First operand 60553 states and 93316 transitions. Second operand 3 states. [2019-09-08 13:15:27,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:15:27,370 INFO L93 Difference]: Finished difference Result 149938 states and 233806 transitions. [2019-09-08 13:15:27,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:15:27,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 257 [2019-09-08 13:15:27,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:15:27,508 INFO L225 Difference]: With dead ends: 149938 [2019-09-08 13:15:27,509 INFO L226 Difference]: Without dead ends: 97824 [2019-09-08 13:15:27,579 INFO L628 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 [2019-09-08 13:15:27,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97824 states. [2019-09-08 13:15:34,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97824 to 92281. [2019-09-08 13:15:34,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92281 states. [2019-09-08 13:15:35,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92281 states to 92281 states and 143204 transitions. [2019-09-08 13:15:35,054 INFO L78 Accepts]: Start accepts. Automaton has 92281 states and 143204 transitions. Word has length 257 [2019-09-08 13:15:35,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:15:35,055 INFO L475 AbstractCegarLoop]: Abstraction has 92281 states and 143204 transitions. [2019-09-08 13:15:35,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:15:35,055 INFO L276 IsEmpty]: Start isEmpty. Operand 92281 states and 143204 transitions. [2019-09-08 13:15:35,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-08 13:15:35,080 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:15:35,081 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:15:35,081 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:15:35,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:15:35,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1872293222, now seen corresponding path program 1 times [2019-09-08 13:15:35,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:15:35,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:15:35,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:35,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:15:35,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:35,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:15:35,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:15:35,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:15:35,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:15:35,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:15:35,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:15:35,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:15:35,320 INFO L87 Difference]: Start difference. First operand 92281 states and 143204 transitions. Second operand 3 states. [2019-09-08 13:15:47,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:15:47,816 INFO L93 Difference]: Finished difference Result 271873 states and 421698 transitions. [2019-09-08 13:15:47,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:15:47,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 257 [2019-09-08 13:15:47,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:15:48,064 INFO L225 Difference]: With dead ends: 271873 [2019-09-08 13:15:48,064 INFO L226 Difference]: Without dead ends: 181087 [2019-09-08 13:15:48,168 INFO L628 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 [2019-09-08 13:15:48,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181087 states. [2019-09-08 13:16:02,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181087 to 181064. [2019-09-08 13:16:02,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181064 states. [2019-09-08 13:16:02,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181064 states to 181064 states and 279538 transitions. [2019-09-08 13:16:02,970 INFO L78 Accepts]: Start accepts. Automaton has 181064 states and 279538 transitions. Word has length 257 [2019-09-08 13:16:02,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:16:02,970 INFO L475 AbstractCegarLoop]: Abstraction has 181064 states and 279538 transitions. [2019-09-08 13:16:02,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:16:02,971 INFO L276 IsEmpty]: Start isEmpty. Operand 181064 states and 279538 transitions. [2019-09-08 13:16:03,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-08 13:16:03,027 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:16:03,028 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:16:03,028 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:16:03,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:16:03,029 INFO L82 PathProgramCache]: Analyzing trace with hash -638091607, now seen corresponding path program 1 times [2019-09-08 13:16:03,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:16:03,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:16:03,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:16:03,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:16:03,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:16:03,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:16:03,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:16:03,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:16:03,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:16:03,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:16:03,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:16:03,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:16:03,366 INFO L87 Difference]: Start difference. First operand 181064 states and 279538 transitions. Second operand 4 states. [2019-09-08 13:16:28,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:16:28,722 INFO L93 Difference]: Finished difference Result 506924 states and 781474 transitions. [2019-09-08 13:16:28,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:16:28,723 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 257 [2019-09-08 13:16:28,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:16:29,235 INFO L225 Difference]: With dead ends: 506924 [2019-09-08 13:16:29,235 INFO L226 Difference]: Without dead ends: 329699 [2019-09-08 13:16:29,397 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:16:29,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329699 states. [2019-09-08 13:16:48,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329699 to 181686. [2019-09-08 13:16:48,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181686 states. [2019-09-08 13:16:48,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181686 states to 181686 states and 280528 transitions. [2019-09-08 13:16:48,564 INFO L78 Accepts]: Start accepts. Automaton has 181686 states and 280528 transitions. Word has length 257 [2019-09-08 13:16:48,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:16:48,564 INFO L475 AbstractCegarLoop]: Abstraction has 181686 states and 280528 transitions. [2019-09-08 13:16:48,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:16:48,565 INFO L276 IsEmpty]: Start isEmpty. Operand 181686 states and 280528 transitions. [2019-09-08 13:16:48,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-09-08 13:16:48,608 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:16:48,608 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:16:48,608 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:16:48,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:16:48,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1979259928, now seen corresponding path program 1 times [2019-09-08 13:16:48,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:16:48,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:16:48,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:16:48,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:16:48,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:16:48,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:16:49,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:16:49,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:16:49,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:16:49,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:16:49,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:16:49,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:16:49,566 INFO L87 Difference]: Start difference. First operand 181686 states and 280528 transitions. Second operand 4 states. [2019-09-08 13:17:01,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:17:01,857 INFO L93 Difference]: Finished difference Result 337667 states and 520476 transitions. [2019-09-08 13:17:01,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:17:01,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 259 [2019-09-08 13:17:01,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:17:02,097 INFO L225 Difference]: With dead ends: 337667 [2019-09-08 13:17:02,097 INFO L226 Difference]: Without dead ends: 160837 [2019-09-08 13:17:02,214 INFO L628 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 [2019-09-08 13:17:02,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160837 states. [2019-09-08 13:17:16,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160837 to 160415. [2019-09-08 13:17:16,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160415 states. [2019-09-08 13:17:17,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160415 states to 160415 states and 247141 transitions. [2019-09-08 13:17:17,557 INFO L78 Accepts]: Start accepts. Automaton has 160415 states and 247141 transitions. Word has length 259 [2019-09-08 13:17:17,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:17:17,557 INFO L475 AbstractCegarLoop]: Abstraction has 160415 states and 247141 transitions. [2019-09-08 13:17:17,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:17:17,557 INFO L276 IsEmpty]: Start isEmpty. Operand 160415 states and 247141 transitions. [2019-09-08 13:17:17,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-09-08 13:17:17,591 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:17:17,591 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:17:17,592 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:17:17,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:17:17,592 INFO L82 PathProgramCache]: Analyzing trace with hash 292070836, now seen corresponding path program 1 times [2019-09-08 13:17:17,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:17:17,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:17:17,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:17:17,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:17:17,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:17:17,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:17:17,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:17:17,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:17:17,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:17:17,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:17:17,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:17:17,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:17:17,737 INFO L87 Difference]: Start difference. First operand 160415 states and 247141 transitions. Second operand 3 states. [2019-09-08 13:17:42,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:17:42,722 INFO L93 Difference]: Finished difference Result 427997 states and 666691 transitions. [2019-09-08 13:17:42,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:17:42,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 260 [2019-09-08 13:17:42,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:17:43,173 INFO L225 Difference]: With dead ends: 427997 [2019-09-08 13:17:43,174 INFO L226 Difference]: Without dead ends: 279635 [2019-09-08 13:17:43,329 INFO L628 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 [2019-09-08 13:17:43,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279635 states. [2019-09-08 13:18:07,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279635 to 259537. [2019-09-08 13:18:07,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259537 states. [2019-09-08 13:18:08,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259537 states to 259537 states and 405666 transitions. [2019-09-08 13:18:08,269 INFO L78 Accepts]: Start accepts. Automaton has 259537 states and 405666 transitions. Word has length 260 [2019-09-08 13:18:08,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:18:08,269 INFO L475 AbstractCegarLoop]: Abstraction has 259537 states and 405666 transitions. [2019-09-08 13:18:08,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:18:08,269 INFO L276 IsEmpty]: Start isEmpty. Operand 259537 states and 405666 transitions. [2019-09-08 13:18:08,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-09-08 13:18:08,302 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:18:08,302 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:18:08,302 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:18:08,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:18:08,303 INFO L82 PathProgramCache]: Analyzing trace with hash -796959044, now seen corresponding path program 1 times [2019-09-08 13:18:08,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:18:08,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:18:08,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:08,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:18:08,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:08,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:18:08,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:18:08,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:18:08,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:18:08,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:18:08,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:18:08,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:18:08,726 INFO L87 Difference]: Start difference. First operand 259537 states and 405666 transitions. Second operand 4 states. [2019-09-08 13:18:52,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:18:52,162 INFO L93 Difference]: Finished difference Result 747630 states and 1169282 transitions. [2019-09-08 13:18:52,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:18:52,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 261 [2019-09-08 13:18:52,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:18:53,015 INFO L225 Difference]: With dead ends: 747630 [2019-09-08 13:18:53,015 INFO L226 Difference]: Without dead ends: 488311 [2019-09-08 13:18:53,211 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:18:53,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488311 states. [2019-09-08 13:19:47,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488311 to 488293. [2019-09-08 13:19:47,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488293 states. [2019-09-08 13:19:48,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488293 states to 488293 states and 759670 transitions. [2019-09-08 13:19:48,268 INFO L78 Accepts]: Start accepts. Automaton has 488293 states and 759670 transitions. Word has length 261 [2019-09-08 13:19:48,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:19:48,268 INFO L475 AbstractCegarLoop]: Abstraction has 488293 states and 759670 transitions. [2019-09-08 13:19:48,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:19:48,268 INFO L276 IsEmpty]: Start isEmpty. Operand 488293 states and 759670 transitions. [2019-09-08 13:19:48,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-09-08 13:19:48,350 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:19:48,350 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:19:48,350 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:19:48,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:19:48,351 INFO L82 PathProgramCache]: Analyzing trace with hash 2054588407, now seen corresponding path program 1 times [2019-09-08 13:19:48,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:19:48,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:19:48,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:19:48,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:19:48,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:19:48,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:19:48,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:19:48,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:19:48,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:19:48,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:19:48,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:19:48,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:19:48,469 INFO L87 Difference]: Start difference. First operand 488293 states and 759670 transitions. Second operand 3 states. [2019-09-08 13:21:10,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:21:10,249 INFO L93 Difference]: Finished difference Result 1279305 states and 1987332 transitions. [2019-09-08 13:21:10,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:21:10,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 262 [2019-09-08 13:21:10,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:21:11,684 INFO L225 Difference]: With dead ends: 1279305 [2019-09-08 13:21:11,684 INFO L226 Difference]: Without dead ends: 834128 [2019-09-08 13:21:12,000 INFO L628 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 [2019-09-08 13:21:12,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834128 states. [2019-09-08 13:22:10,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834128 to 489092. [2019-09-08 13:22:10,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489092 states. [2019-09-08 13:22:12,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489092 states to 489092 states and 760657 transitions. [2019-09-08 13:22:12,463 INFO L78 Accepts]: Start accepts. Automaton has 489092 states and 760657 transitions. Word has length 262 [2019-09-08 13:22:12,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:22:12,463 INFO L475 AbstractCegarLoop]: Abstraction has 489092 states and 760657 transitions. [2019-09-08 13:22:12,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:22:12,463 INFO L276 IsEmpty]: Start isEmpty. Operand 489092 states and 760657 transitions. [2019-09-08 13:22:12,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-09-08 13:22:12,535 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:22:12,535 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:22:12,535 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:22:12,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:22:12,536 INFO L82 PathProgramCache]: Analyzing trace with hash 730703686, now seen corresponding path program 1 times [2019-09-08 13:22:12,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:22:12,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:22:12,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:22:12,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:22:12,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:22:12,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:22:12,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:22:12,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:22:12,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:22:12,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:22:12,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:22:12,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:22:12,741 INFO L87 Difference]: Start difference. First operand 489092 states and 760657 transitions. Second operand 3 states. [2019-09-08 13:23:52,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:23:52,709 INFO L93 Difference]: Finished difference Result 1442644 states and 2245602 transitions. [2019-09-08 13:23:52,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:23:52,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-09-08 13:23:52,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:23:54,424 INFO L225 Difference]: With dead ends: 1442644 [2019-09-08 13:23:54,425 INFO L226 Difference]: Without dead ends: 959027 [2019-09-08 13:23:54,784 INFO L628 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 [2019-09-08 13:23:55,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959027 states. [2019-09-08 13:25:46,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959027 to 958707. [2019-09-08 13:25:46,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 958707 states.