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/systemc/transmitter.10.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 06:56:04,414 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 06:56:04,416 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 06:56:04,428 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 06:56:04,429 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 06:56:04,430 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 06:56:04,431 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 06:56:04,433 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 06:56:04,435 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 06:56:04,436 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 06:56:04,437 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 06:56:04,438 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 06:56:04,438 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 06:56:04,439 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 06:56:04,440 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 06:56:04,441 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 06:56:04,442 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 06:56:04,443 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 06:56:04,445 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 06:56:04,447 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 06:56:04,448 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 06:56:04,449 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 06:56:04,450 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 06:56:04,451 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 06:56:04,453 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 06:56:04,454 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 06:56:04,454 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 06:56:04,455 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 06:56:04,455 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 06:56:04,456 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 06:56:04,456 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 06:56:04,457 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 06:56:04,459 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 06:56:04,460 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 06:56:04,462 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 06:56:04,462 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 06:56:04,465 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 06:56:04,465 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 06:56:04,465 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 06:56:04,466 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 06:56:04,467 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 06:56:04,469 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 06:56:04,494 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 06:56:04,494 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 06:56:04,497 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 06:56:04,497 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 06:56:04,497 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 06:56:04,497 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 06:56:04,498 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 06:56:04,498 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 06:56:04,498 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 06:56:04,498 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 06:56:04,499 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 06:56:04,499 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 06:56:04,500 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 06:56:04,500 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 06:56:04,500 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 06:56:04,501 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 06:56:04,501 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 06:56:04,501 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 06:56:04,501 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 06:56:04,501 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 06:56:04,502 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 06:56:04,502 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 06:56:04,502 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 06:56:04,502 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 06:56:04,503 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 06:56:04,503 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 06:56:04,503 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 06:56:04,503 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 06:56:04,504 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 06:56:04,557 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 06:56:04,573 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 06:56:04,577 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 06:56:04,578 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 06:56:04,579 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 06:56:04,579 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.10.cil.c [2019-09-08 06:56:04,654 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9f8bd2ca/aedf88064784421f8b9d65f9a9cada00/FLAGdfa4c7f4a [2019-09-08 06:56:05,198 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 06:56:05,198 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.10.cil.c [2019-09-08 06:56:05,214 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9f8bd2ca/aedf88064784421f8b9d65f9a9cada00/FLAGdfa4c7f4a [2019-09-08 06:56:05,463 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9f8bd2ca/aedf88064784421f8b9d65f9a9cada00 [2019-09-08 06:56:05,477 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 06:56:05,481 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 06:56:05,482 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 06:56:05,482 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 06:56:05,485 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 06:56:05,486 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:56:05" (1/1) ... [2019-09-08 06:56:05,489 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19de7cc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:56:05, skipping insertion in model container [2019-09-08 06:56:05,489 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:56:05" (1/1) ... [2019-09-08 06:56:05,496 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 06:56:05,559 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 06:56:05,984 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:56:06,001 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 06:56:06,071 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:56:06,101 INFO L192 MainTranslator]: Completed translation [2019-09-08 06:56:06,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:56:06 WrapperNode [2019-09-08 06:56:06,101 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 06:56:06,102 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 06:56:06,102 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 06:56:06,102 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 06:56:06,117 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:56:06" (1/1) ... [2019-09-08 06:56:06,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:56:06" (1/1) ... [2019-09-08 06:56:06,131 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:56:06" (1/1) ... [2019-09-08 06:56:06,131 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:56:06" (1/1) ... [2019-09-08 06:56:06,151 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:56:06" (1/1) ... [2019-09-08 06:56:06,194 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:56:06" (1/1) ... [2019-09-08 06:56:06,204 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:56:06" (1/1) ... [2019-09-08 06:56:06,213 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 06:56:06,214 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 06:56:06,214 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 06:56:06,214 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 06:56:06,215 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:56:06" (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 06:56:06,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 06:56:06,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 06:56:06,266 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-09-08 06:56:06,266 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-09-08 06:56:06,266 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-09-08 06:56:06,266 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-09-08 06:56:06,266 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-09-08 06:56:06,266 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit4 [2019-09-08 06:56:06,267 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit5 [2019-09-08 06:56:06,267 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit6 [2019-09-08 06:56:06,267 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit7 [2019-09-08 06:56:06,267 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit8 [2019-09-08 06:56:06,267 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit9 [2019-09-08 06:56:06,267 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit10 [2019-09-08 06:56:06,268 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-09-08 06:56:06,268 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-09-08 06:56:06,268 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-09-08 06:56:06,268 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-09-08 06:56:06,268 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit4_triggered [2019-09-08 06:56:06,268 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit5_triggered [2019-09-08 06:56:06,269 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit6_triggered [2019-09-08 06:56:06,269 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit7_triggered [2019-09-08 06:56:06,269 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit8_triggered [2019-09-08 06:56:06,269 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit9_triggered [2019-09-08 06:56:06,269 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit10_triggered [2019-09-08 06:56:06,269 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-09-08 06:56:06,270 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-09-08 06:56:06,270 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-09-08 06:56:06,270 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-09-08 06:56:06,270 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-09-08 06:56:06,270 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-09-08 06:56:06,270 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-09-08 06:56:06,271 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-09-08 06:56:06,271 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-09-08 06:56:06,271 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-09-08 06:56:06,271 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-09-08 06:56:06,271 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-09-08 06:56:06,271 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-09-08 06:56:06,272 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 06:56:06,272 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 06:56:06,272 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 06:56:06,272 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-09-08 06:56:06,272 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-09-08 06:56:06,272 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-09-08 06:56:06,273 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-09-08 06:56:06,273 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-09-08 06:56:06,273 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit4_triggered [2019-09-08 06:56:06,273 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit5_triggered [2019-09-08 06:56:06,273 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit6_triggered [2019-09-08 06:56:06,273 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit7_triggered [2019-09-08 06:56:06,273 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit8_triggered [2019-09-08 06:56:06,273 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit9_triggered [2019-09-08 06:56:06,273 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit10_triggered [2019-09-08 06:56:06,273 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-09-08 06:56:06,274 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-09-08 06:56:06,274 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-09-08 06:56:06,274 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-09-08 06:56:06,274 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-09-08 06:56:06,274 INFO L130 BoogieDeclarations]: Found specification of procedure transmit4 [2019-09-08 06:56:06,274 INFO L130 BoogieDeclarations]: Found specification of procedure transmit5 [2019-09-08 06:56:06,274 INFO L130 BoogieDeclarations]: Found specification of procedure transmit6 [2019-09-08 06:56:06,274 INFO L130 BoogieDeclarations]: Found specification of procedure transmit7 [2019-09-08 06:56:06,274 INFO L130 BoogieDeclarations]: Found specification of procedure transmit8 [2019-09-08 06:56:06,274 INFO L130 BoogieDeclarations]: Found specification of procedure transmit9 [2019-09-08 06:56:06,275 INFO L130 BoogieDeclarations]: Found specification of procedure transmit10 [2019-09-08 06:56:06,275 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-09-08 06:56:06,275 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-09-08 06:56:06,275 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-09-08 06:56:06,275 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-09-08 06:56:06,276 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-09-08 06:56:06,276 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-09-08 06:56:06,276 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-09-08 06:56:06,276 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-09-08 06:56:06,276 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-09-08 06:56:06,276 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-09-08 06:56:06,277 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-09-08 06:56:06,277 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-09-08 06:56:06,277 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 06:56:06,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 06:56:06,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 06:56:07,428 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 06:56:07,429 INFO L283 CfgBuilder]: Removed 14 assume(true) statements. [2019-09-08 06:56:07,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:56:07 BoogieIcfgContainer [2019-09-08 06:56:07,431 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 06:56:07,432 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 06:56:07,432 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 06:56:07,435 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 06:56:07,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 06:56:05" (1/3) ... [2019-09-08 06:56:07,437 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@672fb717 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:56:07, skipping insertion in model container [2019-09-08 06:56:07,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:56:06" (2/3) ... [2019-09-08 06:56:07,437 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@672fb717 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:56:07, skipping insertion in model container [2019-09-08 06:56:07,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:56:07" (3/3) ... [2019-09-08 06:56:07,440 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.10.cil.c [2019-09-08 06:56:07,450 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 06:56:07,460 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 06:56:07,477 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 06:56:07,532 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 06:56:07,533 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 06:56:07,533 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 06:56:07,533 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 06:56:07,534 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 06:56:07,534 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 06:56:07,534 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 06:56:07,534 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 06:56:07,534 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 06:56:07,563 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states. [2019-09-08 06:56:07,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-08 06:56:07,588 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:56:07,590 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] [2019-09-08 06:56:07,592 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:56:07,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:56:07,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1517839845, now seen corresponding path program 1 times [2019-09-08 06:56:07,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:56:07,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:56:07,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:07,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:56:07,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:07,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:56:08,106 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 06:56:08,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:56:08,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:56:08,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:56:08,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:56:08,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:56:08,137 INFO L87 Difference]: Start difference. First operand 409 states. Second operand 4 states. [2019-09-08 06:56:08,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:56:08,587 INFO L93 Difference]: Finished difference Result 800 states and 1230 transitions. [2019-09-08 06:56:08,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:56:08,589 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 210 [2019-09-08 06:56:08,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:56:08,608 INFO L225 Difference]: With dead ends: 800 [2019-09-08 06:56:08,609 INFO L226 Difference]: Without dead ends: 400 [2019-09-08 06:56:08,618 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:56:08,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2019-09-08 06:56:08,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2019-09-08 06:56:08,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-08 06:56:08,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 580 transitions. [2019-09-08 06:56:08,809 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 580 transitions. Word has length 210 [2019-09-08 06:56:08,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:56:08,813 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 580 transitions. [2019-09-08 06:56:08,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:56:08,817 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 580 transitions. [2019-09-08 06:56:08,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-08 06:56:08,834 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:56:08,842 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] [2019-09-08 06:56:08,844 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:56:08,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:56:08,845 INFO L82 PathProgramCache]: Analyzing trace with hash -696543773, now seen corresponding path program 1 times [2019-09-08 06:56:08,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:56:08,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:56:08,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:08,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:56:08,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:08,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:56:09,100 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 06:56:09,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:56:09,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:56:09,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:56:09,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:56:09,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:56:09,112 INFO L87 Difference]: Start difference. First operand 400 states and 580 transitions. Second operand 4 states. [2019-09-08 06:56:09,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:56:09,388 INFO L93 Difference]: Finished difference Result 776 states and 1126 transitions. [2019-09-08 06:56:09,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:56:09,388 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 210 [2019-09-08 06:56:09,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:56:09,393 INFO L225 Difference]: With dead ends: 776 [2019-09-08 06:56:09,393 INFO L226 Difference]: Without dead ends: 400 [2019-09-08 06:56:09,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:56:09,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2019-09-08 06:56:09,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2019-09-08 06:56:09,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-08 06:56:09,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 579 transitions. [2019-09-08 06:56:09,424 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 579 transitions. Word has length 210 [2019-09-08 06:56:09,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:56:09,425 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 579 transitions. [2019-09-08 06:56:09,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:56:09,425 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 579 transitions. [2019-09-08 06:56:09,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-08 06:56:09,429 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:56:09,429 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] [2019-09-08 06:56:09,429 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:56:09,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:56:09,430 INFO L82 PathProgramCache]: Analyzing trace with hash -688544799, now seen corresponding path program 1 times [2019-09-08 06:56:09,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:56:09,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:56:09,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:09,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:56:09,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:09,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:56:09,666 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 06:56:09,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:56:09,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:56:09,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:56:09,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:56:09,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:56:09,668 INFO L87 Difference]: Start difference. First operand 400 states and 579 transitions. Second operand 5 states. [2019-09-08 06:56:10,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:56:10,615 INFO L93 Difference]: Finished difference Result 832 states and 1233 transitions. [2019-09-08 06:56:10,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:56:10,616 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-09-08 06:56:10,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:56:10,622 INFO L225 Difference]: With dead ends: 832 [2019-09-08 06:56:10,622 INFO L226 Difference]: Without dead ends: 460 [2019-09-08 06:56:10,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:56:10,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-09-08 06:56:10,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 400. [2019-09-08 06:56:10,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-08 06:56:10,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 578 transitions. [2019-09-08 06:56:10,660 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 578 transitions. Word has length 210 [2019-09-08 06:56:10,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:56:10,661 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 578 transitions. [2019-09-08 06:56:10,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:56:10,661 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 578 transitions. [2019-09-08 06:56:10,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-08 06:56:10,667 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:56:10,668 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] [2019-09-08 06:56:10,668 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:56:10,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:56:10,669 INFO L82 PathProgramCache]: Analyzing trace with hash -216205153, now seen corresponding path program 1 times [2019-09-08 06:56:10,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:56:10,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:56:10,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:10,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:56:10,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:10,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:56:10,851 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 06:56:10,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:56:10,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:56:10,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:56:10,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:56:10,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:56:10,854 INFO L87 Difference]: Start difference. First operand 400 states and 578 transitions. Second operand 5 states. [2019-09-08 06:56:11,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:56:11,770 INFO L93 Difference]: Finished difference Result 832 states and 1232 transitions. [2019-09-08 06:56:11,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:56:11,771 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-09-08 06:56:11,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:56:11,775 INFO L225 Difference]: With dead ends: 832 [2019-09-08 06:56:11,776 INFO L226 Difference]: Without dead ends: 460 [2019-09-08 06:56:11,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:56:11,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-09-08 06:56:11,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 400. [2019-09-08 06:56:11,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-08 06:56:11,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 577 transitions. [2019-09-08 06:56:11,815 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 577 transitions. Word has length 210 [2019-09-08 06:56:11,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:56:11,816 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 577 transitions. [2019-09-08 06:56:11,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:56:11,816 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 577 transitions. [2019-09-08 06:56:11,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-08 06:56:11,820 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:56:11,820 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] [2019-09-08 06:56:11,821 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:56:11,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:56:11,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1032252383, now seen corresponding path program 1 times [2019-09-08 06:56:11,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:56:11,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:56:11,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:11,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:56:11,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:11,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:56:11,984 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 06:56:11,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:56:11,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:56:11,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:56:11,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:56:11,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:56:11,991 INFO L87 Difference]: Start difference. First operand 400 states and 577 transitions. Second operand 5 states. [2019-09-08 06:56:12,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:56:12,866 INFO L93 Difference]: Finished difference Result 830 states and 1226 transitions. [2019-09-08 06:56:12,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:56:12,867 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-09-08 06:56:12,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:56:12,874 INFO L225 Difference]: With dead ends: 830 [2019-09-08 06:56:12,874 INFO L226 Difference]: Without dead ends: 458 [2019-09-08 06:56:12,877 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:56:12,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-09-08 06:56:12,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 400. [2019-09-08 06:56:12,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-08 06:56:12,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 576 transitions. [2019-09-08 06:56:12,920 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 576 transitions. Word has length 210 [2019-09-08 06:56:12,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:56:12,921 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 576 transitions. [2019-09-08 06:56:12,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:56:12,921 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 576 transitions. [2019-09-08 06:56:12,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-08 06:56:12,926 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:56:12,926 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] [2019-09-08 06:56:12,927 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:56:12,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:56:12,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1296728159, now seen corresponding path program 1 times [2019-09-08 06:56:12,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:56:12,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:56:12,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:12,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:56:12,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:12,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:56:13,127 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 06:56:13,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:56:13,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:56:13,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:56:13,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:56:13,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:56:13,130 INFO L87 Difference]: Start difference. First operand 400 states and 576 transitions. Second operand 5 states. [2019-09-08 06:56:14,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:56:14,071 INFO L93 Difference]: Finished difference Result 828 states and 1220 transitions. [2019-09-08 06:56:14,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:56:14,071 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-09-08 06:56:14,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:56:14,076 INFO L225 Difference]: With dead ends: 828 [2019-09-08 06:56:14,076 INFO L226 Difference]: Without dead ends: 456 [2019-09-08 06:56:14,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:56:14,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-09-08 06:56:14,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 400. [2019-09-08 06:56:14,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-08 06:56:14,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 575 transitions. [2019-09-08 06:56:14,114 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 575 transitions. Word has length 210 [2019-09-08 06:56:14,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:56:14,115 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 575 transitions. [2019-09-08 06:56:14,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:56:14,115 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 575 transitions. [2019-09-08 06:56:14,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-08 06:56:14,118 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:56:14,119 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] [2019-09-08 06:56:14,119 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:56:14,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:56:14,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1399090079, now seen corresponding path program 1 times [2019-09-08 06:56:14,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:56:14,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:56:14,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:14,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:56:14,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:14,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:56:14,262 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 06:56:14,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:56:14,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:56:14,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:56:14,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:56:14,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:56:14,266 INFO L87 Difference]: Start difference. First operand 400 states and 575 transitions. Second operand 5 states. [2019-09-08 06:56:15,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:56:15,169 INFO L93 Difference]: Finished difference Result 826 states and 1214 transitions. [2019-09-08 06:56:15,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:56:15,170 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-09-08 06:56:15,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:56:15,173 INFO L225 Difference]: With dead ends: 826 [2019-09-08 06:56:15,174 INFO L226 Difference]: Without dead ends: 454 [2019-09-08 06:56:15,175 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:56:15,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-09-08 06:56:15,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 400. [2019-09-08 06:56:15,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-08 06:56:15,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 574 transitions. [2019-09-08 06:56:15,207 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 574 transitions. Word has length 210 [2019-09-08 06:56:15,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:56:15,208 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 574 transitions. [2019-09-08 06:56:15,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:56:15,208 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 574 transitions. [2019-09-08 06:56:15,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-08 06:56:15,211 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:56:15,211 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] [2019-09-08 06:56:15,212 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:56:15,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:56:15,212 INFO L82 PathProgramCache]: Analyzing trace with hash -793315297, now seen corresponding path program 1 times [2019-09-08 06:56:15,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:56:15,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:56:15,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:15,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:56:15,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:15,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:56:15,318 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 06:56:15,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:56:15,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:56:15,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:56:15,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:56:15,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:56:15,320 INFO L87 Difference]: Start difference. First operand 400 states and 574 transitions. Second operand 5 states. [2019-09-08 06:56:16,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:56:16,127 INFO L93 Difference]: Finished difference Result 824 states and 1208 transitions. [2019-09-08 06:56:16,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:56:16,128 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-09-08 06:56:16,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:56:16,132 INFO L225 Difference]: With dead ends: 824 [2019-09-08 06:56:16,132 INFO L226 Difference]: Without dead ends: 452 [2019-09-08 06:56:16,135 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:56:16,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-09-08 06:56:16,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 400. [2019-09-08 06:56:16,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-08 06:56:16,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 573 transitions. [2019-09-08 06:56:16,170 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 573 transitions. Word has length 210 [2019-09-08 06:56:16,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:56:16,172 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 573 transitions. [2019-09-08 06:56:16,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:56:16,173 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 573 transitions. [2019-09-08 06:56:16,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-08 06:56:16,176 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:56:16,176 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] [2019-09-08 06:56:16,177 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:56:16,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:56:16,177 INFO L82 PathProgramCache]: Analyzing trace with hash -773774175, now seen corresponding path program 1 times [2019-09-08 06:56:16,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:56:16,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:56:16,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:16,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:56:16,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:16,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:56:16,346 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 06:56:16,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:56:16,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:56:16,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:56:16,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:56:16,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:56:16,348 INFO L87 Difference]: Start difference. First operand 400 states and 573 transitions. Second operand 5 states. [2019-09-08 06:56:17,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:56:17,171 INFO L93 Difference]: Finished difference Result 820 states and 1198 transitions. [2019-09-08 06:56:17,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:56:17,172 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-09-08 06:56:17,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:56:17,176 INFO L225 Difference]: With dead ends: 820 [2019-09-08 06:56:17,176 INFO L226 Difference]: Without dead ends: 448 [2019-09-08 06:56:17,178 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:56:17,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2019-09-08 06:56:17,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 400. [2019-09-08 06:56:17,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-08 06:56:17,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 572 transitions. [2019-09-08 06:56:17,205 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 572 transitions. Word has length 210 [2019-09-08 06:56:17,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:56:17,206 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 572 transitions. [2019-09-08 06:56:17,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:56:17,206 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 572 transitions. [2019-09-08 06:56:17,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-08 06:56:17,210 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:56:17,210 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] [2019-09-08 06:56:17,210 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:56:17,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:56:17,211 INFO L82 PathProgramCache]: Analyzing trace with hash -246380125, now seen corresponding path program 1 times [2019-09-08 06:56:17,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:56:17,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:56:17,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:17,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:56:17,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:17,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:56:17,308 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 06:56:17,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:56:17,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:56:17,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:56:17,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:56:17,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:56:17,310 INFO L87 Difference]: Start difference. First operand 400 states and 572 transitions. Second operand 5 states. [2019-09-08 06:56:18,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:56:18,196 INFO L93 Difference]: Finished difference Result 818 states and 1192 transitions. [2019-09-08 06:56:18,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:56:18,197 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-09-08 06:56:18,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:56:18,200 INFO L225 Difference]: With dead ends: 818 [2019-09-08 06:56:18,200 INFO L226 Difference]: Without dead ends: 446 [2019-09-08 06:56:18,202 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:56:18,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2019-09-08 06:56:18,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 400. [2019-09-08 06:56:18,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-08 06:56:18,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 571 transitions. [2019-09-08 06:56:18,229 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 571 transitions. Word has length 210 [2019-09-08 06:56:18,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:56:18,230 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 571 transitions. [2019-09-08 06:56:18,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:56:18,230 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 571 transitions. [2019-09-08 06:56:18,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-08 06:56:18,233 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:56:18,233 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] [2019-09-08 06:56:18,234 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:56:18,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:56:18,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1614840735, now seen corresponding path program 1 times [2019-09-08 06:56:18,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:56:18,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:56:18,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:18,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:56:18,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:18,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:56:18,329 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 06:56:18,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:56:18,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:56:18,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:56:18,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:56:18,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:56:18,331 INFO L87 Difference]: Start difference. First operand 400 states and 571 transitions. Second operand 5 states. [2019-09-08 06:56:19,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:56:19,138 INFO L93 Difference]: Finished difference Result 816 states and 1186 transitions. [2019-09-08 06:56:19,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:56:19,139 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-09-08 06:56:19,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:56:19,142 INFO L225 Difference]: With dead ends: 816 [2019-09-08 06:56:19,143 INFO L226 Difference]: Without dead ends: 444 [2019-09-08 06:56:19,145 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:56:19,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2019-09-08 06:56:19,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 400. [2019-09-08 06:56:19,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-08 06:56:19,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 570 transitions. [2019-09-08 06:56:19,177 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 570 transitions. Word has length 210 [2019-09-08 06:56:19,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:56:19,178 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 570 transitions. [2019-09-08 06:56:19,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:56:19,178 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 570 transitions. [2019-09-08 06:56:19,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-08 06:56:19,180 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:56:19,180 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] [2019-09-08 06:56:19,180 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:56:19,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:56:19,181 INFO L82 PathProgramCache]: Analyzing trace with hash -966247965, now seen corresponding path program 1 times [2019-09-08 06:56:19,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:56:19,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:56:19,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:19,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:56:19,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:19,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:56:19,278 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 06:56:19,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:56:19,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:56:19,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:56:19,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:56:19,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:56:19,281 INFO L87 Difference]: Start difference. First operand 400 states and 570 transitions. Second operand 5 states. [2019-09-08 06:56:20,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:56:20,237 INFO L93 Difference]: Finished difference Result 814 states and 1180 transitions. [2019-09-08 06:56:20,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:56:20,238 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-09-08 06:56:20,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:56:20,241 INFO L225 Difference]: With dead ends: 814 [2019-09-08 06:56:20,241 INFO L226 Difference]: Without dead ends: 442 [2019-09-08 06:56:20,244 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:56:20,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2019-09-08 06:56:20,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 400. [2019-09-08 06:56:20,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-08 06:56:20,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 569 transitions. [2019-09-08 06:56:20,282 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 569 transitions. Word has length 210 [2019-09-08 06:56:20,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:56:20,284 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 569 transitions. [2019-09-08 06:56:20,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:56:20,284 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 569 transitions. [2019-09-08 06:56:20,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-08 06:56:20,286 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:56:20,286 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] [2019-09-08 06:56:20,286 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:56:20,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:56:20,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1825621025, now seen corresponding path program 1 times [2019-09-08 06:56:20,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:56:20,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:56:20,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:20,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:56:20,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:20,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:56:20,387 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 06:56:20,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:56:20,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:56:20,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:56:20,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:56:20,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:56:20,389 INFO L87 Difference]: Start difference. First operand 400 states and 569 transitions. Second operand 5 states. [2019-09-08 06:56:21,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:56:21,168 INFO L93 Difference]: Finished difference Result 855 states and 1254 transitions. [2019-09-08 06:56:21,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:56:21,169 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-09-08 06:56:21,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:56:21,173 INFO L225 Difference]: With dead ends: 855 [2019-09-08 06:56:21,173 INFO L226 Difference]: Without dead ends: 483 [2019-09-08 06:56:21,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:56:21,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-09-08 06:56:21,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 400. [2019-09-08 06:56:21,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-08 06:56:21,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 568 transitions. [2019-09-08 06:56:21,228 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 568 transitions. Word has length 210 [2019-09-08 06:56:21,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:56:21,229 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 568 transitions. [2019-09-08 06:56:21,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:56:21,229 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 568 transitions. [2019-09-08 06:56:21,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-08 06:56:21,234 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:56:21,234 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] [2019-09-08 06:56:21,234 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:56:21,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:56:21,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1915681315, now seen corresponding path program 1 times [2019-09-08 06:56:21,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:56:21,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:56:21,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:21,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:56:21,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:21,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:56:21,412 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 06:56:21,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:56:21,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:56:21,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:56:21,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:56:21,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:56:21,416 INFO L87 Difference]: Start difference. First operand 400 states and 568 transitions. Second operand 5 states. [2019-09-08 06:56:22,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:56:22,279 INFO L93 Difference]: Finished difference Result 853 states and 1248 transitions. [2019-09-08 06:56:22,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:56:22,280 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-09-08 06:56:22,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:56:22,284 INFO L225 Difference]: With dead ends: 853 [2019-09-08 06:56:22,284 INFO L226 Difference]: Without dead ends: 481 [2019-09-08 06:56:22,288 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:56:22,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2019-09-08 06:56:22,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 400. [2019-09-08 06:56:22,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-08 06:56:22,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 567 transitions. [2019-09-08 06:56:22,330 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 567 transitions. Word has length 210 [2019-09-08 06:56:22,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:56:22,330 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 567 transitions. [2019-09-08 06:56:22,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:56:22,331 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 567 transitions. [2019-09-08 06:56:22,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-08 06:56:22,332 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:56:22,332 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] [2019-09-08 06:56:22,333 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:56:22,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:56:22,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1225849825, now seen corresponding path program 1 times [2019-09-08 06:56:22,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:56:22,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:56:22,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:22,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:56:22,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:22,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:56:22,436 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 06:56:22,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:56:22,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:56:22,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:56:22,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:56:22,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:56:22,439 INFO L87 Difference]: Start difference. First operand 400 states and 567 transitions. Second operand 5 states. [2019-09-08 06:56:23,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:56:23,166 INFO L93 Difference]: Finished difference Result 851 states and 1242 transitions. [2019-09-08 06:56:23,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:56:23,167 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-09-08 06:56:23,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:56:23,171 INFO L225 Difference]: With dead ends: 851 [2019-09-08 06:56:23,171 INFO L226 Difference]: Without dead ends: 479 [2019-09-08 06:56:23,173 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:56:23,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-09-08 06:56:23,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 400. [2019-09-08 06:56:23,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-08 06:56:23,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 566 transitions. [2019-09-08 06:56:23,210 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 566 transitions. Word has length 210 [2019-09-08 06:56:23,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:56:23,211 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 566 transitions. [2019-09-08 06:56:23,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:56:23,211 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 566 transitions. [2019-09-08 06:56:23,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-08 06:56:23,213 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:56:23,213 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] [2019-09-08 06:56:23,213 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:56:23,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:56:23,214 INFO L82 PathProgramCache]: Analyzing trace with hash -181876125, now seen corresponding path program 1 times [2019-09-08 06:56:23,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:56:23,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:56:23,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:23,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:56:23,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:23,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:56:23,323 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 06:56:23,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:56:23,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:56:23,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:56:23,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:56:23,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:56:23,325 INFO L87 Difference]: Start difference. First operand 400 states and 566 transitions. Second operand 5 states. [2019-09-08 06:56:24,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:56:24,135 INFO L93 Difference]: Finished difference Result 847 states and 1232 transitions. [2019-09-08 06:56:24,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:56:24,135 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-09-08 06:56:24,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:56:24,139 INFO L225 Difference]: With dead ends: 847 [2019-09-08 06:56:24,139 INFO L226 Difference]: Without dead ends: 475 [2019-09-08 06:56:24,142 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:56:24,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2019-09-08 06:56:24,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 400. [2019-09-08 06:56:24,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-08 06:56:24,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 565 transitions. [2019-09-08 06:56:24,188 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 565 transitions. Word has length 210 [2019-09-08 06:56:24,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:56:24,188 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 565 transitions. [2019-09-08 06:56:24,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:56:24,188 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 565 transitions. [2019-09-08 06:56:24,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-08 06:56:24,190 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:56:24,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] [2019-09-08 06:56:24,191 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:56:24,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:56:24,191 INFO L82 PathProgramCache]: Analyzing trace with hash -2105126555, now seen corresponding path program 1 times [2019-09-08 06:56:24,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:56:24,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:56:24,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:24,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:56:24,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:24,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:56:24,294 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 06:56:24,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:56:24,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:56:24,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:56:24,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:56:24,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:56:24,296 INFO L87 Difference]: Start difference. First operand 400 states and 565 transitions. Second operand 5 states. [2019-09-08 06:56:25,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:56:25,120 INFO L93 Difference]: Finished difference Result 845 states and 1226 transitions. [2019-09-08 06:56:25,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:56:25,121 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-09-08 06:56:25,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:56:25,125 INFO L225 Difference]: With dead ends: 845 [2019-09-08 06:56:25,125 INFO L226 Difference]: Without dead ends: 473 [2019-09-08 06:56:25,127 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:56:25,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-09-08 06:56:25,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 400. [2019-09-08 06:56:25,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-08 06:56:25,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 564 transitions. [2019-09-08 06:56:25,165 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 564 transitions. Word has length 210 [2019-09-08 06:56:25,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:56:25,166 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 564 transitions. [2019-09-08 06:56:25,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:56:25,166 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 564 transitions. [2019-09-08 06:56:25,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-08 06:56:25,168 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:56:25,168 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] [2019-09-08 06:56:25,168 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:56:25,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:56:25,169 INFO L82 PathProgramCache]: Analyzing trace with hash 465232419, now seen corresponding path program 1 times [2019-09-08 06:56:25,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:56:25,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:56:25,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:25,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:56:25,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:25,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:56:25,277 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 06:56:25,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:56:25,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:56:25,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:56:25,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:56:25,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:56:25,279 INFO L87 Difference]: Start difference. First operand 400 states and 564 transitions. Second operand 5 states. [2019-09-08 06:56:26,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:56:26,274 INFO L93 Difference]: Finished difference Result 843 states and 1220 transitions. [2019-09-08 06:56:26,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:56:26,275 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-09-08 06:56:26,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:56:26,280 INFO L225 Difference]: With dead ends: 843 [2019-09-08 06:56:26,280 INFO L226 Difference]: Without dead ends: 471 [2019-09-08 06:56:26,282 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:56:26,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-09-08 06:56:26,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 400. [2019-09-08 06:56:26,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-08 06:56:26,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 563 transitions. [2019-09-08 06:56:26,347 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 563 transitions. Word has length 210 [2019-09-08 06:56:26,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:56:26,347 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 563 transitions. [2019-09-08 06:56:26,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:56:26,348 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 563 transitions. [2019-09-08 06:56:26,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-08 06:56:26,351 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:56:26,352 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] [2019-09-08 06:56:26,352 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:56:26,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:56:26,353 INFO L82 PathProgramCache]: Analyzing trace with hash 963789221, now seen corresponding path program 1 times [2019-09-08 06:56:26,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:56:26,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:56:26,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:26,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:56:26,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:56:26,475 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 06:56:26,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:56:26,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:56:26,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:56:26,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:56:26,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:56:26,478 INFO L87 Difference]: Start difference. First operand 400 states and 563 transitions. Second operand 5 states. [2019-09-08 06:56:27,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:56:27,532 INFO L93 Difference]: Finished difference Result 841 states and 1214 transitions. [2019-09-08 06:56:27,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:56:27,533 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-09-08 06:56:27,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:56:27,537 INFO L225 Difference]: With dead ends: 841 [2019-09-08 06:56:27,537 INFO L226 Difference]: Without dead ends: 469 [2019-09-08 06:56:27,541 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:56:27,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2019-09-08 06:56:27,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 400. [2019-09-08 06:56:27,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-08 06:56:27,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 562 transitions. [2019-09-08 06:56:27,620 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 562 transitions. Word has length 210 [2019-09-08 06:56:27,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:56:27,621 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 562 transitions. [2019-09-08 06:56:27,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:56:27,621 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 562 transitions. [2019-09-08 06:56:27,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-08 06:56:27,624 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:56:27,624 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] [2019-09-08 06:56:27,625 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:56:27,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:56:27,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1534061027, now seen corresponding path program 1 times [2019-09-08 06:56:27,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:56:27,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:56:27,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:27,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:56:27,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:27,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:56:27,781 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 06:56:27,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:56:27,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:56:27,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:56:27,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:56:27,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:56:27,783 INFO L87 Difference]: Start difference. First operand 400 states and 562 transitions. Second operand 5 states. [2019-09-08 06:56:28,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:56:28,889 INFO L93 Difference]: Finished difference Result 839 states and 1208 transitions. [2019-09-08 06:56:28,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:56:28,889 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-09-08 06:56:28,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:56:28,894 INFO L225 Difference]: With dead ends: 839 [2019-09-08 06:56:28,894 INFO L226 Difference]: Without dead ends: 467 [2019-09-08 06:56:28,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:56:28,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2019-09-08 06:56:28,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 400. [2019-09-08 06:56:28,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-08 06:56:28,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 561 transitions. [2019-09-08 06:56:28,973 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 561 transitions. Word has length 210 [2019-09-08 06:56:28,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:56:28,974 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 561 transitions. [2019-09-08 06:56:28,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:56:28,974 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 561 transitions. [2019-09-08 06:56:28,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-08 06:56:28,976 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:56:28,977 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] [2019-09-08 06:56:28,977 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:56:28,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:56:28,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1357037083, now seen corresponding path program 1 times [2019-09-08 06:56:28,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:56:28,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:56:28,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:28,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:56:28,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:29,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:56:29,099 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 06:56:29,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:56:29,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:56:29,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:56:29,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:56:29,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:56:29,101 INFO L87 Difference]: Start difference. First operand 400 states and 561 transitions. Second operand 5 states. [2019-09-08 06:56:29,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:56:29,932 INFO L93 Difference]: Finished difference Result 837 states and 1202 transitions. [2019-09-08 06:56:29,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:56:29,932 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-09-08 06:56:29,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:56:29,938 INFO L225 Difference]: With dead ends: 837 [2019-09-08 06:56:29,939 INFO L226 Difference]: Without dead ends: 465 [2019-09-08 06:56:29,940 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:56:29,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-09-08 06:56:29,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 400. [2019-09-08 06:56:29,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-08 06:56:29,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 560 transitions. [2019-09-08 06:56:29,986 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 560 transitions. Word has length 210 [2019-09-08 06:56:29,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:56:29,987 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 560 transitions. [2019-09-08 06:56:29,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:56:29,987 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 560 transitions. [2019-09-08 06:56:29,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-08 06:56:29,991 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:56:29,991 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] [2019-09-08 06:56:29,992 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:56:29,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:56:29,992 INFO L82 PathProgramCache]: Analyzing trace with hash -2143034973, now seen corresponding path program 1 times [2019-09-08 06:56:29,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:56:29,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:56:29,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:29,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:56:29,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:30,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:56:30,113 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 06:56:30,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:56:30,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:56:30,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:56:30,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:56:30,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:56:30,116 INFO L87 Difference]: Start difference. First operand 400 states and 560 transitions. Second operand 6 states. [2019-09-08 06:56:30,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:56:30,276 INFO L93 Difference]: Finished difference Result 808 states and 1165 transitions. [2019-09-08 06:56:30,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:56:30,277 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 210 [2019-09-08 06:56:30,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:56:30,281 INFO L225 Difference]: With dead ends: 808 [2019-09-08 06:56:30,281 INFO L226 Difference]: Without dead ends: 437 [2019-09-08 06:56:30,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:56:30,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2019-09-08 06:56:30,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 405. [2019-09-08 06:56:30,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-09-08 06:56:30,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 565 transitions. [2019-09-08 06:56:30,365 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 565 transitions. Word has length 210 [2019-09-08 06:56:30,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:56:30,365 INFO L475 AbstractCegarLoop]: Abstraction has 405 states and 565 transitions. [2019-09-08 06:56:30,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:56:30,366 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 565 transitions. [2019-09-08 06:56:30,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-08 06:56:30,369 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:56:30,369 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] [2019-09-08 06:56:30,369 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:56:30,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:56:30,370 INFO L82 PathProgramCache]: Analyzing trace with hash -211909339, now seen corresponding path program 1 times [2019-09-08 06:56:30,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:56:30,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:56:30,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:30,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:56:30,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:30,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:56:30,577 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 06:56:30,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:56:30,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:56:30,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:56:30,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:56:30,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:56:30,580 INFO L87 Difference]: Start difference. First operand 405 states and 565 transitions. Second operand 6 states. [2019-09-08 06:56:30,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:56:30,701 INFO L93 Difference]: Finished difference Result 815 states and 1170 transitions. [2019-09-08 06:56:30,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:56:30,702 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 210 [2019-09-08 06:56:30,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:56:30,706 INFO L225 Difference]: With dead ends: 815 [2019-09-08 06:56:30,706 INFO L226 Difference]: Without dead ends: 439 [2019-09-08 06:56:30,710 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:56:30,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2019-09-08 06:56:30,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 410. [2019-09-08 06:56:30,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-08 06:56:30,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 570 transitions. [2019-09-08 06:56:30,790 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 570 transitions. Word has length 210 [2019-09-08 06:56:30,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:56:30,791 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 570 transitions. [2019-09-08 06:56:30,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:56:30,791 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 570 transitions. [2019-09-08 06:56:30,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-08 06:56:30,794 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:56:30,795 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] [2019-09-08 06:56:30,795 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:56:30,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:56:30,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1947174755, now seen corresponding path program 1 times [2019-09-08 06:56:30,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:56:30,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:56:30,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:30,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:56:30,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:30,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:56:30,945 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 06:56:30,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:56:30,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:56:30,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:56:30,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:56:30,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:56:30,951 INFO L87 Difference]: Start difference. First operand 410 states and 570 transitions. Second operand 6 states. [2019-09-08 06:56:31,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:56:31,073 INFO L93 Difference]: Finished difference Result 822 states and 1175 transitions. [2019-09-08 06:56:31,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:56:31,073 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 210 [2019-09-08 06:56:31,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:56:31,077 INFO L225 Difference]: With dead ends: 822 [2019-09-08 06:56:31,078 INFO L226 Difference]: Without dead ends: 441 [2019-09-08 06:56:31,087 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:56:31,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2019-09-08 06:56:31,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 415. [2019-09-08 06:56:31,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2019-09-08 06:56:31,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 575 transitions. [2019-09-08 06:56:31,166 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 575 transitions. Word has length 210 [2019-09-08 06:56:31,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:56:31,167 INFO L475 AbstractCegarLoop]: Abstraction has 415 states and 575 transitions. [2019-09-08 06:56:31,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:56:31,167 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 575 transitions. [2019-09-08 06:56:31,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-08 06:56:31,170 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:56:31,171 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] [2019-09-08 06:56:31,171 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:56:31,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:56:31,172 INFO L82 PathProgramCache]: Analyzing trace with hash 999122789, now seen corresponding path program 1 times [2019-09-08 06:56:31,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:56:31,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:56:31,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:31,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:56:31,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:56:31,303 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 06:56:31,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:56:31,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:56:31,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:56:31,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:56:31,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:56:31,305 INFO L87 Difference]: Start difference. First operand 415 states and 575 transitions. Second operand 6 states. [2019-09-08 06:56:31,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:56:31,423 INFO L93 Difference]: Finished difference Result 829 states and 1180 transitions. [2019-09-08 06:56:31,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:56:31,423 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 210 [2019-09-08 06:56:31,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:56:31,431 INFO L225 Difference]: With dead ends: 829 [2019-09-08 06:56:31,431 INFO L226 Difference]: Without dead ends: 443 [2019-09-08 06:56:31,434 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:56:31,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-09-08 06:56:31,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 420. [2019-09-08 06:56:31,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2019-09-08 06:56:31,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 580 transitions. [2019-09-08 06:56:31,511 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 580 transitions. Word has length 210 [2019-09-08 06:56:31,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:56:31,511 INFO L475 AbstractCegarLoop]: Abstraction has 420 states and 580 transitions. [2019-09-08 06:56:31,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:56:31,512 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 580 transitions. [2019-09-08 06:56:31,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-08 06:56:31,515 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:56:31,515 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] [2019-09-08 06:56:31,516 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:56:31,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:56:31,517 INFO L82 PathProgramCache]: Analyzing trace with hash -93512413, now seen corresponding path program 1 times [2019-09-08 06:56:31,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:56:31,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:56:31,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:31,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:56:31,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:31,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:56:31,661 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 06:56:31,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:56:31,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:56:31,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:56:31,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:56:31,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:56:31,666 INFO L87 Difference]: Start difference. First operand 420 states and 580 transitions. Second operand 6 states. [2019-09-08 06:56:31,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:56:31,785 INFO L93 Difference]: Finished difference Result 836 states and 1185 transitions. [2019-09-08 06:56:31,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:56:31,785 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 210 [2019-09-08 06:56:31,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:56:31,790 INFO L225 Difference]: With dead ends: 836 [2019-09-08 06:56:31,790 INFO L226 Difference]: Without dead ends: 445 [2019-09-08 06:56:31,793 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:56:31,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2019-09-08 06:56:31,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 425. [2019-09-08 06:56:31,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-09-08 06:56:31,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 585 transitions. [2019-09-08 06:56:31,872 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 585 transitions. Word has length 210 [2019-09-08 06:56:31,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:56:31,872 INFO L475 AbstractCegarLoop]: Abstraction has 425 states and 585 transitions. [2019-09-08 06:56:31,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:56:31,873 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 585 transitions. [2019-09-08 06:56:31,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-08 06:56:31,875 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:56:31,876 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] [2019-09-08 06:56:31,876 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:56:31,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:56:31,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1740875355, now seen corresponding path program 1 times [2019-09-08 06:56:31,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:56:31,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:56:31,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:31,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:56:31,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:31,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:56:32,047 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 06:56:32,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:56:32,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:56:32,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:56:32,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:56:32,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:56:32,050 INFO L87 Difference]: Start difference. First operand 425 states and 585 transitions. Second operand 4 states. [2019-09-08 06:56:32,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:56:32,622 INFO L93 Difference]: Finished difference Result 1210 states and 1715 transitions. [2019-09-08 06:56:32,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:56:32,622 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 210 [2019-09-08 06:56:32,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:56:32,631 INFO L225 Difference]: With dead ends: 1210 [2019-09-08 06:56:32,631 INFO L226 Difference]: Without dead ends: 814 [2019-09-08 06:56:32,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:56:32,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2019-09-08 06:56:32,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 809. [2019-09-08 06:56:32,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 809 states. [2019-09-08 06:56:32,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1112 transitions. [2019-09-08 06:56:32,754 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1112 transitions. Word has length 210 [2019-09-08 06:56:32,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:56:32,754 INFO L475 AbstractCegarLoop]: Abstraction has 809 states and 1112 transitions. [2019-09-08 06:56:32,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:56:32,755 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1112 transitions. [2019-09-08 06:56:32,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-08 06:56:32,756 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:56:32,757 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] [2019-09-08 06:56:32,757 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:56:32,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:56:32,757 INFO L82 PathProgramCache]: Analyzing trace with hash 2107333572, now seen corresponding path program 1 times [2019-09-08 06:56:32,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:56:32,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:56:32,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:32,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:56:32,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:32,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:56:32,846 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 06:56:32,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:56:32,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:56:32,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:56:32,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:56:32,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:56:32,848 INFO L87 Difference]: Start difference. First operand 809 states and 1112 transitions. Second operand 6 states. [2019-09-08 06:56:32,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:56:32,968 INFO L93 Difference]: Finished difference Result 1611 states and 2266 transitions. [2019-09-08 06:56:32,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:56:32,968 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 210 [2019-09-08 06:56:32,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:56:32,975 INFO L225 Difference]: With dead ends: 1611 [2019-09-08 06:56:32,976 INFO L226 Difference]: Without dead ends: 831 [2019-09-08 06:56:32,979 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:56:32,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2019-09-08 06:56:33,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 814. [2019-09-08 06:56:33,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 814 states. [2019-09-08 06:56:33,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1116 transitions. [2019-09-08 06:56:33,075 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1116 transitions. Word has length 210 [2019-09-08 06:56:33,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:56:33,076 INFO L475 AbstractCegarLoop]: Abstraction has 814 states and 1116 transitions. [2019-09-08 06:56:33,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:56:33,076 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1116 transitions. [2019-09-08 06:56:33,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-08 06:56:33,078 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:56:33,078 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] [2019-09-08 06:56:33,078 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:56:33,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:56:33,079 INFO L82 PathProgramCache]: Analyzing trace with hash 240624898, now seen corresponding path program 1 times [2019-09-08 06:56:33,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:56:33,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:56:33,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:33,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:56:33,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:33,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:56:33,182 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 06:56:33,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:56:33,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:56:33,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:56:33,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:56:33,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:56:33,184 INFO L87 Difference]: Start difference. First operand 814 states and 1116 transitions. Second operand 6 states. [2019-09-08 06:56:33,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:56:33,318 INFO L93 Difference]: Finished difference Result 1637 states and 2300 transitions. [2019-09-08 06:56:33,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:56:33,319 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 210 [2019-09-08 06:56:33,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:56:33,324 INFO L225 Difference]: With dead ends: 1637 [2019-09-08 06:56:33,324 INFO L226 Difference]: Without dead ends: 852 [2019-09-08 06:56:33,329 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:56:33,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2019-09-08 06:56:33,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 824. [2019-09-08 06:56:33,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 824 states. [2019-09-08 06:56:33,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 1126 transitions. [2019-09-08 06:56:33,422 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 1126 transitions. Word has length 210 [2019-09-08 06:56:33,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:56:33,422 INFO L475 AbstractCegarLoop]: Abstraction has 824 states and 1126 transitions. [2019-09-08 06:56:33,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:56:33,422 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1126 transitions. [2019-09-08 06:56:33,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-08 06:56:33,424 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:56:33,424 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] [2019-09-08 06:56:33,425 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:56:33,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:56:33,425 INFO L82 PathProgramCache]: Analyzing trace with hash -642884092, now seen corresponding path program 1 times [2019-09-08 06:56:33,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:56:33,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:56:33,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:33,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:56:33,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:33,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:56:33,528 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 06:56:33,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:56:33,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:56:33,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:56:33,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:56:33,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:56:33,530 INFO L87 Difference]: Start difference. First operand 824 states and 1126 transitions. Second operand 4 states. [2019-09-08 06:56:34,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:56:34,157 INFO L93 Difference]: Finished difference Result 2401 states and 3380 transitions. [2019-09-08 06:56:34,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:56:34,158 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 210 [2019-09-08 06:56:34,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:56:34,167 INFO L225 Difference]: With dead ends: 2401 [2019-09-08 06:56:34,167 INFO L226 Difference]: Without dead ends: 1606 [2019-09-08 06:56:34,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:56:34,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2019-09-08 06:56:34,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1599. [2019-09-08 06:56:34,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1599 states. [2019-09-08 06:56:34,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1599 states to 1599 states and 2182 transitions. [2019-09-08 06:56:34,370 INFO L78 Accepts]: Start accepts. Automaton has 1599 states and 2182 transitions. Word has length 210 [2019-09-08 06:56:34,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:56:34,372 INFO L475 AbstractCegarLoop]: Abstraction has 1599 states and 2182 transitions. [2019-09-08 06:56:34,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:56:34,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 2182 transitions. [2019-09-08 06:56:34,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-08 06:56:34,374 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:56:34,374 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] [2019-09-08 06:56:34,375 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:56:34,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:56:34,375 INFO L82 PathProgramCache]: Analyzing trace with hash -680330781, now seen corresponding path program 1 times [2019-09-08 06:56:34,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:56:34,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:56:34,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:34,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:56:34,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:34,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:56:34,466 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 06:56:34,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:56:34,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:56:34,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:56:34,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:56:34,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:56:34,468 INFO L87 Difference]: Start difference. First operand 1599 states and 2182 transitions. Second operand 6 states. [2019-09-08 06:56:34,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:56:34,671 INFO L93 Difference]: Finished difference Result 3201 states and 4467 transitions. [2019-09-08 06:56:34,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:56:34,671 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 210 [2019-09-08 06:56:34,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:56:34,680 INFO L225 Difference]: With dead ends: 3201 [2019-09-08 06:56:34,681 INFO L226 Difference]: Without dead ends: 1631 [2019-09-08 06:56:34,687 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:56:34,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2019-09-08 06:56:34,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1609. [2019-09-08 06:56:34,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1609 states. [2019-09-08 06:56:34,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 2190 transitions. [2019-09-08 06:56:34,887 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 2190 transitions. Word has length 210 [2019-09-08 06:56:34,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:56:34,888 INFO L475 AbstractCegarLoop]: Abstraction has 1609 states and 2190 transitions. [2019-09-08 06:56:34,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:56:34,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 2190 transitions. [2019-09-08 06:56:34,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-08 06:56:34,891 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:56:34,891 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] [2019-09-08 06:56:34,892 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:56:34,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:56:34,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1735505569, now seen corresponding path program 1 times [2019-09-08 06:56:34,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:56:34,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:56:34,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:34,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:56:34,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:34,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:56:34,996 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 06:56:34,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:56:34,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:56:34,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:56:34,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:56:34,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:56:34,998 INFO L87 Difference]: Start difference. First operand 1609 states and 2190 transitions. Second operand 6 states. [2019-09-08 06:56:35,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:56:35,217 INFO L93 Difference]: Finished difference Result 3241 states and 4514 transitions. [2019-09-08 06:56:35,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:56:35,220 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 210 [2019-09-08 06:56:35,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:56:35,231 INFO L225 Difference]: With dead ends: 3241 [2019-09-08 06:56:35,231 INFO L226 Difference]: Without dead ends: 1661 [2019-09-08 06:56:35,240 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:56:35,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1661 states. [2019-09-08 06:56:35,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1661 to 1629. [2019-09-08 06:56:35,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1629 states. [2019-09-08 06:56:35,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1629 states to 1629 states and 2210 transitions. [2019-09-08 06:56:35,449 INFO L78 Accepts]: Start accepts. Automaton has 1629 states and 2210 transitions. Word has length 210 [2019-09-08 06:56:35,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:56:35,449 INFO L475 AbstractCegarLoop]: Abstraction has 1629 states and 2210 transitions. [2019-09-08 06:56:35,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:56:35,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 2210 transitions. [2019-09-08 06:56:35,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-08 06:56:35,451 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:56:35,451 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] [2019-09-08 06:56:35,452 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:56:35,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:56:35,452 INFO L82 PathProgramCache]: Analyzing trace with hash -825357277, now seen corresponding path program 1 times [2019-09-08 06:56:35,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:56:35,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:56:35,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:35,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:56:35,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:35,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:56:35,558 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 06:56:35,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:56:35,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:56:35,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:56:35,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:56:35,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:56:35,565 INFO L87 Difference]: Start difference. First operand 1629 states and 2210 transitions. Second operand 6 states. [2019-09-08 06:56:35,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:56:35,762 INFO L93 Difference]: Finished difference Result 3269 states and 4534 transitions. [2019-09-08 06:56:35,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:56:35,763 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 210 [2019-09-08 06:56:35,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:56:35,773 INFO L225 Difference]: With dead ends: 3269 [2019-09-08 06:56:35,773 INFO L226 Difference]: Without dead ends: 1669 [2019-09-08 06:56:35,779 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:56:35,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2019-09-08 06:56:35,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1649. [2019-09-08 06:56:35,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1649 states. [2019-09-08 06:56:35,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2230 transitions. [2019-09-08 06:56:35,955 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2230 transitions. Word has length 210 [2019-09-08 06:56:35,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:56:35,956 INFO L475 AbstractCegarLoop]: Abstraction has 1649 states and 2230 transitions. [2019-09-08 06:56:35,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:56:35,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2230 transitions. [2019-09-08 06:56:35,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-08 06:56:35,958 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:56:35,958 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] [2019-09-08 06:56:35,958 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:56:35,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:56:35,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1557324703, now seen corresponding path program 1 times [2019-09-08 06:56:35,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:56:35,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:56:35,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:35,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:56:35,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:35,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:56:36,044 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 06:56:36,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:56:36,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:56:36,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:56:36,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:56:36,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:56:36,046 INFO L87 Difference]: Start difference. First operand 1649 states and 2230 transitions. Second operand 4 states. [2019-09-08 06:56:36,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:56:36,800 INFO L93 Difference]: Finished difference Result 4865 states and 6788 transitions. [2019-09-08 06:56:36,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:56:36,800 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 210 [2019-09-08 06:56:36,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:56:36,822 INFO L225 Difference]: With dead ends: 4865 [2019-09-08 06:56:36,823 INFO L226 Difference]: Without dead ends: 3245 [2019-09-08 06:56:36,831 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:56:36,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3245 states. [2019-09-08 06:56:37,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3245 to 3236. [2019-09-08 06:56:37,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3236 states. [2019-09-08 06:56:37,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3236 states to 3236 states and 4371 transitions. [2019-09-08 06:56:37,197 INFO L78 Accepts]: Start accepts. Automaton has 3236 states and 4371 transitions. Word has length 210 [2019-09-08 06:56:37,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:56:37,197 INFO L475 AbstractCegarLoop]: Abstraction has 3236 states and 4371 transitions. [2019-09-08 06:56:37,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:56:37,198 INFO L276 IsEmpty]: Start isEmpty. Operand 3236 states and 4371 transitions. [2019-09-08 06:56:37,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-08 06:56:37,202 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:56:37,203 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:56:37,203 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:56:37,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:56:37,204 INFO L82 PathProgramCache]: Analyzing trace with hash -566654174, now seen corresponding path program 1 times [2019-09-08 06:56:37,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:56:37,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:56:37,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:37,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:56:37,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:37,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:56:37,295 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 06:56:37,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:56:37,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:56:37,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:56:37,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:56:37,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:56:37,297 INFO L87 Difference]: Start difference. First operand 3236 states and 4371 transitions. Second operand 6 states. [2019-09-08 06:56:37,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:56:37,639 INFO L93 Difference]: Finished difference Result 6471 states and 8937 transitions. [2019-09-08 06:56:37,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:56:37,641 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 237 [2019-09-08 06:56:37,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:56:37,661 INFO L225 Difference]: With dead ends: 6471 [2019-09-08 06:56:37,661 INFO L226 Difference]: Without dead ends: 3264 [2019-09-08 06:56:37,675 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:56:37,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3264 states. [2019-09-08 06:56:38,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3264 to 3256. [2019-09-08 06:56:38,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3256 states. [2019-09-08 06:56:38,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3256 states to 3256 states and 4387 transitions. [2019-09-08 06:56:38,209 INFO L78 Accepts]: Start accepts. Automaton has 3256 states and 4387 transitions. Word has length 237 [2019-09-08 06:56:38,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:56:38,209 INFO L475 AbstractCegarLoop]: Abstraction has 3256 states and 4387 transitions. [2019-09-08 06:56:38,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:56:38,210 INFO L276 IsEmpty]: Start isEmpty. Operand 3256 states and 4387 transitions. [2019-09-08 06:56:38,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-08 06:56:38,215 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:56:38,215 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:56:38,215 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:56:38,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:56:38,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1849182176, now seen corresponding path program 1 times [2019-09-08 06:56:38,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:56:38,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:56:38,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:38,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:56:38,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:38,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:56:38,329 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 06:56:38,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:56:38,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:56:38,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:56:38,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:56:38,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:56:38,331 INFO L87 Difference]: Start difference. First operand 3256 states and 4387 transitions. Second operand 5 states. [2019-09-08 06:56:39,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:56:39,884 INFO L93 Difference]: Finished difference Result 9179 states and 12360 transitions. [2019-09-08 06:56:39,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 06:56:39,884 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 237 [2019-09-08 06:56:39,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:56:39,908 INFO L225 Difference]: With dead ends: 9179 [2019-09-08 06:56:39,908 INFO L226 Difference]: Without dead ends: 5952 [2019-09-08 06:56:39,927 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 06:56:39,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5952 states. [2019-09-08 06:56:40,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5952 to 4680. [2019-09-08 06:56:40,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4680 states. [2019-09-08 06:56:40,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4680 states to 4680 states and 6179 transitions. [2019-09-08 06:56:40,465 INFO L78 Accepts]: Start accepts. Automaton has 4680 states and 6179 transitions. Word has length 237 [2019-09-08 06:56:40,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:56:40,466 INFO L475 AbstractCegarLoop]: Abstraction has 4680 states and 6179 transitions. [2019-09-08 06:56:40,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:56:40,466 INFO L276 IsEmpty]: Start isEmpty. Operand 4680 states and 6179 transitions. [2019-09-08 06:56:40,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-08 06:56:40,470 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:56:40,470 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:56:40,470 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:56:40,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:56:40,471 INFO L82 PathProgramCache]: Analyzing trace with hash 706679710, now seen corresponding path program 1 times [2019-09-08 06:56:40,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:56:40,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:56:40,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:40,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:56:40,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:40,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:56:40,570 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 06:56:40,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:56:40,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:56:40,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:56:40,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:56:40,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:56:40,572 INFO L87 Difference]: Start difference. First operand 4680 states and 6179 transitions. Second operand 5 states. [2019-09-08 06:56:41,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:56:41,569 INFO L93 Difference]: Finished difference Result 9330 states and 12348 transitions. [2019-09-08 06:56:41,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:56:41,570 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 237 [2019-09-08 06:56:41,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:56:41,587 INFO L225 Difference]: With dead ends: 9330 [2019-09-08 06:56:41,587 INFO L226 Difference]: Without dead ends: 4680 [2019-09-08 06:56:41,600 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:56:41,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4680 states. [2019-09-08 06:56:42,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4680 to 4680. [2019-09-08 06:56:42,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4680 states. [2019-09-08 06:56:42,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4680 states to 4680 states and 6155 transitions. [2019-09-08 06:56:42,471 INFO L78 Accepts]: Start accepts. Automaton has 4680 states and 6155 transitions. Word has length 237 [2019-09-08 06:56:42,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:56:42,472 INFO L475 AbstractCegarLoop]: Abstraction has 4680 states and 6155 transitions. [2019-09-08 06:56:42,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:56:42,472 INFO L276 IsEmpty]: Start isEmpty. Operand 4680 states and 6155 transitions. [2019-09-08 06:56:42,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-08 06:56:42,476 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:56:42,476 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:56:42,476 INFO L418 AbstractCegarLoop]: === Iteration 38 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:56:42,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:56:42,476 INFO L82 PathProgramCache]: Analyzing trace with hash 946919456, now seen corresponding path program 1 times [2019-09-08 06:56:42,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:56:42,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:56:42,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:42,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:56:42,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:42,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:56:42,591 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 06:56:42,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:56:42,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:56:42,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:56:42,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:56:42,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:56:42,593 INFO L87 Difference]: Start difference. First operand 4680 states and 6155 transitions. Second operand 5 states. [2019-09-08 06:56:43,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:56:43,622 INFO L93 Difference]: Finished difference Result 9330 states and 12300 transitions. [2019-09-08 06:56:43,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:56:43,623 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 237 [2019-09-08 06:56:43,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:56:43,643 INFO L225 Difference]: With dead ends: 9330 [2019-09-08 06:56:43,643 INFO L226 Difference]: Without dead ends: 4680 [2019-09-08 06:56:43,656 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:56:43,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4680 states. [2019-09-08 06:56:44,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4680 to 4680. [2019-09-08 06:56:44,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4680 states. [2019-09-08 06:56:44,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4680 states to 4680 states and 6131 transitions. [2019-09-08 06:56:44,207 INFO L78 Accepts]: Start accepts. Automaton has 4680 states and 6131 transitions. Word has length 237 [2019-09-08 06:56:44,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:56:44,208 INFO L475 AbstractCegarLoop]: Abstraction has 4680 states and 6131 transitions. [2019-09-08 06:56:44,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:56:44,208 INFO L276 IsEmpty]: Start isEmpty. Operand 4680 states and 6131 transitions. [2019-09-08 06:56:44,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-08 06:56:44,212 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:56:44,212 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:56:44,213 INFO L418 AbstractCegarLoop]: === Iteration 39 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:56:44,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:56:44,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1785953118, now seen corresponding path program 1 times [2019-09-08 06:56:44,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:56:44,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:56:44,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:44,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:56:44,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:44,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:56:44,318 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 06:56:44,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:56:44,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:56:44,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:56:44,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:56:44,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:56:44,319 INFO L87 Difference]: Start difference. First operand 4680 states and 6131 transitions. Second operand 5 states. [2019-09-08 06:56:45,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:56:45,333 INFO L93 Difference]: Finished difference Result 9330 states and 12252 transitions. [2019-09-08 06:56:45,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:56:45,334 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 237 [2019-09-08 06:56:45,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:56:45,354 INFO L225 Difference]: With dead ends: 9330 [2019-09-08 06:56:45,354 INFO L226 Difference]: Without dead ends: 4680 [2019-09-08 06:56:45,364 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:56:45,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4680 states. [2019-09-08 06:56:45,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4680 to 4680. [2019-09-08 06:56:45,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4680 states. [2019-09-08 06:56:45,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4680 states to 4680 states and 6107 transitions. [2019-09-08 06:56:45,950 INFO L78 Accepts]: Start accepts. Automaton has 4680 states and 6107 transitions. Word has length 237 [2019-09-08 06:56:45,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:56:45,950 INFO L475 AbstractCegarLoop]: Abstraction has 4680 states and 6107 transitions. [2019-09-08 06:56:45,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:56:45,950 INFO L276 IsEmpty]: Start isEmpty. Operand 4680 states and 6107 transitions. [2019-09-08 06:56:45,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-08 06:56:45,953 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:56:45,953 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:56:45,953 INFO L418 AbstractCegarLoop]: === Iteration 40 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:56:45,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:56:45,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1813018720, now seen corresponding path program 1 times [2019-09-08 06:56:45,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:56:45,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:56:45,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:45,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:56:45,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:45,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:56:46,061 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 06:56:46,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:56:46,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:56:46,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:56:46,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:56:46,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:56:46,062 INFO L87 Difference]: Start difference. First operand 4680 states and 6107 transitions. Second operand 5 states. [2019-09-08 06:56:47,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:56:47,110 INFO L93 Difference]: Finished difference Result 9330 states and 12204 transitions. [2019-09-08 06:56:47,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:56:47,110 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 237 [2019-09-08 06:56:47,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:56:47,126 INFO L225 Difference]: With dead ends: 9330 [2019-09-08 06:56:47,127 INFO L226 Difference]: Without dead ends: 4680 [2019-09-08 06:56:47,137 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:56:47,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4680 states. [2019-09-08 06:56:47,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4680 to 4680. [2019-09-08 06:56:47,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4680 states. [2019-09-08 06:56:47,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4680 states to 4680 states and 6083 transitions. [2019-09-08 06:56:47,648 INFO L78 Accepts]: Start accepts. Automaton has 4680 states and 6083 transitions. Word has length 237 [2019-09-08 06:56:47,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:56:47,648 INFO L475 AbstractCegarLoop]: Abstraction has 4680 states and 6083 transitions. [2019-09-08 06:56:47,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:56:47,649 INFO L276 IsEmpty]: Start isEmpty. Operand 4680 states and 6083 transitions. [2019-09-08 06:56:47,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-08 06:56:47,653 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:56:47,653 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:56:47,654 INFO L418 AbstractCegarLoop]: === Iteration 41 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:56:47,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:56:47,654 INFO L82 PathProgramCache]: Analyzing trace with hash -264318178, now seen corresponding path program 1 times [2019-09-08 06:56:47,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:56:47,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:56:47,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:47,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:56:47,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:47,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:56:47,842 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 06:56:47,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:56:47,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:56:47,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:56:47,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:56:47,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:56:47,843 INFO L87 Difference]: Start difference. First operand 4680 states and 6083 transitions. Second operand 5 states. [2019-09-08 06:56:48,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:56:48,910 INFO L93 Difference]: Finished difference Result 9330 states and 12156 transitions. [2019-09-08 06:56:48,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:56:48,911 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 237 [2019-09-08 06:56:48,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:56:48,929 INFO L225 Difference]: With dead ends: 9330 [2019-09-08 06:56:48,930 INFO L226 Difference]: Without dead ends: 4680 [2019-09-08 06:56:48,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:56:48,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4680 states. [2019-09-08 06:56:49,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4680 to 4680. [2019-09-08 06:56:49,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4680 states. [2019-09-08 06:56:49,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4680 states to 4680 states and 6059 transitions. [2019-09-08 06:56:49,276 INFO L78 Accepts]: Start accepts. Automaton has 4680 states and 6059 transitions. Word has length 237 [2019-09-08 06:56:49,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:56:49,276 INFO L475 AbstractCegarLoop]: Abstraction has 4680 states and 6059 transitions. [2019-09-08 06:56:49,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:56:49,277 INFO L276 IsEmpty]: Start isEmpty. Operand 4680 states and 6059 transitions. [2019-09-08 06:56:49,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-08 06:56:49,283 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:56:49,283 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:56:49,283 INFO L418 AbstractCegarLoop]: === Iteration 42 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:56:49,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:56:49,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1469786272, now seen corresponding path program 1 times [2019-09-08 06:56:49,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:56:49,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:56:49,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:49,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:56:49,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:49,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:56:49,391 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 06:56:49,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:56:49,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:56:49,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:56:49,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:56:49,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:56:49,393 INFO L87 Difference]: Start difference. First operand 4680 states and 6059 transitions. Second operand 5 states. [2019-09-08 06:56:50,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:56:50,456 INFO L93 Difference]: Finished difference Result 9330 states and 12108 transitions. [2019-09-08 06:56:50,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:56:50,456 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 237 [2019-09-08 06:56:50,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:56:50,471 INFO L225 Difference]: With dead ends: 9330 [2019-09-08 06:56:50,471 INFO L226 Difference]: Without dead ends: 4680 [2019-09-08 06:56:50,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:56:50,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4680 states. [2019-09-08 06:56:51,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4680 to 4680. [2019-09-08 06:56:51,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4680 states. [2019-09-08 06:56:51,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4680 states to 4680 states and 6035 transitions. [2019-09-08 06:56:51,137 INFO L78 Accepts]: Start accepts. Automaton has 4680 states and 6035 transitions. Word has length 237 [2019-09-08 06:56:51,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:56:51,137 INFO L475 AbstractCegarLoop]: Abstraction has 4680 states and 6035 transitions. [2019-09-08 06:56:51,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:56:51,138 INFO L276 IsEmpty]: Start isEmpty. Operand 4680 states and 6035 transitions. [2019-09-08 06:56:51,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-08 06:56:51,142 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:56:51,143 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:56:51,143 INFO L418 AbstractCegarLoop]: === Iteration 43 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:56:51,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:56:51,144 INFO L82 PathProgramCache]: Analyzing trace with hash -441256286, now seen corresponding path program 1 times [2019-09-08 06:56:51,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:56:51,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:56:51,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:51,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:56:51,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:51,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:56:51,302 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 06:56:51,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:56:51,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:56:51,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:56:51,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:56:51,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:56:51,304 INFO L87 Difference]: Start difference. First operand 4680 states and 6035 transitions. Second operand 5 states. [2019-09-08 06:56:52,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:56:52,475 INFO L93 Difference]: Finished difference Result 9330 states and 12060 transitions. [2019-09-08 06:56:52,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:56:52,476 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 237 [2019-09-08 06:56:52,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:56:52,486 INFO L225 Difference]: With dead ends: 9330 [2019-09-08 06:56:52,487 INFO L226 Difference]: Without dead ends: 4680 [2019-09-08 06:56:52,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:56:52,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4680 states. [2019-09-08 06:56:53,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4680 to 4680. [2019-09-08 06:56:53,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4680 states. [2019-09-08 06:56:53,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4680 states to 4680 states and 6011 transitions. [2019-09-08 06:56:53,030 INFO L78 Accepts]: Start accepts. Automaton has 4680 states and 6011 transitions. Word has length 237 [2019-09-08 06:56:53,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:56:53,031 INFO L475 AbstractCegarLoop]: Abstraction has 4680 states and 6011 transitions. [2019-09-08 06:56:53,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:56:53,031 INFO L276 IsEmpty]: Start isEmpty. Operand 4680 states and 6011 transitions. [2019-09-08 06:56:53,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-08 06:56:53,033 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:56:53,034 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:56:53,034 INFO L418 AbstractCegarLoop]: === Iteration 44 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:56:53,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:56:53,034 INFO L82 PathProgramCache]: Analyzing trace with hash -364355488, now seen corresponding path program 1 times [2019-09-08 06:56:53,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:56:53,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:56:53,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:53,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:56:53,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:53,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:56:53,140 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 06:56:53,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:56:53,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:56:53,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:56:53,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:56:53,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:56:53,142 INFO L87 Difference]: Start difference. First operand 4680 states and 6011 transitions. Second operand 5 states. [2019-09-08 06:56:54,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:56:54,229 INFO L93 Difference]: Finished difference Result 9330 states and 12012 transitions. [2019-09-08 06:56:54,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:56:54,229 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 237 [2019-09-08 06:56:54,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:56:54,246 INFO L225 Difference]: With dead ends: 9330 [2019-09-08 06:56:54,246 INFO L226 Difference]: Without dead ends: 4680 [2019-09-08 06:56:54,257 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:56:54,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4680 states. [2019-09-08 06:56:54,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4680 to 4680. [2019-09-08 06:56:54,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4680 states. [2019-09-08 06:56:54,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4680 states to 4680 states and 5987 transitions. [2019-09-08 06:56:54,806 INFO L78 Accepts]: Start accepts. Automaton has 4680 states and 5987 transitions. Word has length 237 [2019-09-08 06:56:54,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:56:54,807 INFO L475 AbstractCegarLoop]: Abstraction has 4680 states and 5987 transitions. [2019-09-08 06:56:54,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:56:54,807 INFO L276 IsEmpty]: Start isEmpty. Operand 4680 states and 5987 transitions. [2019-09-08 06:56:54,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-08 06:56:54,811 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:56:54,811 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:56:54,811 INFO L418 AbstractCegarLoop]: === Iteration 45 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:56:54,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:56:54,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1331706142, now seen corresponding path program 1 times [2019-09-08 06:56:54,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:56:54,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:56:54,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:54,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:56:54,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:54,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:56:54,915 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 06:56:54,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:56:54,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:56:54,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:56:54,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:56:54,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:56:54,917 INFO L87 Difference]: Start difference. First operand 4680 states and 5987 transitions. Second operand 5 states. [2019-09-08 06:56:55,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:56:55,990 INFO L93 Difference]: Finished difference Result 9330 states and 11964 transitions. [2019-09-08 06:56:55,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:56:55,991 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 237 [2019-09-08 06:56:55,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:56:56,007 INFO L225 Difference]: With dead ends: 9330 [2019-09-08 06:56:56,007 INFO L226 Difference]: Without dead ends: 4680 [2019-09-08 06:56:56,017 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:56:56,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4680 states. [2019-09-08 06:56:56,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4680 to 4680. [2019-09-08 06:56:56,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4680 states. [2019-09-08 06:56:56,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4680 states to 4680 states and 5963 transitions. [2019-09-08 06:56:56,501 INFO L78 Accepts]: Start accepts. Automaton has 4680 states and 5963 transitions. Word has length 237 [2019-09-08 06:56:56,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:56:56,501 INFO L475 AbstractCegarLoop]: Abstraction has 4680 states and 5963 transitions. [2019-09-08 06:56:56,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:56:56,502 INFO L276 IsEmpty]: Start isEmpty. Operand 4680 states and 5963 transitions. [2019-09-08 06:56:56,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-08 06:56:56,505 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:56:56,506 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:56:56,506 INFO L418 AbstractCegarLoop]: === Iteration 46 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:56:56,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:56:56,506 INFO L82 PathProgramCache]: Analyzing trace with hash 576751648, now seen corresponding path program 1 times [2019-09-08 06:56:56,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:56:56,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:56:56,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:56,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:56:56,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:56,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:56:56,603 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 06:56:56,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:56:56,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:56:56,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:56:56,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:56:56,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:56:56,604 INFO L87 Difference]: Start difference. First operand 4680 states and 5963 transitions. Second operand 5 states. [2019-09-08 06:56:58,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:56:58,388 INFO L93 Difference]: Finished difference Result 12048 states and 15815 transitions. [2019-09-08 06:56:58,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:56:58,389 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 237 [2019-09-08 06:56:58,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:56:58,416 INFO L225 Difference]: With dead ends: 12048 [2019-09-08 06:56:58,416 INFO L226 Difference]: Without dead ends: 7397 [2019-09-08 06:56:58,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:56:58,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7397 states. [2019-09-08 06:56:58,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7397 to 5856. [2019-09-08 06:56:58,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5856 states. [2019-09-08 06:56:59,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5856 states to 5856 states and 7299 transitions. [2019-09-08 06:56:59,011 INFO L78 Accepts]: Start accepts. Automaton has 5856 states and 7299 transitions. Word has length 237 [2019-09-08 06:56:59,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:56:59,012 INFO L475 AbstractCegarLoop]: Abstraction has 5856 states and 7299 transitions. [2019-09-08 06:56:59,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:56:59,012 INFO L276 IsEmpty]: Start isEmpty. Operand 5856 states and 7299 transitions. [2019-09-08 06:56:59,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-08 06:56:59,015 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:56:59,016 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:56:59,016 INFO L418 AbstractCegarLoop]: === Iteration 47 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:56:59,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:56:59,016 INFO L82 PathProgramCache]: Analyzing trace with hash 84125474, now seen corresponding path program 1 times [2019-09-08 06:56:59,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:56:59,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:56:59,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:59,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:56:59,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:59,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:56:59,122 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 06:56:59,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:56:59,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:56:59,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:56:59,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:56:59,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:56:59,123 INFO L87 Difference]: Start difference. First operand 5856 states and 7299 transitions. Second operand 5 states. [2019-09-08 06:57:00,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:57:00,966 INFO L93 Difference]: Finished difference Result 14200 states and 18271 transitions. [2019-09-08 06:57:00,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:57:00,967 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 237 [2019-09-08 06:57:00,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:57:00,995 INFO L225 Difference]: With dead ends: 14200 [2019-09-08 06:57:00,995 INFO L226 Difference]: Without dead ends: 8373 [2019-09-08 06:57:01,010 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:57:01,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8373 states. [2019-09-08 06:57:01,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8373 to 6952. [2019-09-08 06:57:01,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6952 states. [2019-09-08 06:57:01,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6952 states to 6952 states and 8523 transitions. [2019-09-08 06:57:01,611 INFO L78 Accepts]: Start accepts. Automaton has 6952 states and 8523 transitions. Word has length 237 [2019-09-08 06:57:01,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:57:01,612 INFO L475 AbstractCegarLoop]: Abstraction has 6952 states and 8523 transitions. [2019-09-08 06:57:01,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:57:01,612 INFO L276 IsEmpty]: Start isEmpty. Operand 6952 states and 8523 transitions. [2019-09-08 06:57:01,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-08 06:57:01,615 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:57:01,615 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:57:01,615 INFO L418 AbstractCegarLoop]: === Iteration 48 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:57:01,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:57:01,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1038065632, now seen corresponding path program 1 times [2019-09-08 06:57:01,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:57:01,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:57:01,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:01,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:57:01,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:01,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:57:01,721 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 06:57:01,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:57:01,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:57:01,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:57:01,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:57:01,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:57:01,723 INFO L87 Difference]: Start difference. First operand 6952 states and 8523 transitions. Second operand 5 states. [2019-09-08 06:57:03,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:57:03,679 INFO L93 Difference]: Finished difference Result 16192 states and 20503 transitions. [2019-09-08 06:57:03,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:57:03,679 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 237 [2019-09-08 06:57:03,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:57:03,705 INFO L225 Difference]: With dead ends: 16192 [2019-09-08 06:57:03,705 INFO L226 Difference]: Without dead ends: 9269 [2019-09-08 06:57:03,720 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:57:03,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9269 states. [2019-09-08 06:57:04,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9269 to 7968. [2019-09-08 06:57:04,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7968 states. [2019-09-08 06:57:04,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7968 states to 7968 states and 9635 transitions. [2019-09-08 06:57:04,470 INFO L78 Accepts]: Start accepts. Automaton has 7968 states and 9635 transitions. Word has length 237 [2019-09-08 06:57:04,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:57:04,470 INFO L475 AbstractCegarLoop]: Abstraction has 7968 states and 9635 transitions. [2019-09-08 06:57:04,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:57:04,471 INFO L276 IsEmpty]: Start isEmpty. Operand 7968 states and 9635 transitions. [2019-09-08 06:57:04,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-08 06:57:04,474 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:57:04,474 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:57:04,474 INFO L418 AbstractCegarLoop]: === Iteration 49 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:57:04,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:57:04,475 INFO L82 PathProgramCache]: Analyzing trace with hash -178088094, now seen corresponding path program 1 times [2019-09-08 06:57:04,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:57:04,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:57:04,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:04,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:57:04,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:04,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:57:04,580 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 06:57:04,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:57:04,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:57:04,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:57:04,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:57:04,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:57:04,581 INFO L87 Difference]: Start difference. First operand 7968 states and 9635 transitions. Second operand 5 states. [2019-09-08 06:57:06,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:57:06,500 INFO L93 Difference]: Finished difference Result 17415 states and 21620 transitions. [2019-09-08 06:57:06,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:57:06,501 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 237 [2019-09-08 06:57:06,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:57:06,537 INFO L225 Difference]: With dead ends: 17415 [2019-09-08 06:57:06,537 INFO L226 Difference]: Without dead ends: 9477 [2019-09-08 06:57:06,557 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:57:06,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9477 states. [2019-09-08 06:57:07,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9477 to 8980. [2019-09-08 06:57:07,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8980 states. [2019-09-08 06:57:07,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8980 states to 8980 states and 10739 transitions. [2019-09-08 06:57:07,413 INFO L78 Accepts]: Start accepts. Automaton has 8980 states and 10739 transitions. Word has length 237 [2019-09-08 06:57:07,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:57:07,414 INFO L475 AbstractCegarLoop]: Abstraction has 8980 states and 10739 transitions. [2019-09-08 06:57:07,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:57:07,414 INFO L276 IsEmpty]: Start isEmpty. Operand 8980 states and 10739 transitions. [2019-09-08 06:57:07,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-08 06:57:07,417 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:57:07,418 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:57:07,418 INFO L418 AbstractCegarLoop]: === Iteration 50 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:57:07,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:57:07,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1864267932, now seen corresponding path program 1 times [2019-09-08 06:57:07,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:57:07,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:57:07,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:07,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:57:07,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:07,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:57:07,528 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 06:57:07,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:57:07,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:57:07,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:57:07,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:57:07,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:57:07,530 INFO L87 Difference]: Start difference. First operand 8980 states and 10739 transitions. Second operand 5 states. [2019-09-08 06:57:09,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:57:09,508 INFO L93 Difference]: Finished difference Result 18734 states and 22958 transitions. [2019-09-08 06:57:09,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:57:09,508 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 237 [2019-09-08 06:57:09,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:57:09,546 INFO L225 Difference]: With dead ends: 18734 [2019-09-08 06:57:09,546 INFO L226 Difference]: Without dead ends: 9783 [2019-09-08 06:57:09,565 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:57:09,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9783 states. [2019-09-08 06:57:10,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9783 to 9316. [2019-09-08 06:57:10,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9316 states. [2019-09-08 06:57:10,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9316 states to 9316 states and 11031 transitions. [2019-09-08 06:57:10,566 INFO L78 Accepts]: Start accepts. Automaton has 9316 states and 11031 transitions. Word has length 237 [2019-09-08 06:57:10,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:57:10,567 INFO L475 AbstractCegarLoop]: Abstraction has 9316 states and 11031 transitions. [2019-09-08 06:57:10,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:57:10,567 INFO L276 IsEmpty]: Start isEmpty. Operand 9316 states and 11031 transitions. [2019-09-08 06:57:10,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-08 06:57:10,570 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:57:10,570 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:57:10,570 INFO L418 AbstractCegarLoop]: === Iteration 51 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:57:10,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:57:10,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1918660830, now seen corresponding path program 1 times [2019-09-08 06:57:10,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:57:10,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:57:10,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:10,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:57:10,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:10,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:57:10,662 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 06:57:10,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:57:10,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:57:10,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:57:10,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:57:10,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:57:10,664 INFO L87 Difference]: Start difference. First operand 9316 states and 11031 transitions. Second operand 5 states. [2019-09-08 06:57:12,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:57:12,673 INFO L93 Difference]: Finished difference Result 20021 states and 24312 transitions. [2019-09-08 06:57:12,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:57:12,673 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 237 [2019-09-08 06:57:12,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:57:12,712 INFO L225 Difference]: With dead ends: 20021 [2019-09-08 06:57:12,713 INFO L226 Difference]: Without dead ends: 10735 [2019-09-08 06:57:12,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:57:12,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10735 states. [2019-09-08 06:57:13,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10735 to 10238. [2019-09-08 06:57:13,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10238 states. [2019-09-08 06:57:13,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10238 states to 10238 states and 12009 transitions. [2019-09-08 06:57:13,584 INFO L78 Accepts]: Start accepts. Automaton has 10238 states and 12009 transitions. Word has length 237 [2019-09-08 06:57:13,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:57:13,585 INFO L475 AbstractCegarLoop]: Abstraction has 10238 states and 12009 transitions. [2019-09-08 06:57:13,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:57:13,585 INFO L276 IsEmpty]: Start isEmpty. Operand 10238 states and 12009 transitions. [2019-09-08 06:57:13,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-08 06:57:13,590 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:57:13,591 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:57:13,591 INFO L418 AbstractCegarLoop]: === Iteration 52 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:57:13,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:57:13,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1958909860, now seen corresponding path program 1 times [2019-09-08 06:57:13,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:57:13,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:57:13,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:13,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:57:13,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:13,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:57:13,685 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 06:57:13,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:57:13,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:57:13,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:57:13,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:57:13,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:57:13,686 INFO L87 Difference]: Start difference. First operand 10238 states and 12009 transitions. Second operand 5 states. [2019-09-08 06:57:15,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:57:15,774 INFO L93 Difference]: Finished difference Result 21052 states and 25300 transitions. [2019-09-08 06:57:15,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:57:15,774 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 237 [2019-09-08 06:57:15,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:57:15,803 INFO L225 Difference]: With dead ends: 21052 [2019-09-08 06:57:15,804 INFO L226 Difference]: Without dead ends: 10843 [2019-09-08 06:57:15,821 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:57:15,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10843 states. [2019-09-08 06:57:16,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10843 to 10484. [2019-09-08 06:57:16,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10484 states. [2019-09-08 06:57:16,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10484 states to 10484 states and 12175 transitions. [2019-09-08 06:57:16,690 INFO L78 Accepts]: Start accepts. Automaton has 10484 states and 12175 transitions. Word has length 237 [2019-09-08 06:57:16,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:57:16,691 INFO L475 AbstractCegarLoop]: Abstraction has 10484 states and 12175 transitions. [2019-09-08 06:57:16,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:57:16,691 INFO L276 IsEmpty]: Start isEmpty. Operand 10484 states and 12175 transitions. [2019-09-08 06:57:16,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-08 06:57:16,694 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:57:16,694 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:57:16,695 INFO L418 AbstractCegarLoop]: === Iteration 53 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:57:16,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:57:16,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1656785182, now seen corresponding path program 1 times [2019-09-08 06:57:16,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:57:16,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:57:16,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:16,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:57:16,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:16,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:57:16,798 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 06:57:16,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:57:16,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:57:16,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:57:16,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:57:16,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:57:16,801 INFO L87 Difference]: Start difference. First operand 10484 states and 12175 transitions. Second operand 5 states. [2019-09-08 06:57:18,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:57:18,950 INFO L93 Difference]: Finished difference Result 22264 states and 26719 transitions. [2019-09-08 06:57:18,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:57:18,950 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 237 [2019-09-08 06:57:18,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:57:18,993 INFO L225 Difference]: With dead ends: 22264 [2019-09-08 06:57:18,993 INFO L226 Difference]: Without dead ends: 11809 [2019-09-08 06:57:19,011 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:57:19,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11809 states. [2019-09-08 06:57:19,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11809 to 11180. [2019-09-08 06:57:19,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11180 states. [2019-09-08 06:57:19,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11180 states to 11180 states and 12839 transitions. [2019-09-08 06:57:19,953 INFO L78 Accepts]: Start accepts. Automaton has 11180 states and 12839 transitions. Word has length 237 [2019-09-08 06:57:19,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:57:19,953 INFO L475 AbstractCegarLoop]: Abstraction has 11180 states and 12839 transitions. [2019-09-08 06:57:19,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:57:19,953 INFO L276 IsEmpty]: Start isEmpty. Operand 11180 states and 12839 transitions. [2019-09-08 06:57:19,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-08 06:57:19,957 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:57:19,957 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:57:19,957 INFO L418 AbstractCegarLoop]: === Iteration 54 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:57:19,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:57:19,958 INFO L82 PathProgramCache]: Analyzing trace with hash 304789476, now seen corresponding path program 1 times [2019-09-08 06:57:19,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:57:19,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:57:19,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:19,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:57:19,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:19,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:57:20,051 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 06:57:20,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:57:20,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:57:20,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:57:20,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:57:20,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:57:20,053 INFO L87 Difference]: Start difference. First operand 11180 states and 12839 transitions. Second operand 5 states. [2019-09-08 06:57:22,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:57:22,243 INFO L93 Difference]: Finished difference Result 23599 states and 27758 transitions. [2019-09-08 06:57:22,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:57:22,243 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 237 [2019-09-08 06:57:22,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:57:22,275 INFO L225 Difference]: With dead ends: 23599 [2019-09-08 06:57:22,275 INFO L226 Difference]: Without dead ends: 12449 [2019-09-08 06:57:22,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:57:22,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12449 states. [2019-09-08 06:57:23,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12449 to 11952. [2019-09-08 06:57:23,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11952 states. [2019-09-08 06:57:23,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11952 states to 11952 states and 13607 transitions. [2019-09-08 06:57:23,296 INFO L78 Accepts]: Start accepts. Automaton has 11952 states and 13607 transitions. Word has length 237 [2019-09-08 06:57:23,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:57:23,297 INFO L475 AbstractCegarLoop]: Abstraction has 11952 states and 13607 transitions. [2019-09-08 06:57:23,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:57:23,297 INFO L276 IsEmpty]: Start isEmpty. Operand 11952 states and 13607 transitions. [2019-09-08 06:57:23,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-08 06:57:23,300 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:57:23,301 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:57:23,301 INFO L418 AbstractCegarLoop]: === Iteration 55 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:57:23,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:57:23,301 INFO L82 PathProgramCache]: Analyzing trace with hash 506613410, now seen corresponding path program 1 times [2019-09-08 06:57:23,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:57:23,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:57:23,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:23,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:57:23,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:23,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:57:23,369 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 06:57:23,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:57:23,370 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:57:23,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:57:23,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:57:23,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 1592 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:57:23,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:57:23,694 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-08 06:57:23,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:57:23,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2019-09-08 06:57:23,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:57:23,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:57:23,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:57:23,709 INFO L87 Difference]: Start difference. First operand 11952 states and 13607 transitions. Second operand 3 states. [2019-09-08 06:57:25,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:57:25,631 INFO L93 Difference]: Finished difference Result 34639 states and 39545 transitions. [2019-09-08 06:57:25,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:57:25,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 237 [2019-09-08 06:57:25,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:57:25,683 INFO L225 Difference]: With dead ends: 34639 [2019-09-08 06:57:25,683 INFO L226 Difference]: Without dead ends: 22717 [2019-09-08 06:57:25,710 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 238 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 06:57:25,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22717 states. [2019-09-08 06:57:27,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22717 to 22711. [2019-09-08 06:57:27,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22711 states. [2019-09-08 06:57:27,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22711 states to 22711 states and 25874 transitions. [2019-09-08 06:57:27,785 INFO L78 Accepts]: Start accepts. Automaton has 22711 states and 25874 transitions. Word has length 237 [2019-09-08 06:57:27,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:57:27,786 INFO L475 AbstractCegarLoop]: Abstraction has 22711 states and 25874 transitions. [2019-09-08 06:57:27,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:57:27,786 INFO L276 IsEmpty]: Start isEmpty. Operand 22711 states and 25874 transitions. [2019-09-08 06:57:27,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-08 06:57:27,795 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:57:27,795 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:57:27,795 INFO L418 AbstractCegarLoop]: === Iteration 56 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:57:27,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:57:27,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1572889176, now seen corresponding path program 1 times [2019-09-08 06:57:27,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:57:27,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:57:27,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:27,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:57:27,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:27,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:57:27,858 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-08 06:57:27,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:57:27,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:57:27,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:57:27,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:57:27,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:57:27,859 INFO L87 Difference]: Start difference. First operand 22711 states and 25874 transitions. Second operand 4 states. [2019-09-08 06:57:30,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:57:30,868 INFO L93 Difference]: Finished difference Result 45377 states and 51679 transitions. [2019-09-08 06:57:30,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:57:30,869 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 239 [2019-09-08 06:57:30,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:57:30,938 INFO L225 Difference]: With dead ends: 45377 [2019-09-08 06:57:30,938 INFO L226 Difference]: Without dead ends: 22696 [2019-09-08 06:57:30,977 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:57:30,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22696 states. [2019-09-08 06:57:32,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22696 to 22696. [2019-09-08 06:57:32,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22696 states. [2019-09-08 06:57:32,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22696 states to 22696 states and 25847 transitions. [2019-09-08 06:57:32,971 INFO L78 Accepts]: Start accepts. Automaton has 22696 states and 25847 transitions. Word has length 239 [2019-09-08 06:57:32,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:57:32,972 INFO L475 AbstractCegarLoop]: Abstraction has 22696 states and 25847 transitions. [2019-09-08 06:57:32,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:57:32,972 INFO L276 IsEmpty]: Start isEmpty. Operand 22696 states and 25847 transitions. [2019-09-08 06:57:32,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-08 06:57:32,980 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:57:32,981 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:57:32,981 INFO L418 AbstractCegarLoop]: === Iteration 57 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:57:32,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:57:32,981 INFO L82 PathProgramCache]: Analyzing trace with hash -222479066, now seen corresponding path program 1 times [2019-09-08 06:57:32,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:57:32,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:57:32,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:32,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:57:32,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:33,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:57:33,064 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-08 06:57:33,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:57:33,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:57:33,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:57:33,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:57:33,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:57:33,066 INFO L87 Difference]: Start difference. First operand 22696 states and 25847 transitions. Second operand 3 states. [2019-09-08 06:57:36,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:57:36,900 INFO L93 Difference]: Finished difference Result 67955 states and 77600 transitions. [2019-09-08 06:57:36,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:57:36,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-09-08 06:57:36,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:57:36,983 INFO L225 Difference]: With dead ends: 67955 [2019-09-08 06:57:36,983 INFO L226 Difference]: Without dead ends: 34024 [2019-09-08 06:57:37,028 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 06:57:37,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34024 states. [2019-09-08 06:57:41,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34024 to 34024. [2019-09-08 06:57:41,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34024 states. [2019-09-08 06:57:41,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34024 states to 34024 states and 38818 transitions. [2019-09-08 06:57:41,227 INFO L78 Accepts]: Start accepts. Automaton has 34024 states and 38818 transitions. Word has length 239 [2019-09-08 06:57:41,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:57:41,228 INFO L475 AbstractCegarLoop]: Abstraction has 34024 states and 38818 transitions. [2019-09-08 06:57:41,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:57:41,228 INFO L276 IsEmpty]: Start isEmpty. Operand 34024 states and 38818 transitions. [2019-09-08 06:57:41,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2019-09-08 06:57:41,263 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:57:41,264 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:57:41,264 INFO L418 AbstractCegarLoop]: === Iteration 58 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:57:41,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:57:41,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1288286621, now seen corresponding path program 1 times [2019-09-08 06:57:41,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:57:41,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:57:41,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:41,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:57:41,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:41,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:57:41,377 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-09-08 06:57:41,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:57:41,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:57:41,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:57:41,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:57:41,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:57:41,379 INFO L87 Difference]: Start difference. First operand 34024 states and 38818 transitions. Second operand 3 states. [2019-09-08 06:57:48,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:57:48,012 INFO L93 Difference]: Finished difference Result 98880 states and 113848 transitions. [2019-09-08 06:57:48,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:57:48,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 355 [2019-09-08 06:57:48,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:57:48,183 INFO L225 Difference]: With dead ends: 98880 [2019-09-08 06:57:48,183 INFO L226 Difference]: Without dead ends: 64886 [2019-09-08 06:57:48,236 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 06:57:48,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64886 states. [2019-09-08 06:57:53,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64886 to 64880. [2019-09-08 06:57:53,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64880 states. [2019-09-08 06:57:53,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64880 states to 64880 states and 74550 transitions. [2019-09-08 06:57:53,869 INFO L78 Accepts]: Start accepts. Automaton has 64880 states and 74550 transitions. Word has length 355 [2019-09-08 06:57:53,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:57:53,869 INFO L475 AbstractCegarLoop]: Abstraction has 64880 states and 74550 transitions. [2019-09-08 06:57:53,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:57:53,869 INFO L276 IsEmpty]: Start isEmpty. Operand 64880 states and 74550 transitions. [2019-09-08 06:57:53,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2019-09-08 06:57:53,927 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:57:53,927 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:57:53,927 INFO L418 AbstractCegarLoop]: === Iteration 59 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:57:53,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:57:53,928 INFO L82 PathProgramCache]: Analyzing trace with hash 756008668, now seen corresponding path program 1 times [2019-09-08 06:57:53,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:57:53,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:57:53,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:53,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:57:53,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:53,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:57:54,099 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-09-08 06:57:54,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:57:54,099 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:57:54,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:57:54,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:57:54,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 1985 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:57:54,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:57:54,458 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 06:57:54,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:57:54,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:57:54,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:57:54,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:57:54,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:57:54,465 INFO L87 Difference]: Start difference. First operand 64880 states and 74550 transitions. Second operand 7 states. [2019-09-08 06:58:07,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:58:07,301 INFO L93 Difference]: Finished difference Result 172004 states and 204707 transitions. [2019-09-08 06:58:07,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 06:58:07,302 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 356 [2019-09-08 06:58:07,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:58:07,558 INFO L225 Difference]: With dead ends: 172004 [2019-09-08 06:58:07,559 INFO L226 Difference]: Without dead ends: 86797 [2019-09-08 06:58:07,694 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-08 06:58:07,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86797 states. [2019-09-08 06:58:18,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86797 to 86796. [2019-09-08 06:58:18,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86796 states. [2019-09-08 06:58:18,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86796 states to 86796 states and 100498 transitions. [2019-09-08 06:58:18,456 INFO L78 Accepts]: Start accepts. Automaton has 86796 states and 100498 transitions. Word has length 356 [2019-09-08 06:58:18,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:58:18,457 INFO L475 AbstractCegarLoop]: Abstraction has 86796 states and 100498 transitions. [2019-09-08 06:58:18,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:58:18,457 INFO L276 IsEmpty]: Start isEmpty. Operand 86796 states and 100498 transitions. [2019-09-08 06:58:18,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 705 [2019-09-08 06:58:18,559 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:58:18,559 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:58:18,560 INFO L418 AbstractCegarLoop]: === Iteration 60 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:58:18,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:58:18,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1130266816, now seen corresponding path program 1 times [2019-09-08 06:58:18,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:58:18,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:58:18,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:58:18,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:58:18,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:58:18,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:58:18,824 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 47 proven. 118 refuted. 0 times theorem prover too weak. 642 trivial. 0 not checked. [2019-09-08 06:58:18,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:58:18,824 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:58:18,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:58:19,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:58:19,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 3211 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:58:19,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:58:19,812 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 459 proven. 0 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2019-09-08 06:58:19,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:58:19,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-09-08 06:58:19,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:58:19,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:58:19,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:58:19,820 INFO L87 Difference]: Start difference. First operand 86796 states and 100498 transitions. Second operand 6 states. [2019-09-08 06:58:37,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:58:37,069 INFO L93 Difference]: Finished difference Result 221346 states and 267001 transitions. [2019-09-08 06:58:37,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 06:58:37,070 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 704 [2019-09-08 06:58:37,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:58:37,462 INFO L225 Difference]: With dead ends: 221346 [2019-09-08 06:58:37,462 INFO L226 Difference]: Without dead ends: 134579 [2019-09-08 06:58:37,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 714 GetRequests, 708 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-08 06:58:37,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134579 states. [2019-09-08 06:58:55,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134579 to 130560. [2019-09-08 06:58:55,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130560 states. [2019-09-08 06:58:55,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130560 states to 130560 states and 153205 transitions. [2019-09-08 06:58:55,611 INFO L78 Accepts]: Start accepts. Automaton has 130560 states and 153205 transitions. Word has length 704 [2019-09-08 06:58:55,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:58:55,611 INFO L475 AbstractCegarLoop]: Abstraction has 130560 states and 153205 transitions. [2019-09-08 06:58:55,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:58:55,611 INFO L276 IsEmpty]: Start isEmpty. Operand 130560 states and 153205 transitions. [2019-09-08 06:58:55,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 698 [2019-09-08 06:58:55,721 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:58:55,722 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:58:55,722 INFO L418 AbstractCegarLoop]: === Iteration 61 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:58:55,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:58:55,723 INFO L82 PathProgramCache]: Analyzing trace with hash 334911647, now seen corresponding path program 1 times [2019-09-08 06:58:55,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:58:55,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:58:55,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:58:55,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:58:55,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:58:55,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:58:56,024 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 49 proven. 26 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2019-09-08 06:58:56,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:58:56,024 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:58:56,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:58:56,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:58:56,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 3149 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:58:56,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:58:56,725 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 498 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2019-09-08 06:58:56,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:58:56,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-09-08 06:58:56,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 06:58:56,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 06:58:56,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 06:58:56,733 INFO L87 Difference]: Start difference. First operand 130560 states and 153205 transitions. Second operand 9 states. [2019-09-08 06:59:16,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:59:16,126 INFO L93 Difference]: Finished difference Result 287825 states and 342103 transitions. [2019-09-08 06:59:16,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 06:59:16,127 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 697 [2019-09-08 06:59:16,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:59:16,506 INFO L225 Difference]: With dead ends: 287825 [2019-09-08 06:59:16,506 INFO L226 Difference]: Without dead ends: 157295 [2019-09-08 06:59:16,736 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 720 GetRequests, 703 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2019-09-08 06:59:16,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157295 states. [2019-09-08 06:59:38,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157295 to 154108. [2019-09-08 06:59:38,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154108 states. [2019-09-08 06:59:38,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154108 states to 154108 states and 175498 transitions. [2019-09-08 06:59:38,628 INFO L78 Accepts]: Start accepts. Automaton has 154108 states and 175498 transitions. Word has length 697 [2019-09-08 06:59:38,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:59:38,629 INFO L475 AbstractCegarLoop]: Abstraction has 154108 states and 175498 transitions. [2019-09-08 06:59:38,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 06:59:38,629 INFO L276 IsEmpty]: Start isEmpty. Operand 154108 states and 175498 transitions. [2019-09-08 06:59:38,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2019-09-08 06:59:38,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:59:38,785 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:59:38,785 INFO L418 AbstractCegarLoop]: === Iteration 62 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:59:38,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:59:38,786 INFO L82 PathProgramCache]: Analyzing trace with hash -352014053, now seen corresponding path program 1 times [2019-09-08 06:59:38,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:59:38,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:59:38,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:59:38,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:59:38,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:59:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:59:39,338 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2019-09-08 06:59:39,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:59:39,338 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:59:39,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:59:39,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:59:39,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 2428 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 06:59:39,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:59:39,982 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 219 proven. 101 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 06:59:39,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:59:39,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2019-09-08 06:59:40,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:59:40,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:59:40,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:59:40,003 INFO L87 Difference]: Start difference. First operand 154108 states and 175498 transitions. Second operand 7 states. [2019-09-08 07:00:12,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:00:12,829 INFO L93 Difference]: Finished difference Result 372999 states and 426645 transitions. [2019-09-08 07:00:12,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 07:00:12,830 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 482 [2019-09-08 07:00:12,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:00:13,801 INFO L225 Difference]: With dead ends: 372999 [2019-09-08 07:00:13,801 INFO L226 Difference]: Without dead ends: 173172 [2019-09-08 07:00:14,356 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 490 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2019-09-08 07:00:14,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173172 states. [2019-09-08 07:00:44,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173172 to 169838. [2019-09-08 07:00:44,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169838 states. [2019-09-08 07:00:44,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169838 states to 169838 states and 190510 transitions. [2019-09-08 07:00:44,784 INFO L78 Accepts]: Start accepts. Automaton has 169838 states and 190510 transitions. Word has length 482 [2019-09-08 07:00:44,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:00:44,785 INFO L475 AbstractCegarLoop]: Abstraction has 169838 states and 190510 transitions. [2019-09-08 07:00:44,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 07:00:44,785 INFO L276 IsEmpty]: Start isEmpty. Operand 169838 states and 190510 transitions. [2019-09-08 07:00:45,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 618 [2019-09-08 07:00:45,064 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:00:45,065 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:00:45,065 INFO L418 AbstractCegarLoop]: === Iteration 63 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:00:45,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:00:45,066 INFO L82 PathProgramCache]: Analyzing trace with hash -782385567, now seen corresponding path program 1 times [2019-09-08 07:00:45,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:00:45,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:00:45,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:00:45,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:00:45,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:00:45,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:00:45,890 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 25 proven. 12 refuted. 0 times theorem prover too weak. 632 trivial. 0 not checked. [2019-09-08 07:00:45,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:00:45,891 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:00:45,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:00:46,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:00:46,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 2950 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 07:00:46,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:00:46,588 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 348 proven. 0 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2019-09-08 07:00:46,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:00:46,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 07:00:46,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 07:00:46,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 07:00:46,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:00:46,597 INFO L87 Difference]: Start difference. First operand 169838 states and 190510 transitions. Second operand 6 states. [2019-09-08 07:01:49,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:01:49,327 INFO L93 Difference]: Finished difference Result 643850 states and 724190 transitions. [2019-09-08 07:01:49,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 07:01:49,327 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 617 [2019-09-08 07:01:49,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:01:50,626 INFO L225 Difference]: With dead ends: 643850 [2019-09-08 07:01:50,626 INFO L226 Difference]: Without dead ends: 392708 [2019-09-08 07:01:50,912 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 627 GetRequests, 621 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 07:01:51,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392708 states. [2019-09-08 07:02:53,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392708 to 392694. [2019-09-08 07:02:53,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392694 states. [2019-09-08 07:02:54,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392694 states to 392694 states and 442125 transitions. [2019-09-08 07:02:54,207 INFO L78 Accepts]: Start accepts. Automaton has 392694 states and 442125 transitions. Word has length 617 [2019-09-08 07:02:54,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:02:54,207 INFO L475 AbstractCegarLoop]: Abstraction has 392694 states and 442125 transitions. [2019-09-08 07:02:54,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 07:02:54,207 INFO L276 IsEmpty]: Start isEmpty. Operand 392694 states and 442125 transitions. [2019-09-08 07:02:54,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 737 [2019-09-08 07:02:54,550 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:02:54,551 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:02:54,551 INFO L418 AbstractCegarLoop]: === Iteration 64 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:02:54,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:02:54,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1649601983, now seen corresponding path program 1 times [2019-09-08 07:02:54,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:02:54,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:02:54,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:02:54,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:02:54,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:02:54,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:02:56,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1091 backedges. 25 proven. 15 refuted. 0 times theorem prover too weak. 1051 trivial. 0 not checked. [2019-09-08 07:02:56,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:02:56,083 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 07:02:56,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:02:56,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:02:56,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 3328 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 07:02:56,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:02:56,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1091 backedges. 609 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2019-09-08 07:02:56,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:02:56,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-08 07:02:56,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:02:56,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:02:56,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:02:56,891 INFO L87 Difference]: Start difference. First operand 392694 states and 442125 transitions. Second operand 5 states. [2019-09-08 07:04:35,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:04:35,117 INFO L93 Difference]: Finished difference Result 1038216 states and 1198002 transitions. [2019-09-08 07:04:35,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 07:04:35,117 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 736 [2019-09-08 07:04:35,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:04:37,081 INFO L225 Difference]: With dead ends: 1038216 [2019-09-08 07:04:37,081 INFO L226 Difference]: Without dead ends: 645604 [2019-09-08 07:04:38,620 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 752 GetRequests, 745 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 07:04:39,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645604 states. [2019-09-08 07:06:33,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645604 to 642041. [2019-09-08 07:06:33,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642041 states. [2019-09-08 07:06:37,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642041 states to 642041 states and 722232 transitions. [2019-09-08 07:06:37,185 INFO L78 Accepts]: Start accepts. Automaton has 642041 states and 722232 transitions. Word has length 736 [2019-09-08 07:06:37,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:06:37,186 INFO L475 AbstractCegarLoop]: Abstraction has 642041 states and 722232 transitions. [2019-09-08 07:06:37,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:06:37,186 INFO L276 IsEmpty]: Start isEmpty. Operand 642041 states and 722232 transitions. [2019-09-08 07:06:37,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 743 [2019-09-08 07:06:37,912 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:06:37,913 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:06:37,913 INFO L418 AbstractCegarLoop]: === Iteration 65 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:06:37,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:06:37,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1692073144, now seen corresponding path program 1 times [2019-09-08 07:06:37,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:06:37,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:06:37,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:06:37,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:06:37,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:06:37,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:06:39,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 1 proven. 84 refuted. 0 times theorem prover too weak. 1017 trivial. 0 not checked. [2019-09-08 07:06:39,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:06:39,392 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:06:39,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:06:39,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:06:39,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 3345 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 07:06:39,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:06:40,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 232 proven. 0 refuted. 0 times theorem prover too weak. 870 trivial. 0 not checked. [2019-09-08 07:06:40,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:06:40,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-08 07:06:40,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:06:40,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:06:40,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:06:40,123 INFO L87 Difference]: Start difference. First operand 642041 states and 722232 transitions. Second operand 5 states.