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/token_ring.13.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 06:50:40,359 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 06:50:40,361 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 06:50:40,375 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 06:50:40,375 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 06:50:40,376 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 06:50:40,378 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 06:50:40,379 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 06:50:40,381 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 06:50:40,382 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 06:50:40,383 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 06:50:40,384 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 06:50:40,384 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 06:50:40,385 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 06:50:40,386 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 06:50:40,387 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 06:50:40,388 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 06:50:40,389 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 06:50:40,391 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 06:50:40,393 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 06:50:40,394 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 06:50:40,395 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 06:50:40,396 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 06:50:40,397 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 06:50:40,401 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 06:50:40,401 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 06:50:40,402 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 06:50:40,402 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 06:50:40,403 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 06:50:40,404 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 06:50:40,404 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 06:50:40,405 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 06:50:40,405 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 06:50:40,406 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 06:50:40,407 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 06:50:40,407 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 06:50:40,408 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 06:50:40,408 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 06:50:40,409 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 06:50:40,410 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 06:50:40,412 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 06:50:40,413 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:50:40,434 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 06:50:40,435 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 06:50:40,436 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 06:50:40,437 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 06:50:40,437 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 06:50:40,438 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 06:50:40,438 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 06:50:40,438 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 06:50:40,438 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 06:50:40,438 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 06:50:40,439 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 06:50:40,439 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 06:50:40,440 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 06:50:40,440 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 06:50:40,440 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 06:50:40,441 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 06:50:40,441 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 06:50:40,441 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 06:50:40,441 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 06:50:40,442 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 06:50:40,442 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 06:50:40,442 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 06:50:40,442 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 06:50:40,442 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 06:50:40,443 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 06:50:40,443 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 06:50:40,443 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 06:50:40,443 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 06:50:40,443 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 06:50:40,473 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 06:50:40,484 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 06:50:40,487 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 06:50:40,489 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 06:50:40,489 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 06:50:40,490 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.13.cil-2.c [2019-09-08 06:50:40,556 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e0d803d6/46ef61696d6f417d804eac7ffa68d6c9/FLAG08925e0f4 [2019-09-08 06:50:41,034 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 06:50:41,035 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.13.cil-2.c [2019-09-08 06:50:41,061 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e0d803d6/46ef61696d6f417d804eac7ffa68d6c9/FLAG08925e0f4 [2019-09-08 06:50:41,384 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e0d803d6/46ef61696d6f417d804eac7ffa68d6c9 [2019-09-08 06:50:41,392 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 06:50:41,394 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 06:50:41,395 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 06:50:41,396 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 06:50:41,399 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 06:50:41,400 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:50:41" (1/1) ... [2019-09-08 06:50:41,402 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@151681b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:50:41, skipping insertion in model container [2019-09-08 06:50:41,403 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:50:41" (1/1) ... [2019-09-08 06:50:41,410 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 06:50:41,472 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 06:50:41,919 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:50:41,931 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 06:50:42,044 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:50:42,085 INFO L192 MainTranslator]: Completed translation [2019-09-08 06:50:42,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:50:42 WrapperNode [2019-09-08 06:50:42,086 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 06:50:42,087 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 06:50:42,087 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 06:50:42,088 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 06:50:42,101 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:50:42" (1/1) ... [2019-09-08 06:50:42,102 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:50:42" (1/1) ... [2019-09-08 06:50:42,126 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:50:42" (1/1) ... [2019-09-08 06:50:42,127 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:50:42" (1/1) ... [2019-09-08 06:50:42,169 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:50:42" (1/1) ... [2019-09-08 06:50:42,195 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:50:42" (1/1) ... [2019-09-08 06:50:42,200 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:50:42" (1/1) ... [2019-09-08 06:50:42,209 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 06:50:42,210 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 06:50:42,210 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 06:50:42,210 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 06:50:42,211 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:50:42" (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:50:42,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 06:50:42,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 06:50:42,299 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-09-08 06:50:42,300 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-09-08 06:50:42,300 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-09-08 06:50:42,301 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-09-08 06:50:42,301 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-09-08 06:50:42,301 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit4 [2019-09-08 06:50:42,301 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit5 [2019-09-08 06:50:42,301 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit6 [2019-09-08 06:50:42,302 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit7 [2019-09-08 06:50:42,302 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit8 [2019-09-08 06:50:42,302 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit9 [2019-09-08 06:50:42,302 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit10 [2019-09-08 06:50:42,303 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit11 [2019-09-08 06:50:42,303 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit12 [2019-09-08 06:50:42,305 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit13 [2019-09-08 06:50:42,306 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-09-08 06:50:42,306 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-09-08 06:50:42,306 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-09-08 06:50:42,306 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-09-08 06:50:42,306 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit4_triggered [2019-09-08 06:50:42,307 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit5_triggered [2019-09-08 06:50:42,307 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit6_triggered [2019-09-08 06:50:42,307 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit7_triggered [2019-09-08 06:50:42,307 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit8_triggered [2019-09-08 06:50:42,307 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit9_triggered [2019-09-08 06:50:42,307 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit10_triggered [2019-09-08 06:50:42,307 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit11_triggered [2019-09-08 06:50:42,308 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit12_triggered [2019-09-08 06:50:42,308 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit13_triggered [2019-09-08 06:50:42,308 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-09-08 06:50:42,308 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-09-08 06:50:42,308 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-09-08 06:50:42,309 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-09-08 06:50:42,309 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-09-08 06:50:42,309 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-09-08 06:50:42,309 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-09-08 06:50:42,309 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-09-08 06:50:42,309 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-09-08 06:50:42,310 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-09-08 06:50:42,310 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-09-08 06:50:42,310 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-09-08 06:50:42,310 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-09-08 06:50:42,311 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 06:50:42,311 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 06:50:42,311 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-09-08 06:50:42,311 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-09-08 06:50:42,311 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-09-08 06:50:42,311 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-09-08 06:50:42,311 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-09-08 06:50:42,312 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit4_triggered [2019-09-08 06:50:42,312 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit5_triggered [2019-09-08 06:50:42,312 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit6_triggered [2019-09-08 06:50:42,312 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit7_triggered [2019-09-08 06:50:42,312 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit8_triggered [2019-09-08 06:50:42,312 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit9_triggered [2019-09-08 06:50:42,313 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit10_triggered [2019-09-08 06:50:42,313 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit11_triggered [2019-09-08 06:50:42,313 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit12_triggered [2019-09-08 06:50:42,313 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit13_triggered [2019-09-08 06:50:42,313 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-09-08 06:50:42,313 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 06:50:42,313 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-09-08 06:50:42,314 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-09-08 06:50:42,314 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-09-08 06:50:42,314 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-09-08 06:50:42,314 INFO L130 BoogieDeclarations]: Found specification of procedure transmit4 [2019-09-08 06:50:42,314 INFO L130 BoogieDeclarations]: Found specification of procedure transmit5 [2019-09-08 06:50:42,315 INFO L130 BoogieDeclarations]: Found specification of procedure transmit6 [2019-09-08 06:50:42,315 INFO L130 BoogieDeclarations]: Found specification of procedure transmit7 [2019-09-08 06:50:42,315 INFO L130 BoogieDeclarations]: Found specification of procedure transmit8 [2019-09-08 06:50:42,315 INFO L130 BoogieDeclarations]: Found specification of procedure transmit9 [2019-09-08 06:50:42,315 INFO L130 BoogieDeclarations]: Found specification of procedure transmit10 [2019-09-08 06:50:42,316 INFO L130 BoogieDeclarations]: Found specification of procedure transmit11 [2019-09-08 06:50:42,316 INFO L130 BoogieDeclarations]: Found specification of procedure transmit12 [2019-09-08 06:50:42,316 INFO L130 BoogieDeclarations]: Found specification of procedure transmit13 [2019-09-08 06:50:42,316 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-09-08 06:50:42,317 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-09-08 06:50:42,317 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-09-08 06:50:42,317 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-09-08 06:50:42,317 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-09-08 06:50:42,318 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-09-08 06:50:42,318 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-09-08 06:50:42,318 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-09-08 06:50:42,318 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-09-08 06:50:42,318 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-09-08 06:50:42,319 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-09-08 06:50:42,319 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-09-08 06:50:42,319 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 06:50:42,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 06:50:42,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 06:50:43,630 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 06:50:43,630 INFO L283 CfgBuilder]: Removed 16 assume(true) statements. [2019-09-08 06:50:43,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:50:43 BoogieIcfgContainer [2019-09-08 06:50:43,632 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 06:50:43,633 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 06:50:43,633 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 06:50:43,636 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 06:50:43,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 06:50:41" (1/3) ... [2019-09-08 06:50:43,638 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34bba647 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:50:43, skipping insertion in model container [2019-09-08 06:50:43,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:50:42" (2/3) ... [2019-09-08 06:50:43,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34bba647 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:50:43, skipping insertion in model container [2019-09-08 06:50:43,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:50:43" (3/3) ... [2019-09-08 06:50:43,641 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.13.cil-2.c [2019-09-08 06:50:43,651 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 06:50:43,660 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 06:50:43,677 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 06:50:43,717 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 06:50:43,718 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 06:50:43,718 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 06:50:43,718 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 06:50:43,719 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 06:50:43,719 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 06:50:43,719 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 06:50:43,719 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 06:50:43,720 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 06:50:43,772 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states. [2019-09-08 06:50:43,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-08 06:50:43,814 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:50:43,819 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:50:43,822 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:50:43,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:50:43,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1935396934, now seen corresponding path program 1 times [2019-09-08 06:50:43,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:50:43,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:50:43,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:43,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:43,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:44,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:44,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:50:44,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:50:44,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:50:44,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:50:44,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:50:44,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:50:44,503 INFO L87 Difference]: Start difference. First operand 504 states. Second operand 4 states. [2019-09-08 06:50:44,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:50:44,934 INFO L93 Difference]: Finished difference Result 986 states and 1529 transitions. [2019-09-08 06:50:44,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:50:44,936 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 245 [2019-09-08 06:50:44,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:50:44,955 INFO L225 Difference]: With dead ends: 986 [2019-09-08 06:50:44,956 INFO L226 Difference]: Without dead ends: 495 [2019-09-08 06:50:44,963 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:50:44,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2019-09-08 06:50:45,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 495. [2019-09-08 06:50:45,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-08 06:50:45,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 728 transitions. [2019-09-08 06:50:45,089 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 728 transitions. Word has length 245 [2019-09-08 06:50:45,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:50:45,094 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 728 transitions. [2019-09-08 06:50:45,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:50:45,094 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 728 transitions. [2019-09-08 06:50:45,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-08 06:50:45,104 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:50:45,105 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:50:45,105 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:50:45,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:50:45,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1272610812, now seen corresponding path program 1 times [2019-09-08 06:50:45,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:50:45,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:50:45,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:45,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:45,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:45,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:45,452 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:50:45,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:50:45,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:50:45,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:50:45,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:50:45,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:50:45,459 INFO L87 Difference]: Start difference. First operand 495 states and 728 transitions. Second operand 4 states. [2019-09-08 06:50:45,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:50:45,785 INFO L93 Difference]: Finished difference Result 962 states and 1414 transitions. [2019-09-08 06:50:45,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:50:45,785 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 245 [2019-09-08 06:50:45,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:50:45,790 INFO L225 Difference]: With dead ends: 962 [2019-09-08 06:50:45,790 INFO L226 Difference]: Without dead ends: 495 [2019-09-08 06:50:45,792 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:50:45,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2019-09-08 06:50:45,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 495. [2019-09-08 06:50:45,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-08 06:50:45,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 727 transitions. [2019-09-08 06:50:45,829 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 727 transitions. Word has length 245 [2019-09-08 06:50:45,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:50:45,829 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 727 transitions. [2019-09-08 06:50:45,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:50:45,830 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 727 transitions. [2019-09-08 06:50:45,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-08 06:50:45,833 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:50:45,834 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:50:45,834 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:50:45,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:50:45,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1329476158, now seen corresponding path program 1 times [2019-09-08 06:50:45,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:50:45,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:50:45,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:45,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:45,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:45,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:46,046 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:50:46,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:50:46,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:50:46,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:50:46,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:50:46,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:50:46,048 INFO L87 Difference]: Start difference. First operand 495 states and 727 transitions. Second operand 5 states. [2019-09-08 06:50:47,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:50:47,103 INFO L93 Difference]: Finished difference Result 1033 states and 1551 transitions. [2019-09-08 06:50:47,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:50:47,104 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2019-09-08 06:50:47,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:50:47,110 INFO L225 Difference]: With dead ends: 1033 [2019-09-08 06:50:47,110 INFO L226 Difference]: Without dead ends: 569 [2019-09-08 06:50:47,112 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:50:47,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2019-09-08 06:50:47,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 495. [2019-09-08 06:50:47,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-08 06:50:47,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 726 transitions. [2019-09-08 06:50:47,152 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 726 transitions. Word has length 245 [2019-09-08 06:50:47,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:50:47,152 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 726 transitions. [2019-09-08 06:50:47,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:50:47,153 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 726 transitions. [2019-09-08 06:50:47,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-08 06:50:47,159 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:50:47,159 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:50:47,160 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:50:47,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:50:47,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1060310780, now seen corresponding path program 1 times [2019-09-08 06:50:47,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:50:47,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:50:47,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:47,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:47,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:47,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:47,347 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:50:47,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:50:47,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:50:47,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:50:47,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:50:47,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:50:47,349 INFO L87 Difference]: Start difference. First operand 495 states and 726 transitions. Second operand 5 states. [2019-09-08 06:50:48,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:50:48,367 INFO L93 Difference]: Finished difference Result 1033 states and 1550 transitions. [2019-09-08 06:50:48,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:50:48,368 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2019-09-08 06:50:48,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:50:48,376 INFO L225 Difference]: With dead ends: 1033 [2019-09-08 06:50:48,376 INFO L226 Difference]: Without dead ends: 569 [2019-09-08 06:50:48,379 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:50:48,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2019-09-08 06:50:48,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 495. [2019-09-08 06:50:48,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-08 06:50:48,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 725 transitions. [2019-09-08 06:50:48,435 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 725 transitions. Word has length 245 [2019-09-08 06:50:48,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:50:48,436 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 725 transitions. [2019-09-08 06:50:48,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:50:48,436 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 725 transitions. [2019-09-08 06:50:48,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-08 06:50:48,443 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:50:48,444 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:50:48,444 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:50:48,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:50:48,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1190175358, now seen corresponding path program 1 times [2019-09-08 06:50:48,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:50:48,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:50:48,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:48,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:48,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:48,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:48,735 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:50:48,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:50:48,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:50:48,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:50:48,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:50:48,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:50:48,739 INFO L87 Difference]: Start difference. First operand 495 states and 725 transitions. Second operand 5 states. [2019-09-08 06:50:50,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:50:50,029 INFO L93 Difference]: Finished difference Result 1031 states and 1544 transitions. [2019-09-08 06:50:50,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:50:50,030 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2019-09-08 06:50:50,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:50:50,036 INFO L225 Difference]: With dead ends: 1031 [2019-09-08 06:50:50,036 INFO L226 Difference]: Without dead ends: 567 [2019-09-08 06:50:50,038 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:50:50,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2019-09-08 06:50:50,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 495. [2019-09-08 06:50:50,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-08 06:50:50,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 724 transitions. [2019-09-08 06:50:50,086 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 724 transitions. Word has length 245 [2019-09-08 06:50:50,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:50:50,086 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 724 transitions. [2019-09-08 06:50:50,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:50:50,087 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 724 transitions. [2019-09-08 06:50:50,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-08 06:50:50,092 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:50:50,093 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:50:50,093 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:50:50,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:50:50,094 INFO L82 PathProgramCache]: Analyzing trace with hash -883845444, now seen corresponding path program 1 times [2019-09-08 06:50:50,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:50:50,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:50:50,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:50,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:50,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:50,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:50,272 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:50:50,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:50:50,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:50:50,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:50:50,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:50:50,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:50:50,274 INFO L87 Difference]: Start difference. First operand 495 states and 724 transitions. Second operand 5 states. [2019-09-08 06:50:51,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:50:51,207 INFO L93 Difference]: Finished difference Result 1029 states and 1538 transitions. [2019-09-08 06:50:51,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:50:51,207 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2019-09-08 06:50:51,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:50:51,212 INFO L225 Difference]: With dead ends: 1029 [2019-09-08 06:50:51,212 INFO L226 Difference]: Without dead ends: 565 [2019-09-08 06:50:51,214 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:50:51,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2019-09-08 06:50:51,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 495. [2019-09-08 06:50:51,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-08 06:50:51,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 723 transitions. [2019-09-08 06:50:51,249 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 723 transitions. Word has length 245 [2019-09-08 06:50:51,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:50:51,250 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 723 transitions. [2019-09-08 06:50:51,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:50:51,250 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 723 transitions. [2019-09-08 06:50:51,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-08 06:50:51,254 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:50:51,254 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:50:51,255 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:50:51,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:50:51,255 INFO L82 PathProgramCache]: Analyzing trace with hash 2097291966, now seen corresponding path program 1 times [2019-09-08 06:50:51,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:50:51,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:50:51,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:51,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:51,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:51,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:51,393 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:50:51,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:50:51,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:50:51,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:50:51,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:50:51,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:50:51,396 INFO L87 Difference]: Start difference. First operand 495 states and 723 transitions. Second operand 5 states. [2019-09-08 06:50:52,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:50:52,354 INFO L93 Difference]: Finished difference Result 1027 states and 1532 transitions. [2019-09-08 06:50:52,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:50:52,355 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2019-09-08 06:50:52,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:50:52,359 INFO L225 Difference]: With dead ends: 1027 [2019-09-08 06:50:52,360 INFO L226 Difference]: Without dead ends: 563 [2019-09-08 06:50:52,362 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:50:52,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2019-09-08 06:50:52,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 495. [2019-09-08 06:50:52,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-08 06:50:52,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 722 transitions. [2019-09-08 06:50:52,405 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 722 transitions. Word has length 245 [2019-09-08 06:50:52,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:50:52,442 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 722 transitions. [2019-09-08 06:50:52,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:50:52,444 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 722 transitions. [2019-09-08 06:50:52,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-08 06:50:52,448 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:50:52,449 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:50:52,449 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:50:52,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:50:52,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1223626364, now seen corresponding path program 1 times [2019-09-08 06:50:52,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:50:52,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:50:52,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:52,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:52,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:52,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:52,583 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:50:52,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:50:52,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:50:52,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:50:52,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:50:52,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:50:52,586 INFO L87 Difference]: Start difference. First operand 495 states and 722 transitions. Second operand 5 states. [2019-09-08 06:50:53,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:50:53,478 INFO L93 Difference]: Finished difference Result 1025 states and 1526 transitions. [2019-09-08 06:50:53,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:50:53,478 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2019-09-08 06:50:53,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:50:53,483 INFO L225 Difference]: With dead ends: 1025 [2019-09-08 06:50:53,484 INFO L226 Difference]: Without dead ends: 561 [2019-09-08 06:50:53,486 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:50:53,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-09-08 06:50:53,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 495. [2019-09-08 06:50:53,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-08 06:50:53,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 721 transitions. [2019-09-08 06:50:53,521 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 721 transitions. Word has length 245 [2019-09-08 06:50:53,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:50:53,521 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 721 transitions. [2019-09-08 06:50:53,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:50:53,522 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 721 transitions. [2019-09-08 06:50:53,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-08 06:50:53,525 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:50:53,525 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:50:53,526 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:50:53,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:50:53,526 INFO L82 PathProgramCache]: Analyzing trace with hash 502706942, now seen corresponding path program 1 times [2019-09-08 06:50:53,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:50:53,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:50:53,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:53,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:53,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:53,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:53,693 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:50:53,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:50:53,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:50:53,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:50:53,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:50:53,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:50:53,696 INFO L87 Difference]: Start difference. First operand 495 states and 721 transitions. Second operand 5 states. [2019-09-08 06:50:54,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:50:54,608 INFO L93 Difference]: Finished difference Result 1021 states and 1516 transitions. [2019-09-08 06:50:54,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:50:54,608 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2019-09-08 06:50:54,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:50:54,616 INFO L225 Difference]: With dead ends: 1021 [2019-09-08 06:50:54,617 INFO L226 Difference]: Without dead ends: 557 [2019-09-08 06:50:54,619 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:50:54,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2019-09-08 06:50:54,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 495. [2019-09-08 06:50:54,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-08 06:50:54,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 720 transitions. [2019-09-08 06:50:54,664 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 720 transitions. Word has length 245 [2019-09-08 06:50:54,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:50:54,665 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 720 transitions. [2019-09-08 06:50:54,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:50:54,665 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 720 transitions. [2019-09-08 06:50:54,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-08 06:50:54,669 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:50:54,669 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:50:54,669 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:50:54,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:50:54,670 INFO L82 PathProgramCache]: Analyzing trace with hash -633237504, now seen corresponding path program 1 times [2019-09-08 06:50:54,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:50:54,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:50:54,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:54,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:54,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:54,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:54,829 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:50:54,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:50:54,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:50:54,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:50:54,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:50:54,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:50:54,831 INFO L87 Difference]: Start difference. First operand 495 states and 720 transitions. Second operand 5 states. [2019-09-08 06:50:55,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:50:55,880 INFO L93 Difference]: Finished difference Result 1019 states and 1510 transitions. [2019-09-08 06:50:55,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:50:55,880 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2019-09-08 06:50:55,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:50:55,884 INFO L225 Difference]: With dead ends: 1019 [2019-09-08 06:50:55,884 INFO L226 Difference]: Without dead ends: 555 [2019-09-08 06:50:55,886 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:50:55,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-09-08 06:50:55,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 495. [2019-09-08 06:50:55,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-08 06:50:55,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 719 transitions. [2019-09-08 06:50:55,919 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 719 transitions. Word has length 245 [2019-09-08 06:50:55,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:50:55,920 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 719 transitions. [2019-09-08 06:50:55,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:50:55,920 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 719 transitions. [2019-09-08 06:50:55,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-08 06:50:55,922 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:50:55,922 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:50:55,922 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:50:55,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:50:55,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1501164866, now seen corresponding path program 1 times [2019-09-08 06:50:55,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:50:55,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:50:55,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:55,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:55,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:55,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:56,039 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:50:56,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:50:56,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:50:56,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:50:56,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:50:56,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:50:56,041 INFO L87 Difference]: Start difference. First operand 495 states and 719 transitions. Second operand 5 states. [2019-09-08 06:50:56,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:50:56,990 INFO L93 Difference]: Finished difference Result 1017 states and 1504 transitions. [2019-09-08 06:50:56,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:50:56,990 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2019-09-08 06:50:56,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:50:56,994 INFO L225 Difference]: With dead ends: 1017 [2019-09-08 06:50:56,995 INFO L226 Difference]: Without dead ends: 553 [2019-09-08 06:50:56,996 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:50:56,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2019-09-08 06:50:57,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 495. [2019-09-08 06:50:57,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-08 06:50:57,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 718 transitions. [2019-09-08 06:50:57,031 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 718 transitions. Word has length 245 [2019-09-08 06:50:57,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:50:57,032 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 718 transitions. [2019-09-08 06:50:57,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:50:57,032 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 718 transitions. [2019-09-08 06:50:57,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-08 06:50:57,034 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:50:57,035 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:50:57,035 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:50:57,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:50:57,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1518878784, now seen corresponding path program 1 times [2019-09-08 06:50:57,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:50:57,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:50:57,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:57,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:57,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:57,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:57,203 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:50:57,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:50:57,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:50:57,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:50:57,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:50:57,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:50:57,205 INFO L87 Difference]: Start difference. First operand 495 states and 718 transitions. Second operand 5 states. [2019-09-08 06:50:58,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:50:58,312 INFO L93 Difference]: Finished difference Result 1015 states and 1498 transitions. [2019-09-08 06:50:58,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:50:58,313 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2019-09-08 06:50:58,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:50:58,320 INFO L225 Difference]: With dead ends: 1015 [2019-09-08 06:50:58,321 INFO L226 Difference]: Without dead ends: 551 [2019-09-08 06:50:58,323 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:50:58,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2019-09-08 06:50:58,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 495. [2019-09-08 06:50:58,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-08 06:50:58,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 717 transitions. [2019-09-08 06:50:58,386 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 717 transitions. Word has length 245 [2019-09-08 06:50:58,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:50:58,386 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 717 transitions. [2019-09-08 06:50:58,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:50:58,387 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 717 transitions. [2019-09-08 06:50:58,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-08 06:50:58,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:50:58,390 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:50:58,391 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:50:58,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:50:58,391 INFO L82 PathProgramCache]: Analyzing trace with hash 646468222, now seen corresponding path program 1 times [2019-09-08 06:50:58,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:50:58,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:50:58,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:58,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:58,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:58,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:58,623 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:50:58,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:50:58,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:50:58,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:50:58,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:50:58,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:50:58,627 INFO L87 Difference]: Start difference. First operand 495 states and 717 transitions. Second operand 5 states. [2019-09-08 06:50:59,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:50:59,831 INFO L93 Difference]: Finished difference Result 1013 states and 1492 transitions. [2019-09-08 06:50:59,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:50:59,831 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2019-09-08 06:50:59,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:50:59,835 INFO L225 Difference]: With dead ends: 1013 [2019-09-08 06:50:59,836 INFO L226 Difference]: Without dead ends: 549 [2019-09-08 06:50:59,838 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:50:59,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2019-09-08 06:50:59,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 495. [2019-09-08 06:50:59,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-08 06:50:59,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 716 transitions. [2019-09-08 06:50:59,902 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 716 transitions. Word has length 245 [2019-09-08 06:50:59,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:50:59,902 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 716 transitions. [2019-09-08 06:50:59,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:50:59,903 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 716 transitions. [2019-09-08 06:50:59,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-08 06:50:59,904 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:50:59,905 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:50:59,905 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:50:59,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:50:59,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1321336704, now seen corresponding path program 1 times [2019-09-08 06:50:59,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:50:59,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:50:59,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:59,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:59,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:59,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:00,026 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:51:00,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:00,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:00,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:00,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:00,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:00,028 INFO L87 Difference]: Start difference. First operand 495 states and 716 transitions. Second operand 5 states. [2019-09-08 06:51:00,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:00,956 INFO L93 Difference]: Finished difference Result 1011 states and 1486 transitions. [2019-09-08 06:51:00,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:00,957 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2019-09-08 06:51:00,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:00,961 INFO L225 Difference]: With dead ends: 1011 [2019-09-08 06:51:00,961 INFO L226 Difference]: Without dead ends: 547 [2019-09-08 06:51:00,963 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:51:00,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2019-09-08 06:51:00,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 495. [2019-09-08 06:51:00,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-08 06:51:00,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 715 transitions. [2019-09-08 06:51:00,999 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 715 transitions. Word has length 245 [2019-09-08 06:51:01,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:01,000 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 715 transitions. [2019-09-08 06:51:01,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:01,000 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 715 transitions. [2019-09-08 06:51:01,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-08 06:51:01,002 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:01,002 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:01,002 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:01,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:01,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1107719618, now seen corresponding path program 1 times [2019-09-08 06:51:01,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:01,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:01,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:01,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:01,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:01,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:01,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:51:01,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:01,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:01,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:01,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:01,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:01,115 INFO L87 Difference]: Start difference. First operand 495 states and 715 transitions. Second operand 5 states. [2019-09-08 06:51:02,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:02,117 INFO L93 Difference]: Finished difference Result 1009 states and 1480 transitions. [2019-09-08 06:51:02,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:02,117 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2019-09-08 06:51:02,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:02,121 INFO L225 Difference]: With dead ends: 1009 [2019-09-08 06:51:02,121 INFO L226 Difference]: Without dead ends: 545 [2019-09-08 06:51:02,126 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:51:02,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2019-09-08 06:51:02,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 495. [2019-09-08 06:51:02,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-08 06:51:02,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 714 transitions. [2019-09-08 06:51:02,167 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 714 transitions. Word has length 245 [2019-09-08 06:51:02,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:02,167 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 714 transitions. [2019-09-08 06:51:02,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:02,167 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 714 transitions. [2019-09-08 06:51:02,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-08 06:51:02,169 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:02,169 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:02,170 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:02,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:02,170 INFO L82 PathProgramCache]: Analyzing trace with hash -823734080, now seen corresponding path program 1 times [2019-09-08 06:51:02,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:02,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:02,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:02,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:02,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:02,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:02,298 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:51:02,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:02,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:02,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:02,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:02,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:02,302 INFO L87 Difference]: Start difference. First operand 495 states and 714 transitions. Second operand 5 states. [2019-09-08 06:51:03,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:03,178 INFO L93 Difference]: Finished difference Result 1053 states and 1563 transitions. [2019-09-08 06:51:03,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:03,178 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2019-09-08 06:51:03,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:03,183 INFO L225 Difference]: With dead ends: 1053 [2019-09-08 06:51:03,183 INFO L226 Difference]: Without dead ends: 589 [2019-09-08 06:51:03,185 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:51:03,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-09-08 06:51:03,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 495. [2019-09-08 06:51:03,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-08 06:51:03,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 713 transitions. [2019-09-08 06:51:03,226 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 713 transitions. Word has length 245 [2019-09-08 06:51:03,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:03,226 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 713 transitions. [2019-09-08 06:51:03,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:03,226 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 713 transitions. [2019-09-08 06:51:03,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-08 06:51:03,228 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:03,228 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:03,229 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:03,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:03,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1746390978, now seen corresponding path program 1 times [2019-09-08 06:51:03,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:03,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:03,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:03,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:03,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:03,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:03,341 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:51:03,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:03,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:03,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:03,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:03,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:03,343 INFO L87 Difference]: Start difference. First operand 495 states and 713 transitions. Second operand 5 states. [2019-09-08 06:51:04,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:04,324 INFO L93 Difference]: Finished difference Result 1055 states and 1562 transitions. [2019-09-08 06:51:04,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:04,325 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2019-09-08 06:51:04,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:04,329 INFO L225 Difference]: With dead ends: 1055 [2019-09-08 06:51:04,330 INFO L226 Difference]: Without dead ends: 591 [2019-09-08 06:51:04,331 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:51:04,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-09-08 06:51:04,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 495. [2019-09-08 06:51:04,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-08 06:51:04,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 712 transitions. [2019-09-08 06:51:04,372 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 712 transitions. Word has length 245 [2019-09-08 06:51:04,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:04,373 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 712 transitions. [2019-09-08 06:51:04,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:04,373 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 712 transitions. [2019-09-08 06:51:04,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-08 06:51:04,374 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:04,375 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:04,375 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:04,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:04,375 INFO L82 PathProgramCache]: Analyzing trace with hash -248911744, now seen corresponding path program 1 times [2019-09-08 06:51:04,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:04,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:04,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:04,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:04,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:04,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:04,482 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:51:04,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:04,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:04,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:04,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:04,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:04,484 INFO L87 Difference]: Start difference. First operand 495 states and 712 transitions. Second operand 5 states. [2019-09-08 06:51:05,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:05,393 INFO L93 Difference]: Finished difference Result 1053 states and 1556 transitions. [2019-09-08 06:51:05,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:05,394 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2019-09-08 06:51:05,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:05,398 INFO L225 Difference]: With dead ends: 1053 [2019-09-08 06:51:05,398 INFO L226 Difference]: Without dead ends: 589 [2019-09-08 06:51:05,400 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:51:05,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-09-08 06:51:05,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 495. [2019-09-08 06:51:05,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-08 06:51:05,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 711 transitions. [2019-09-08 06:51:05,441 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 711 transitions. Word has length 245 [2019-09-08 06:51:05,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:05,442 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 711 transitions. [2019-09-08 06:51:05,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:05,442 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 711 transitions. [2019-09-08 06:51:05,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-08 06:51:05,444 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:05,444 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:05,444 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:05,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:05,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1764933634, now seen corresponding path program 1 times [2019-09-08 06:51:05,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:05,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:05,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:05,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:05,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:05,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:05,545 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:51:05,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:05,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:05,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:05,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:05,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:05,547 INFO L87 Difference]: Start difference. First operand 495 states and 711 transitions. Second operand 5 states. [2019-09-08 06:51:06,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:06,406 INFO L93 Difference]: Finished difference Result 1051 states and 1550 transitions. [2019-09-08 06:51:06,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:06,406 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2019-09-08 06:51:06,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:06,411 INFO L225 Difference]: With dead ends: 1051 [2019-09-08 06:51:06,411 INFO L226 Difference]: Without dead ends: 587 [2019-09-08 06:51:06,414 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:51:06,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-09-08 06:51:06,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 495. [2019-09-08 06:51:06,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-08 06:51:06,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 710 transitions. [2019-09-08 06:51:06,459 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 710 transitions. Word has length 245 [2019-09-08 06:51:06,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:06,459 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 710 transitions. [2019-09-08 06:51:06,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:06,460 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 710 transitions. [2019-09-08 06:51:06,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-08 06:51:06,461 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:06,461 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:06,462 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:06,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:06,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1691349056, now seen corresponding path program 1 times [2019-09-08 06:51:06,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:06,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:06,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:06,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:06,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:06,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:06,581 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:51:06,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:06,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:06,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:06,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:06,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:06,583 INFO L87 Difference]: Start difference. First operand 495 states and 710 transitions. Second operand 5 states. [2019-09-08 06:51:07,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:07,521 INFO L93 Difference]: Finished difference Result 1049 states and 1544 transitions. [2019-09-08 06:51:07,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:07,522 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2019-09-08 06:51:07,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:07,525 INFO L225 Difference]: With dead ends: 1049 [2019-09-08 06:51:07,526 INFO L226 Difference]: Without dead ends: 585 [2019-09-08 06:51:07,527 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:51:07,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2019-09-08 06:51:07,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 495. [2019-09-08 06:51:07,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-08 06:51:07,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 709 transitions. [2019-09-08 06:51:07,573 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 709 transitions. Word has length 245 [2019-09-08 06:51:07,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:07,573 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 709 transitions. [2019-09-08 06:51:07,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:07,574 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 709 transitions. [2019-09-08 06:51:07,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-08 06:51:07,575 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:07,575 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:07,576 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:07,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:07,576 INFO L82 PathProgramCache]: Analyzing trace with hash -389234622, now seen corresponding path program 1 times [2019-09-08 06:51:07,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:07,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:07,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:07,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:07,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:07,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:07,677 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:51:07,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:07,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:07,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:07,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:07,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:07,680 INFO L87 Difference]: Start difference. First operand 495 states and 709 transitions. Second operand 5 states. [2019-09-08 06:51:08,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:08,619 INFO L93 Difference]: Finished difference Result 1047 states and 1538 transitions. [2019-09-08 06:51:08,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:08,620 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2019-09-08 06:51:08,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:08,624 INFO L225 Difference]: With dead ends: 1047 [2019-09-08 06:51:08,624 INFO L226 Difference]: Without dead ends: 583 [2019-09-08 06:51:08,626 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:51:08,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-09-08 06:51:08,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 495. [2019-09-08 06:51:08,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-08 06:51:08,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 708 transitions. [2019-09-08 06:51:08,672 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 708 transitions. Word has length 245 [2019-09-08 06:51:08,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:08,672 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 708 transitions. [2019-09-08 06:51:08,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:08,673 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 708 transitions. [2019-09-08 06:51:08,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-08 06:51:08,674 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:08,674 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:08,675 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:08,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:08,675 INFO L82 PathProgramCache]: Analyzing trace with hash 97839104, now seen corresponding path program 1 times [2019-09-08 06:51:08,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:08,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:08,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:08,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:08,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:08,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:08,782 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:51:08,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:08,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:08,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:08,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:08,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:08,783 INFO L87 Difference]: Start difference. First operand 495 states and 708 transitions. Second operand 5 states. [2019-09-08 06:51:09,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:09,917 INFO L93 Difference]: Finished difference Result 1045 states and 1532 transitions. [2019-09-08 06:51:09,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:09,923 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2019-09-08 06:51:09,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:09,927 INFO L225 Difference]: With dead ends: 1045 [2019-09-08 06:51:09,927 INFO L226 Difference]: Without dead ends: 581 [2019-09-08 06:51:09,929 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:51:09,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2019-09-08 06:51:09,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 495. [2019-09-08 06:51:09,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-08 06:51:09,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 707 transitions. [2019-09-08 06:51:09,978 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 707 transitions. Word has length 245 [2019-09-08 06:51:09,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:09,978 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 707 transitions. [2019-09-08 06:51:09,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:09,979 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 707 transitions. [2019-09-08 06:51:09,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-08 06:51:09,980 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:09,981 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:09,981 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:09,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:09,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1687564158, now seen corresponding path program 1 times [2019-09-08 06:51:09,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:09,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:09,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:09,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:09,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:10,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:10,107 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:51:10,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:10,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:10,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:10,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:10,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:10,109 INFO L87 Difference]: Start difference. First operand 495 states and 707 transitions. Second operand 5 states. [2019-09-08 06:51:11,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:11,044 INFO L93 Difference]: Finished difference Result 1041 states and 1522 transitions. [2019-09-08 06:51:11,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:11,044 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2019-09-08 06:51:11,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:11,048 INFO L225 Difference]: With dead ends: 1041 [2019-09-08 06:51:11,048 INFO L226 Difference]: Without dead ends: 577 [2019-09-08 06:51:11,050 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:51:11,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-09-08 06:51:11,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 495. [2019-09-08 06:51:11,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-08 06:51:11,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 706 transitions. [2019-09-08 06:51:11,101 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 706 transitions. Word has length 245 [2019-09-08 06:51:11,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:11,101 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 706 transitions. [2019-09-08 06:51:11,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:11,101 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 706 transitions. [2019-09-08 06:51:11,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-08 06:51:11,105 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:11,105 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:11,106 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:11,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:11,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1564282492, now seen corresponding path program 1 times [2019-09-08 06:51:11,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:11,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:11,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:11,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:11,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:11,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:11,232 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:51:11,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:11,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:11,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:11,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:11,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:11,236 INFO L87 Difference]: Start difference. First operand 495 states and 706 transitions. Second operand 5 states. [2019-09-08 06:51:12,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:12,161 INFO L93 Difference]: Finished difference Result 1039 states and 1516 transitions. [2019-09-08 06:51:12,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:12,162 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2019-09-08 06:51:12,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:12,166 INFO L225 Difference]: With dead ends: 1039 [2019-09-08 06:51:12,166 INFO L226 Difference]: Without dead ends: 575 [2019-09-08 06:51:12,167 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:51:12,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2019-09-08 06:51:12,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 495. [2019-09-08 06:51:12,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-08 06:51:12,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 705 transitions. [2019-09-08 06:51:12,220 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 705 transitions. Word has length 245 [2019-09-08 06:51:12,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:12,221 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 705 transitions. [2019-09-08 06:51:12,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:12,221 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 705 transitions. [2019-09-08 06:51:12,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-08 06:51:12,222 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:12,223 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:12,223 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:12,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:12,223 INFO L82 PathProgramCache]: Analyzing trace with hash 656451650, now seen corresponding path program 1 times [2019-09-08 06:51:12,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:12,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:12,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:12,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:12,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:12,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:12,328 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:51:12,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:12,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:12,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:12,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:12,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:12,330 INFO L87 Difference]: Start difference. First operand 495 states and 705 transitions. Second operand 5 states. [2019-09-08 06:51:13,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:13,249 INFO L93 Difference]: Finished difference Result 1037 states and 1510 transitions. [2019-09-08 06:51:13,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:13,250 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2019-09-08 06:51:13,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:13,253 INFO L225 Difference]: With dead ends: 1037 [2019-09-08 06:51:13,253 INFO L226 Difference]: Without dead ends: 573 [2019-09-08 06:51:13,254 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:51:13,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2019-09-08 06:51:13,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 495. [2019-09-08 06:51:13,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-08 06:51:13,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 704 transitions. [2019-09-08 06:51:13,307 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 704 transitions. Word has length 245 [2019-09-08 06:51:13,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:13,307 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 704 transitions. [2019-09-08 06:51:13,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:13,307 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 704 transitions. [2019-09-08 06:51:13,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-08 06:51:13,309 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:13,309 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:13,310 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:13,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:13,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1559372228, now seen corresponding path program 1 times [2019-09-08 06:51:13,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:13,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:13,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:13,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:13,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:13,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:13,422 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:51:13,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:13,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:13,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:13,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:13,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:13,424 INFO L87 Difference]: Start difference. First operand 495 states and 704 transitions. Second operand 5 states. [2019-09-08 06:51:14,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:14,382 INFO L93 Difference]: Finished difference Result 1035 states and 1504 transitions. [2019-09-08 06:51:14,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:14,383 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2019-09-08 06:51:14,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:14,387 INFO L225 Difference]: With dead ends: 1035 [2019-09-08 06:51:14,387 INFO L226 Difference]: Without dead ends: 571 [2019-09-08 06:51:14,389 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:51:14,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-09-08 06:51:14,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 495. [2019-09-08 06:51:14,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-08 06:51:14,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 703 transitions. [2019-09-08 06:51:14,444 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 703 transitions. Word has length 245 [2019-09-08 06:51:14,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:14,445 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 703 transitions. [2019-09-08 06:51:14,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:14,445 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 703 transitions. [2019-09-08 06:51:14,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-08 06:51:14,447 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:14,447 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:14,447 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:14,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:14,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1311404034, now seen corresponding path program 1 times [2019-09-08 06:51:14,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:14,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:14,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:14,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:14,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:14,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:14,570 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:51:14,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:14,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:14,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:14,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:14,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:14,571 INFO L87 Difference]: Start difference. First operand 495 states and 703 transitions. Second operand 5 states. [2019-09-08 06:51:15,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:15,479 INFO L93 Difference]: Finished difference Result 1033 states and 1498 transitions. [2019-09-08 06:51:15,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:15,479 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2019-09-08 06:51:15,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:15,482 INFO L225 Difference]: With dead ends: 1033 [2019-09-08 06:51:15,483 INFO L226 Difference]: Without dead ends: 569 [2019-09-08 06:51:15,507 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:51:15,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2019-09-08 06:51:15,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 495. [2019-09-08 06:51:15,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-08 06:51:15,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 702 transitions. [2019-09-08 06:51:15,564 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 702 transitions. Word has length 245 [2019-09-08 06:51:15,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:15,564 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 702 transitions. [2019-09-08 06:51:15,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:15,564 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 702 transitions. [2019-09-08 06:51:15,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-08 06:51:15,566 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:15,566 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:15,566 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:15,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:15,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1303405060, now seen corresponding path program 1 times [2019-09-08 06:51:15,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:15,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:15,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:15,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:15,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:15,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:15,670 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:51:15,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:15,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:51:15,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:51:15,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:51:15,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:51:15,671 INFO L87 Difference]: Start difference. First operand 495 states and 702 transitions. Second operand 4 states. [2019-09-08 06:51:16,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:16,184 INFO L93 Difference]: Finished difference Result 1413 states and 2071 transitions. [2019-09-08 06:51:16,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:51:16,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 245 [2019-09-08 06:51:16,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:16,190 INFO L225 Difference]: With dead ends: 1413 [2019-09-08 06:51:16,191 INFO L226 Difference]: Without dead ends: 950 [2019-09-08 06:51:16,193 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:51:16,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2019-09-08 06:51:16,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 949. [2019-09-08 06:51:16,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 949 states. [2019-09-08 06:51:16,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1343 transitions. [2019-09-08 06:51:16,297 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1343 transitions. Word has length 245 [2019-09-08 06:51:16,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:16,297 INFO L475 AbstractCegarLoop]: Abstraction has 949 states and 1343 transitions. [2019-09-08 06:51:16,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:51:16,297 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1343 transitions. [2019-09-08 06:51:16,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2019-09-08 06:51:16,301 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:16,302 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, 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] [2019-09-08 06:51:16,302 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:16,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:16,303 INFO L82 PathProgramCache]: Analyzing trace with hash -584466167, now seen corresponding path program 1 times [2019-09-08 06:51:16,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:16,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:16,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:16,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:16,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:16,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:16,434 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 1 proven. 46 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-09-08 06:51:16,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:51:16,434 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:51:16,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:16,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:16,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 2700 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:51:16,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:51:17,122 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 06:51:17,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:51:17,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:51:17,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:51:17,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:51:17,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:51:17,135 INFO L87 Difference]: Start difference. First operand 949 states and 1343 transitions. Second operand 7 states. [2019-09-08 06:51:17,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:17,561 INFO L93 Difference]: Finished difference Result 2851 states and 4255 transitions. [2019-09-08 06:51:17,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:51:17,561 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 409 [2019-09-08 06:51:17,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:17,574 INFO L225 Difference]: With dead ends: 2851 [2019-09-08 06:51:17,574 INFO L226 Difference]: Without dead ends: 1934 [2019-09-08 06:51:17,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 410 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:51:17,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1934 states. [2019-09-08 06:51:17,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1934 to 1843. [2019-09-08 06:51:17,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1843 states. [2019-09-08 06:51:17,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1843 states to 1843 states and 2666 transitions. [2019-09-08 06:51:17,803 INFO L78 Accepts]: Start accepts. Automaton has 1843 states and 2666 transitions. Word has length 409 [2019-09-08 06:51:17,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:17,803 INFO L475 AbstractCegarLoop]: Abstraction has 1843 states and 2666 transitions. [2019-09-08 06:51:17,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:51:17,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1843 states and 2666 transitions. [2019-09-08 06:51:17,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2019-09-08 06:51:17,809 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:17,810 INFO L399 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 06:51:17,810 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:17,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:17,811 INFO L82 PathProgramCache]: Analyzing trace with hash -198631176, now seen corresponding path program 1 times [2019-09-08 06:51:17,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:17,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:17,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:17,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:17,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:17,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:17,970 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 1 proven. 44 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-09-08 06:51:17,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:51:17,970 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:51:17,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:18,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:18,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 2816 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:51:18,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:51:18,450 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 06:51:18,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:51:18,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-08 06:51:18,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:18,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:18,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:18,457 INFO L87 Difference]: Start difference. First operand 1843 states and 2666 transitions. Second operand 5 states. [2019-09-08 06:51:20,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:20,410 INFO L93 Difference]: Finished difference Result 8894 states and 13887 transitions. [2019-09-08 06:51:20,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:51:20,410 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 439 [2019-09-08 06:51:20,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:20,448 INFO L225 Difference]: With dead ends: 8894 [2019-09-08 06:51:20,448 INFO L226 Difference]: Without dead ends: 7099 [2019-09-08 06:51:20,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 443 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:51:20,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7099 states. [2019-09-08 06:51:21,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7099 to 7084. [2019-09-08 06:51:21,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7084 states. [2019-09-08 06:51:21,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7084 states to 7084 states and 10433 transitions. [2019-09-08 06:51:21,407 INFO L78 Accepts]: Start accepts. Automaton has 7084 states and 10433 transitions. Word has length 439 [2019-09-08 06:51:21,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:21,408 INFO L475 AbstractCegarLoop]: Abstraction has 7084 states and 10433 transitions. [2019-09-08 06:51:21,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:21,408 INFO L276 IsEmpty]: Start isEmpty. Operand 7084 states and 10433 transitions. [2019-09-08 06:51:21,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2019-09-08 06:51:21,423 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:21,424 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, 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] [2019-09-08 06:51:21,424 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:21,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:21,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1915713497, now seen corresponding path program 1 times [2019-09-08 06:51:21,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:21,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:21,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:21,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:21,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:21,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:21,653 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2019-09-08 06:51:21,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:21,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:51:21,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:51:21,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:51:21,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:51:21,657 INFO L87 Difference]: Start difference. First operand 7084 states and 10433 transitions. Second operand 4 states. [2019-09-08 06:51:22,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:22,523 INFO L93 Difference]: Finished difference Result 12341 states and 18066 transitions. [2019-09-08 06:51:22,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:51:22,524 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 409 [2019-09-08 06:51:22,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:22,549 INFO L225 Difference]: With dead ends: 12341 [2019-09-08 06:51:22,549 INFO L226 Difference]: Without dead ends: 5306 [2019-09-08 06:51:22,574 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:51:22,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5306 states. [2019-09-08 06:51:23,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5306 to 5306. [2019-09-08 06:51:23,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5306 states. [2019-09-08 06:51:23,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5306 states to 5306 states and 7708 transitions. [2019-09-08 06:51:23,157 INFO L78 Accepts]: Start accepts. Automaton has 5306 states and 7708 transitions. Word has length 409 [2019-09-08 06:51:23,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:23,157 INFO L475 AbstractCegarLoop]: Abstraction has 5306 states and 7708 transitions. [2019-09-08 06:51:23,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:51:23,158 INFO L276 IsEmpty]: Start isEmpty. Operand 5306 states and 7708 transitions. [2019-09-08 06:51:23,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2019-09-08 06:51:23,167 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:23,167 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, 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] [2019-09-08 06:51:23,168 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:23,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:23,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1116998566, now seen corresponding path program 1 times [2019-09-08 06:51:23,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:23,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:23,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:23,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:23,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:23,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:23,308 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2019-09-08 06:51:23,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:23,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:51:23,309 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:51:23,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:51:23,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:51:23,310 INFO L87 Difference]: Start difference. First operand 5306 states and 7708 transitions. Second operand 4 states. [2019-09-08 06:51:23,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:23,921 INFO L93 Difference]: Finished difference Result 9697 states and 14002 transitions. [2019-09-08 06:51:23,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:51:23,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 410 [2019-09-08 06:51:23,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:23,940 INFO L225 Difference]: With dead ends: 9697 [2019-09-08 06:51:23,941 INFO L226 Difference]: Without dead ends: 4424 [2019-09-08 06:51:23,956 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:51:23,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4424 states. [2019-09-08 06:51:24,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4424 to 4424. [2019-09-08 06:51:24,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4424 states. [2019-09-08 06:51:24,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4424 states to 4424 states and 6341 transitions. [2019-09-08 06:51:24,873 INFO L78 Accepts]: Start accepts. Automaton has 4424 states and 6341 transitions. Word has length 410 [2019-09-08 06:51:24,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:24,874 INFO L475 AbstractCegarLoop]: Abstraction has 4424 states and 6341 transitions. [2019-09-08 06:51:24,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:51:24,874 INFO L276 IsEmpty]: Start isEmpty. Operand 4424 states and 6341 transitions. [2019-09-08 06:51:24,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2019-09-08 06:51:24,884 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:24,885 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, 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] [2019-09-08 06:51:24,885 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:24,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:24,885 INFO L82 PathProgramCache]: Analyzing trace with hash 310293020, now seen corresponding path program 1 times [2019-09-08 06:51:24,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:24,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:24,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:24,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:24,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:24,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:25,037 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 1 proven. 43 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-09-08 06:51:25,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:51:25,038 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:51:25,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:25,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:25,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 2699 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:51:25,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:51:25,460 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 06:51:25,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:51:25,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:51:25,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:51:25,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:51:25,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:51:25,467 INFO L87 Difference]: Start difference. First operand 4424 states and 6341 transitions. Second operand 7 states. [2019-09-08 06:51:26,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:26,352 INFO L93 Difference]: Finished difference Result 13524 states and 20773 transitions. [2019-09-08 06:51:26,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:51:26,352 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 410 [2019-09-08 06:51:26,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:26,393 INFO L225 Difference]: With dead ends: 13524 [2019-09-08 06:51:26,394 INFO L226 Difference]: Without dead ends: 9132 [2019-09-08 06:51:26,412 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:51:26,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9132 states. [2019-09-08 06:51:27,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9132 to 9102. [2019-09-08 06:51:27,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9102 states. [2019-09-08 06:51:27,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9102 states to 9102 states and 13634 transitions. [2019-09-08 06:51:27,288 INFO L78 Accepts]: Start accepts. Automaton has 9102 states and 13634 transitions. Word has length 410 [2019-09-08 06:51:27,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:27,289 INFO L475 AbstractCegarLoop]: Abstraction has 9102 states and 13634 transitions. [2019-09-08 06:51:27,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:51:27,289 INFO L276 IsEmpty]: Start isEmpty. Operand 9102 states and 13634 transitions. [2019-09-08 06:51:27,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2019-09-08 06:51:27,309 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:27,309 INFO L399 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 06:51:27,309 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:27,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:27,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1367192899, now seen corresponding path program 1 times [2019-09-08 06:51:27,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:27,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:27,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:27,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:27,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:27,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:27,473 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-09-08 06:51:27,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:27,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:51:27,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:51:27,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:51:27,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:51:27,475 INFO L87 Difference]: Start difference. First operand 9102 states and 13634 transitions. Second operand 4 states. [2019-09-08 06:51:28,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:28,574 INFO L93 Difference]: Finished difference Result 18156 states and 27194 transitions. [2019-09-08 06:51:28,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:51:28,574 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 442 [2019-09-08 06:51:28,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:28,606 INFO L225 Difference]: With dead ends: 18156 [2019-09-08 06:51:28,607 INFO L226 Difference]: Without dead ends: 9086 [2019-09-08 06:51:28,630 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:51:28,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9086 states. [2019-09-08 06:51:29,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9086 to 9086. [2019-09-08 06:51:29,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9086 states. [2019-09-08 06:51:29,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9086 states to 9086 states and 13604 transitions. [2019-09-08 06:51:29,792 INFO L78 Accepts]: Start accepts. Automaton has 9086 states and 13604 transitions. Word has length 442 [2019-09-08 06:51:29,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:29,792 INFO L475 AbstractCegarLoop]: Abstraction has 9086 states and 13604 transitions. [2019-09-08 06:51:29,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:51:29,792 INFO L276 IsEmpty]: Start isEmpty. Operand 9086 states and 13604 transitions. [2019-09-08 06:51:29,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2019-09-08 06:51:29,806 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:29,806 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, 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] [2019-09-08 06:51:29,807 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:29,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:29,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1451623704, now seen corresponding path program 1 times [2019-09-08 06:51:29,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:29,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:29,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:29,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:29,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:29,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:29,949 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 1 proven. 40 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-09-08 06:51:29,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:51:29,949 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:51:30,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:30,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:30,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 2704 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:51:30,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:51:30,521 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-08 06:51:30,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:51:30,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:51:30,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:51:30,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:51:30,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:51:30,546 INFO L87 Difference]: Start difference. First operand 9086 states and 13604 transitions. Second operand 7 states. [2019-09-08 06:51:32,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:32,327 INFO L93 Difference]: Finished difference Result 28446 states and 46732 transitions. [2019-09-08 06:51:32,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:51:32,327 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 411 [2019-09-08 06:51:32,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:32,413 INFO L225 Difference]: With dead ends: 28446 [2019-09-08 06:51:32,413 INFO L226 Difference]: Without dead ends: 19392 [2019-09-08 06:51:32,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 412 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:51:32,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19392 states. [2019-09-08 06:51:34,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19392 to 19335. [2019-09-08 06:51:34,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19335 states. [2019-09-08 06:51:34,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19335 states to 19335 states and 30839 transitions. [2019-09-08 06:51:34,648 INFO L78 Accepts]: Start accepts. Automaton has 19335 states and 30839 transitions. Word has length 411 [2019-09-08 06:51:34,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:34,648 INFO L475 AbstractCegarLoop]: Abstraction has 19335 states and 30839 transitions. [2019-09-08 06:51:34,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:51:34,648 INFO L276 IsEmpty]: Start isEmpty. Operand 19335 states and 30839 transitions. [2019-09-08 06:51:34,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2019-09-08 06:51:34,678 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:34,678 INFO L399 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 06:51:34,679 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:34,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:34,679 INFO L82 PathProgramCache]: Analyzing trace with hash -2147042804, now seen corresponding path program 1 times [2019-09-08 06:51:34,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:34,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:34,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:34,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:34,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:34,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:34,870 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 1 proven. 37 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2019-09-08 06:51:34,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:51:34,871 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) [2019-09-08 06:51:34,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:51:35,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:35,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 2841 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:51:35,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:51:35,341 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:51:35,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:51:35,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:51:35,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:51:35,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:51:35,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:51:35,348 INFO L87 Difference]: Start difference. First operand 19335 states and 30839 transitions. Second operand 7 states. [2019-09-08 06:51:39,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:39,763 INFO L93 Difference]: Finished difference Result 59646 states and 107749 transitions. [2019-09-08 06:51:39,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:51:39,764 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 444 [2019-09-08 06:51:39,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:39,982 INFO L225 Difference]: With dead ends: 59646 [2019-09-08 06:51:39,983 INFO L226 Difference]: Without dead ends: 40358 [2019-09-08 06:51:40,164 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 445 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:51:40,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40358 states. [2019-09-08 06:51:43,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40358 to 40319. [2019-09-08 06:51:43,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40319 states. [2019-09-08 06:51:44,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40319 states to 40319 states and 67990 transitions. [2019-09-08 06:51:44,099 INFO L78 Accepts]: Start accepts. Automaton has 40319 states and 67990 transitions. Word has length 444 [2019-09-08 06:51:44,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:44,100 INFO L475 AbstractCegarLoop]: Abstraction has 40319 states and 67990 transitions. [2019-09-08 06:51:44,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:51:44,100 INFO L276 IsEmpty]: Start isEmpty. Operand 40319 states and 67990 transitions. [2019-09-08 06:51:44,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2019-09-08 06:51:44,153 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:44,154 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, 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] [2019-09-08 06:51:44,154 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:44,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:44,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1090440358, now seen corresponding path program 1 times [2019-09-08 06:51:44,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:44,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:44,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:44,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:44,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:44,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:44,320 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2019-09-08 06:51:44,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:44,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:51:44,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:51:44,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:51:44,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:51:44,322 INFO L87 Difference]: Start difference. First operand 40319 states and 67990 transitions. Second operand 4 states. [2019-09-08 06:51:48,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:48,554 INFO L93 Difference]: Finished difference Result 71065 states and 118245 transitions. [2019-09-08 06:51:48,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:51:48,554 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 411 [2019-09-08 06:51:48,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:48,669 INFO L225 Difference]: With dead ends: 71065 [2019-09-08 06:51:48,669 INFO L226 Difference]: Without dead ends: 30779 [2019-09-08 06:51:48,829 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:51:48,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30779 states. [2019-09-08 06:51:51,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30779 to 30779. [2019-09-08 06:51:51,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30779 states. [2019-09-08 06:51:51,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30779 states to 30779 states and 50305 transitions. [2019-09-08 06:51:51,706 INFO L78 Accepts]: Start accepts. Automaton has 30779 states and 50305 transitions. Word has length 411 [2019-09-08 06:51:51,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:51,707 INFO L475 AbstractCegarLoop]: Abstraction has 30779 states and 50305 transitions. [2019-09-08 06:51:51,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:51:51,707 INFO L276 IsEmpty]: Start isEmpty. Operand 30779 states and 50305 transitions. [2019-09-08 06:51:51,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2019-09-08 06:51:51,743 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:51,743 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, 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] [2019-09-08 06:51:51,743 INFO L418 AbstractCegarLoop]: === Iteration 38 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:51,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:51,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1692109533, now seen corresponding path program 1 times [2019-09-08 06:51:51,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:51,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:51,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:51,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:51,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:51,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:51,895 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 1 proven. 34 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-09-08 06:51:51,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:51:51,896 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 06:51:51,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:52,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:52,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 2707 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:51:52,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:51:52,354 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-08 06:51:52,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:51:52,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:51:52,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:51:52,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:51:52,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:51:52,361 INFO L87 Difference]: Start difference. First operand 30779 states and 50305 transitions. Second operand 7 states. [2019-09-08 06:51:59,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:59,232 INFO L93 Difference]: Finished difference Result 98613 states and 189680 transitions. [2019-09-08 06:51:59,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:51:59,232 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 412 [2019-09-08 06:51:59,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:59,588 INFO L225 Difference]: With dead ends: 98613 [2019-09-08 06:51:59,589 INFO L226 Difference]: Without dead ends: 67866 [2019-09-08 06:51:59,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 413 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:51:59,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67866 states. [2019-09-08 06:52:08,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67866 to 67701. [2019-09-08 06:52:08,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67701 states. [2019-09-08 06:52:09,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67701 states to 67701 states and 121476 transitions. [2019-09-08 06:52:09,240 INFO L78 Accepts]: Start accepts. Automaton has 67701 states and 121476 transitions. Word has length 412 [2019-09-08 06:52:09,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:52:09,240 INFO L475 AbstractCegarLoop]: Abstraction has 67701 states and 121476 transitions. [2019-09-08 06:52:09,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:52:09,241 INFO L276 IsEmpty]: Start isEmpty. Operand 67701 states and 121476 transitions. [2019-09-08 06:52:09,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2019-09-08 06:52:09,328 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:52:09,328 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, 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] [2019-09-08 06:52:09,328 INFO L418 AbstractCegarLoop]: === Iteration 39 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:52:09,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:52:09,328 INFO L82 PathProgramCache]: Analyzing trace with hash -382103717, now seen corresponding path program 1 times [2019-09-08 06:52:09,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:52:09,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:52:09,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:52:09,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:52:09,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:52:09,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:52:09,444 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2019-09-08 06:52:09,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:52:09,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:52:09,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:52:09,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:52:09,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:52:09,446 INFO L87 Difference]: Start difference. First operand 67701 states and 121476 transitions. Second operand 4 states. [2019-09-08 06:52:17,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:52:17,629 INFO L93 Difference]: Finished difference Result 135355 states and 242861 transitions. [2019-09-08 06:52:17,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:52:17,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 412 [2019-09-08 06:52:17,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:52:17,926 INFO L225 Difference]: With dead ends: 135355 [2019-09-08 06:52:17,926 INFO L226 Difference]: Without dead ends: 67686 [2019-09-08 06:52:18,173 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:52:18,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67686 states. [2019-09-08 06:52:27,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67686 to 67686. [2019-09-08 06:52:27,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67686 states. [2019-09-08 06:52:27,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67686 states to 67686 states and 121438 transitions. [2019-09-08 06:52:27,828 INFO L78 Accepts]: Start accepts. Automaton has 67686 states and 121438 transitions. Word has length 412 [2019-09-08 06:52:27,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:52:27,828 INFO L475 AbstractCegarLoop]: Abstraction has 67686 states and 121438 transitions. [2019-09-08 06:52:27,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:52:27,828 INFO L276 IsEmpty]: Start isEmpty. Operand 67686 states and 121438 transitions. [2019-09-08 06:52:27,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2019-09-08 06:52:27,905 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:52:27,906 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, 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] [2019-09-08 06:52:27,906 INFO L418 AbstractCegarLoop]: === Iteration 40 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:52:27,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:52:27,906 INFO L82 PathProgramCache]: Analyzing trace with hash 562833575, now seen corresponding path program 1 times [2019-09-08 06:52:27,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:52:27,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:52:27,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:52:27,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:52:27,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:52:27,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:52:28,387 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 1 proven. 31 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-09-08 06:52:28,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:52:28,387 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) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:52:28,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:52:28,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:52:28,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 2712 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:52:28,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:52:28,836 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-09-08 06:52:28,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:52:28,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:52:28,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:52:28,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:52:28,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:52:28,856 INFO L87 Difference]: Start difference. First operand 67686 states and 121438 transitions. Second operand 7 states. [2019-09-08 06:52:47,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:52:47,646 INFO L93 Difference]: Finished difference Result 220264 states and 488660 transitions. [2019-09-08 06:52:47,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:52:47,647 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 413 [2019-09-08 06:52:47,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:52:48,849 INFO L225 Difference]: With dead ends: 220264 [2019-09-08 06:52:48,849 INFO L226 Difference]: Without dead ends: 152610 [2019-09-08 06:52:49,464 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 414 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:52:49,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152610 states. [2019-09-08 06:53:10,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152610 to 152283. [2019-09-08 06:53:10,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152283 states. [2019-09-08 06:53:12,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152283 states to 152283 states and 308744 transitions. [2019-09-08 06:53:12,017 INFO L78 Accepts]: Start accepts. Automaton has 152283 states and 308744 transitions. Word has length 413 [2019-09-08 06:53:12,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:53:12,018 INFO L475 AbstractCegarLoop]: Abstraction has 152283 states and 308744 transitions. [2019-09-08 06:53:12,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:53:12,018 INFO L276 IsEmpty]: Start isEmpty. Operand 152283 states and 308744 transitions. [2019-09-08 06:53:12,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2019-09-08 06:53:12,279 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:53:12,279 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, 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] [2019-09-08 06:53:12,279 INFO L418 AbstractCegarLoop]: === Iteration 41 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:53:12,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:53:12,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1752515166, now seen corresponding path program 1 times [2019-09-08 06:53:12,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:53:12,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:53:12,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:53:12,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:53:12,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:53:12,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:53:12,443 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-08 06:53:12,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:53:12,444 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 06:53:12,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:53:12,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:53:12,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 2717 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:53:12,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:53:12,887 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-08 06:53:12,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:53:12,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-08 06:53:12,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:53:12,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:53:12,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:53:12,899 INFO L87 Difference]: Start difference. First operand 152283 states and 308744 transitions. Second operand 5 states. [2019-09-08 06:55:07,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:55:07,183 INFO L93 Difference]: Finished difference Result 755520 states and 2212178 transitions. [2019-09-08 06:55:07,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:55:07,184 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 414 [2019-09-08 06:55:07,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:55:28,589 INFO L225 Difference]: With dead ends: 755520 [2019-09-08 06:55:28,589 INFO L226 Difference]: Without dead ends: 603269 [2019-09-08 06:55:44,924 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 418 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:55:45,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603269 states.