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.08.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 06:42:38,561 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 06:42:38,563 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 06:42:38,575 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 06:42:38,575 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 06:42:38,576 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 06:42:38,577 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 06:42:38,579 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 06:42:38,581 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 06:42:38,582 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 06:42:38,583 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 06:42:38,584 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 06:42:38,584 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 06:42:38,585 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 06:42:38,586 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 06:42:38,587 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 06:42:38,588 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 06:42:38,588 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 06:42:38,590 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 06:42:38,592 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 06:42:38,593 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 06:42:38,594 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 06:42:38,595 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 06:42:38,596 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 06:42:38,598 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 06:42:38,598 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 06:42:38,598 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 06:42:38,599 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 06:42:38,600 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 06:42:38,600 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 06:42:38,601 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 06:42:38,601 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 06:42:38,602 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 06:42:38,603 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 06:42:38,604 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 06:42:38,604 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 06:42:38,605 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 06:42:38,605 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 06:42:38,605 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 06:42:38,606 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 06:42:38,607 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 06:42:38,608 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:42:38,622 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 06:42:38,623 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 06:42:38,624 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 06:42:38,624 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 06:42:38,624 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 06:42:38,624 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 06:42:38,625 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 06:42:38,625 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 06:42:38,625 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 06:42:38,625 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 06:42:38,625 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 06:42:38,626 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 06:42:38,626 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 06:42:38,626 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 06:42:38,626 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 06:42:38,626 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 06:42:38,626 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 06:42:38,627 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 06:42:38,627 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 06:42:38,627 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 06:42:38,627 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 06:42:38,627 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 06:42:38,628 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 06:42:38,628 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 06:42:38,628 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 06:42:38,628 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 06:42:38,628 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 06:42:38,629 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 06:42:38,629 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 06:42:38,656 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 06:42:38,667 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 06:42:38,672 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 06:42:38,673 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 06:42:38,674 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 06:42:38,674 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.08.cil-1.c [2019-09-08 06:42:38,731 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bab67c08/41e2e6d99b054e77aca3754d7d03d698/FLAG66e5a35a0 [2019-09-08 06:42:39,203 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 06:42:39,205 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.08.cil-1.c [2019-09-08 06:42:39,235 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bab67c08/41e2e6d99b054e77aca3754d7d03d698/FLAG66e5a35a0 [2019-09-08 06:42:39,563 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bab67c08/41e2e6d99b054e77aca3754d7d03d698 [2019-09-08 06:42:39,576 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 06:42:39,577 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 06:42:39,578 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 06:42:39,578 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 06:42:39,581 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 06:42:39,583 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:42:39" (1/1) ... [2019-09-08 06:42:39,586 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4686b0fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:42:39, skipping insertion in model container [2019-09-08 06:42:39,586 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:42:39" (1/1) ... [2019-09-08 06:42:39,593 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 06:42:39,648 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 06:42:40,085 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:42:40,096 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 06:42:40,167 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:42:40,202 INFO L192 MainTranslator]: Completed translation [2019-09-08 06:42:40,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:42:40 WrapperNode [2019-09-08 06:42:40,202 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 06:42:40,203 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 06:42:40,203 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 06:42:40,203 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 06:42:40,218 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:42:40" (1/1) ... [2019-09-08 06:42:40,218 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:42:40" (1/1) ... [2019-09-08 06:42:40,247 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:42:40" (1/1) ... [2019-09-08 06:42:40,247 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:42:40" (1/1) ... [2019-09-08 06:42:40,272 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:42:40" (1/1) ... [2019-09-08 06:42:40,293 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:42:40" (1/1) ... [2019-09-08 06:42:40,297 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:42:40" (1/1) ... [2019-09-08 06:42:40,306 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 06:42:40,306 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 06:42:40,307 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 06:42:40,307 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 06:42:40,310 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:42:40" (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:42:40,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 06:42:40,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 06:42:40,362 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-09-08 06:42:40,362 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-09-08 06:42:40,362 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-09-08 06:42:40,362 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-09-08 06:42:40,362 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-09-08 06:42:40,362 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit4 [2019-09-08 06:42:40,363 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit5 [2019-09-08 06:42:40,363 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit6 [2019-09-08 06:42:40,363 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit7 [2019-09-08 06:42:40,363 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit8 [2019-09-08 06:42:40,363 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-09-08 06:42:40,363 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-09-08 06:42:40,364 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-09-08 06:42:40,364 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-09-08 06:42:40,364 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit4_triggered [2019-09-08 06:42:40,364 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit5_triggered [2019-09-08 06:42:40,364 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit6_triggered [2019-09-08 06:42:40,365 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit7_triggered [2019-09-08 06:42:40,365 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit8_triggered [2019-09-08 06:42:40,365 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-09-08 06:42:40,365 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-09-08 06:42:40,365 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-09-08 06:42:40,365 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-09-08 06:42:40,366 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-09-08 06:42:40,366 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-09-08 06:42:40,366 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-09-08 06:42:40,366 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-09-08 06:42:40,366 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-09-08 06:42:40,366 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-09-08 06:42:40,366 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-09-08 06:42:40,367 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-09-08 06:42:40,367 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-09-08 06:42:40,367 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 06:42:40,367 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 06:42:40,367 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-09-08 06:42:40,367 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-09-08 06:42:40,368 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-09-08 06:42:40,368 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-09-08 06:42:40,368 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-09-08 06:42:40,368 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit4_triggered [2019-09-08 06:42:40,368 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit5_triggered [2019-09-08 06:42:40,369 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit6_triggered [2019-09-08 06:42:40,369 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit7_triggered [2019-09-08 06:42:40,369 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit8_triggered [2019-09-08 06:42:40,369 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-09-08 06:42:40,369 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 06:42:40,369 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-09-08 06:42:40,369 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-09-08 06:42:40,370 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-09-08 06:42:40,370 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-09-08 06:42:40,370 INFO L130 BoogieDeclarations]: Found specification of procedure transmit4 [2019-09-08 06:42:40,370 INFO L130 BoogieDeclarations]: Found specification of procedure transmit5 [2019-09-08 06:42:40,370 INFO L130 BoogieDeclarations]: Found specification of procedure transmit6 [2019-09-08 06:42:40,370 INFO L130 BoogieDeclarations]: Found specification of procedure transmit7 [2019-09-08 06:42:40,371 INFO L130 BoogieDeclarations]: Found specification of procedure transmit8 [2019-09-08 06:42:40,371 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-09-08 06:42:40,371 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-09-08 06:42:40,371 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-09-08 06:42:40,371 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-09-08 06:42:40,372 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-09-08 06:42:40,372 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-09-08 06:42:40,372 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-09-08 06:42:40,372 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-09-08 06:42:40,372 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-09-08 06:42:40,372 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-09-08 06:42:40,373 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-09-08 06:42:40,373 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-09-08 06:42:40,373 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 06:42:40,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 06:42:40,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 06:42:41,331 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 06:42:41,331 INFO L283 CfgBuilder]: Removed 11 assume(true) statements. [2019-09-08 06:42:41,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:42:41 BoogieIcfgContainer [2019-09-08 06:42:41,333 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 06:42:41,334 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 06:42:41,334 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 06:42:41,339 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 06:42:41,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 06:42:39" (1/3) ... [2019-09-08 06:42:41,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31592f9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:42:41, skipping insertion in model container [2019-09-08 06:42:41,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:42:40" (2/3) ... [2019-09-08 06:42:41,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31592f9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:42:41, skipping insertion in model container [2019-09-08 06:42:41,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:42:41" (3/3) ... [2019-09-08 06:42:41,344 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.08.cil-1.c [2019-09-08 06:42:41,355 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 06:42:41,376 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 06:42:41,394 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 06:42:41,446 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 06:42:41,447 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 06:42:41,447 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 06:42:41,447 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 06:42:41,448 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 06:42:41,450 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 06:42:41,450 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 06:42:41,450 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 06:42:41,451 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 06:42:41,481 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states. [2019-09-08 06:42:41,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 06:42:41,499 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:42:41,501 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] [2019-09-08 06:42:41,504 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:42:41,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:42:41,509 INFO L82 PathProgramCache]: Analyzing trace with hash -347562485, now seen corresponding path program 1 times [2019-09-08 06:42:41,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:42:41,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:42:41,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:41,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:42:41,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:41,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:42:41,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:42:41,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:42:41,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:42:42,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:42:42,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:42:42,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:42:42,021 INFO L87 Difference]: Start difference. First operand 354 states. Second operand 4 states. [2019-09-08 06:42:42,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:42:42,422 INFO L93 Difference]: Finished difference Result 686 states and 1044 transitions. [2019-09-08 06:42:42,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:42:42,424 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2019-09-08 06:42:42,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:42:42,454 INFO L225 Difference]: With dead ends: 686 [2019-09-08 06:42:42,455 INFO L226 Difference]: Without dead ends: 345 [2019-09-08 06:42:42,467 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:42:42,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-09-08 06:42:42,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2019-09-08 06:42:42,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-09-08 06:42:42,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 498 transitions. [2019-09-08 06:42:42,610 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 498 transitions. Word has length 175 [2019-09-08 06:42:42,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:42:42,612 INFO L475 AbstractCegarLoop]: Abstraction has 345 states and 498 transitions. [2019-09-08 06:42:42,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:42:42,613 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 498 transitions. [2019-09-08 06:42:42,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 06:42:42,618 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:42:42,619 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] [2019-09-08 06:42:42,619 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:42:42,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:42:42,620 INFO L82 PathProgramCache]: Analyzing trace with hash 263706573, now seen corresponding path program 1 times [2019-09-08 06:42:42,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:42:42,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:42:42,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:42,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:42:42,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:42,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:42:42,891 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:42:42,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:42:42,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:42:42,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:42:42,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:42:42,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:42:42,899 INFO L87 Difference]: Start difference. First operand 345 states and 498 transitions. Second operand 5 states. [2019-09-08 06:42:43,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:42:43,739 INFO L93 Difference]: Finished difference Result 718 states and 1062 transitions. [2019-09-08 06:42:43,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:42:43,739 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 175 [2019-09-08 06:42:43,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:42:43,743 INFO L225 Difference]: With dead ends: 718 [2019-09-08 06:42:43,743 INFO L226 Difference]: Without dead ends: 399 [2019-09-08 06:42:43,746 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:42:43,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-09-08 06:42:43,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 345. [2019-09-08 06:42:43,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-09-08 06:42:43,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 497 transitions. [2019-09-08 06:42:43,799 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 497 transitions. Word has length 175 [2019-09-08 06:42:43,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:42:43,801 INFO L475 AbstractCegarLoop]: Abstraction has 345 states and 497 transitions. [2019-09-08 06:42:43,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:42:43,801 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 497 transitions. [2019-09-08 06:42:43,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 06:42:43,809 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:42:43,810 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] [2019-09-08 06:42:43,810 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:42:43,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:42:43,811 INFO L82 PathProgramCache]: Analyzing trace with hash -2100135089, now seen corresponding path program 1 times [2019-09-08 06:42:43,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:42:43,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:42:43,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:43,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:42:43,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:43,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:42:43,995 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:42:43,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:42:43,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:42:43,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:42:43,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:42:43,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:42:43,998 INFO L87 Difference]: Start difference. First operand 345 states and 497 transitions. Second operand 5 states. [2019-09-08 06:42:44,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:42:44,721 INFO L93 Difference]: Finished difference Result 718 states and 1061 transitions. [2019-09-08 06:42:44,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:42:44,722 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 175 [2019-09-08 06:42:44,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:42:44,726 INFO L225 Difference]: With dead ends: 718 [2019-09-08 06:42:44,726 INFO L226 Difference]: Without dead ends: 399 [2019-09-08 06:42:44,728 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:42:44,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-09-08 06:42:44,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 345. [2019-09-08 06:42:44,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-09-08 06:42:44,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 496 transitions. [2019-09-08 06:42:44,760 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 496 transitions. Word has length 175 [2019-09-08 06:42:44,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:42:44,761 INFO L475 AbstractCegarLoop]: Abstraction has 345 states and 496 transitions. [2019-09-08 06:42:44,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:42:44,761 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 496 transitions. [2019-09-08 06:42:44,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 06:42:44,764 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:42:44,766 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] [2019-09-08 06:42:44,766 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:42:44,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:42:44,766 INFO L82 PathProgramCache]: Analyzing trace with hash 871653261, now seen corresponding path program 1 times [2019-09-08 06:42:44,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:42:44,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:42:44,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:44,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:42:44,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:44,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:42:44,904 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:42:44,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:42:44,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:42:44,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:42:44,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:42:44,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:42:44,907 INFO L87 Difference]: Start difference. First operand 345 states and 496 transitions. Second operand 5 states. [2019-09-08 06:42:45,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:42:45,648 INFO L93 Difference]: Finished difference Result 716 states and 1055 transitions. [2019-09-08 06:42:45,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:42:45,649 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 175 [2019-09-08 06:42:45,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:42:45,652 INFO L225 Difference]: With dead ends: 716 [2019-09-08 06:42:45,652 INFO L226 Difference]: Without dead ends: 397 [2019-09-08 06:42:45,653 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:42:45,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-09-08 06:42:45,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 345. [2019-09-08 06:42:45,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-09-08 06:42:45,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 495 transitions. [2019-09-08 06:42:45,677 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 495 transitions. Word has length 175 [2019-09-08 06:42:45,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:42:45,678 INFO L475 AbstractCegarLoop]: Abstraction has 345 states and 495 transitions. [2019-09-08 06:42:45,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:42:45,678 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 495 transitions. [2019-09-08 06:42:45,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 06:42:45,681 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:42:45,681 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] [2019-09-08 06:42:45,681 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:42:45,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:42:45,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1526334577, now seen corresponding path program 1 times [2019-09-08 06:42:45,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:42:45,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:42:45,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:45,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:42:45,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:45,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:42:45,784 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:42:45,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:42:45,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:42:45,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:42:45,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:42:45,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:42:45,786 INFO L87 Difference]: Start difference. First operand 345 states and 495 transitions. Second operand 5 states. [2019-09-08 06:42:46,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:42:46,474 INFO L93 Difference]: Finished difference Result 712 states and 1045 transitions. [2019-09-08 06:42:46,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:42:46,474 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 175 [2019-09-08 06:42:46,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:42:46,477 INFO L225 Difference]: With dead ends: 712 [2019-09-08 06:42:46,477 INFO L226 Difference]: Without dead ends: 393 [2019-09-08 06:42:46,479 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:42:46,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-09-08 06:42:46,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 345. [2019-09-08 06:42:46,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-09-08 06:42:46,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 494 transitions. [2019-09-08 06:42:46,504 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 494 transitions. Word has length 175 [2019-09-08 06:42:46,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:42:46,505 INFO L475 AbstractCegarLoop]: Abstraction has 345 states and 494 transitions. [2019-09-08 06:42:46,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:42:46,505 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 494 transitions. [2019-09-08 06:42:46,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 06:42:46,507 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:42:46,508 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] [2019-09-08 06:42:46,508 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:42:46,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:42:46,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1099780079, now seen corresponding path program 1 times [2019-09-08 06:42:46,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:42:46,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:42:46,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:46,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:42:46,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:46,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:42:46,618 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:42:46,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:42:46,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:42:46,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:42:46,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:42:46,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:42:46,620 INFO L87 Difference]: Start difference. First operand 345 states and 494 transitions. Second operand 5 states. [2019-09-08 06:42:47,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:42:47,342 INFO L93 Difference]: Finished difference Result 710 states and 1039 transitions. [2019-09-08 06:42:47,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:42:47,343 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 175 [2019-09-08 06:42:47,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:42:47,346 INFO L225 Difference]: With dead ends: 710 [2019-09-08 06:42:47,346 INFO L226 Difference]: Without dead ends: 391 [2019-09-08 06:42:47,349 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:42:47,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2019-09-08 06:42:47,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 345. [2019-09-08 06:42:47,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-09-08 06:42:47,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 493 transitions. [2019-09-08 06:42:47,396 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 493 transitions. Word has length 175 [2019-09-08 06:42:47,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:42:47,397 INFO L475 AbstractCegarLoop]: Abstraction has 345 states and 493 transitions. [2019-09-08 06:42:47,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:42:47,397 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 493 transitions. [2019-09-08 06:42:47,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 06:42:47,401 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:42:47,401 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] [2019-09-08 06:42:47,401 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:42:47,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:42:47,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1640209585, now seen corresponding path program 1 times [2019-09-08 06:42:47,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:42:47,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:42:47,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:47,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:42:47,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:47,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:42:47,526 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:42:47,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:42:47,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:42:47,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:42:47,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:42:47,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:42:47,528 INFO L87 Difference]: Start difference. First operand 345 states and 493 transitions. Second operand 5 states. [2019-09-08 06:42:48,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:42:48,143 INFO L93 Difference]: Finished difference Result 708 states and 1033 transitions. [2019-09-08 06:42:48,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:42:48,143 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 175 [2019-09-08 06:42:48,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:42:48,147 INFO L225 Difference]: With dead ends: 708 [2019-09-08 06:42:48,147 INFO L226 Difference]: Without dead ends: 389 [2019-09-08 06:42:48,148 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:42:48,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2019-09-08 06:42:48,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 345. [2019-09-08 06:42:48,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-09-08 06:42:48,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 492 transitions. [2019-09-08 06:42:48,177 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 492 transitions. Word has length 175 [2019-09-08 06:42:48,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:42:48,177 INFO L475 AbstractCegarLoop]: Abstraction has 345 states and 492 transitions. [2019-09-08 06:42:48,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:42:48,178 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 492 transitions. [2019-09-08 06:42:48,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 06:42:48,180 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:42:48,180 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:42:48,181 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:42:48,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:42:48,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1796190127, now seen corresponding path program 1 times [2019-09-08 06:42:48,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:42:48,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:42:48,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:48,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:42:48,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:48,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:42:48,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:42:48,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:42:48,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:42:48,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:42:48,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:42:48,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:42:48,280 INFO L87 Difference]: Start difference. First operand 345 states and 492 transitions. Second operand 5 states. [2019-09-08 06:42:49,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:42:49,013 INFO L93 Difference]: Finished difference Result 706 states and 1027 transitions. [2019-09-08 06:42:49,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:42:49,014 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 175 [2019-09-08 06:42:49,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:42:49,019 INFO L225 Difference]: With dead ends: 706 [2019-09-08 06:42:49,020 INFO L226 Difference]: Without dead ends: 387 [2019-09-08 06:42:49,022 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:42:49,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-09-08 06:42:49,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 345. [2019-09-08 06:42:49,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-09-08 06:42:49,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 491 transitions. [2019-09-08 06:42:49,066 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 491 transitions. Word has length 175 [2019-09-08 06:42:49,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:42:49,069 INFO L475 AbstractCegarLoop]: Abstraction has 345 states and 491 transitions. [2019-09-08 06:42:49,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:42:49,069 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 491 transitions. [2019-09-08 06:42:49,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 06:42:49,073 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:42:49,074 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] [2019-09-08 06:42:49,074 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:42:49,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:42:49,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1385579761, now seen corresponding path program 1 times [2019-09-08 06:42:49,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:42:49,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:42:49,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:49,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:42:49,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:49,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:42:49,224 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:42:49,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:42:49,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:42:49,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:42:49,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:42:49,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:42:49,226 INFO L87 Difference]: Start difference. First operand 345 states and 491 transitions. Second operand 5 states. [2019-09-08 06:42:50,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:42:50,059 INFO L93 Difference]: Finished difference Result 704 states and 1021 transitions. [2019-09-08 06:42:50,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:42:50,060 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 175 [2019-09-08 06:42:50,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:42:50,063 INFO L225 Difference]: With dead ends: 704 [2019-09-08 06:42:50,064 INFO L226 Difference]: Without dead ends: 385 [2019-09-08 06:42:50,065 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:42:50,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-09-08 06:42:50,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 345. [2019-09-08 06:42:50,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-09-08 06:42:50,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 490 transitions. [2019-09-08 06:42:50,103 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 490 transitions. Word has length 175 [2019-09-08 06:42:50,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:42:50,103 INFO L475 AbstractCegarLoop]: Abstraction has 345 states and 490 transitions. [2019-09-08 06:42:50,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:42:50,103 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 490 transitions. [2019-09-08 06:42:50,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 06:42:50,125 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:42:50,126 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] [2019-09-08 06:42:50,126 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:42:50,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:42:50,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1121517713, now seen corresponding path program 1 times [2019-09-08 06:42:50,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:42:50,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:42:50,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:50,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:42:50,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:50,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:42:50,230 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:42:50,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:42:50,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:42:50,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:42:50,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:42:50,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:42:50,232 INFO L87 Difference]: Start difference. First operand 345 states and 490 transitions. Second operand 5 states. [2019-09-08 06:42:50,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:42:50,896 INFO L93 Difference]: Finished difference Result 739 states and 1083 transitions. [2019-09-08 06:42:50,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:42:50,896 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 175 [2019-09-08 06:42:50,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:42:50,900 INFO L225 Difference]: With dead ends: 739 [2019-09-08 06:42:50,900 INFO L226 Difference]: Without dead ends: 420 [2019-09-08 06:42:50,902 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:42:50,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2019-09-08 06:42:50,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 345. [2019-09-08 06:42:50,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-09-08 06:42:50,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 489 transitions. [2019-09-08 06:42:50,932 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 489 transitions. Word has length 175 [2019-09-08 06:42:50,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:42:50,933 INFO L475 AbstractCegarLoop]: Abstraction has 345 states and 489 transitions. [2019-09-08 06:42:50,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:42:50,933 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 489 transitions. [2019-09-08 06:42:50,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 06:42:50,935 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:42:50,935 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] [2019-09-08 06:42:50,936 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:42:50,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:42:50,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1014365489, now seen corresponding path program 1 times [2019-09-08 06:42:50,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:42:50,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:42:50,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:50,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:42:50,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:50,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:42:51,036 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:42:51,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:42:51,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:42:51,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:42:51,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:42:51,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:42:51,038 INFO L87 Difference]: Start difference. First operand 345 states and 489 transitions. Second operand 5 states. [2019-09-08 06:42:51,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:42:51,720 INFO L93 Difference]: Finished difference Result 733 states and 1072 transitions. [2019-09-08 06:42:51,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:42:51,721 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 175 [2019-09-08 06:42:51,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:42:51,728 INFO L225 Difference]: With dead ends: 733 [2019-09-08 06:42:51,728 INFO L226 Difference]: Without dead ends: 414 [2019-09-08 06:42:51,731 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:42:51,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2019-09-08 06:42:51,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 345. [2019-09-08 06:42:51,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-09-08 06:42:51,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 488 transitions. [2019-09-08 06:42:51,774 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 488 transitions. Word has length 175 [2019-09-08 06:42:51,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:42:51,774 INFO L475 AbstractCegarLoop]: Abstraction has 345 states and 488 transitions. [2019-09-08 06:42:51,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:42:51,775 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 488 transitions. [2019-09-08 06:42:51,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 06:42:51,779 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:42:51,780 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] [2019-09-08 06:42:51,780 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:42:51,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:42:51,781 INFO L82 PathProgramCache]: Analyzing trace with hash -944717615, now seen corresponding path program 1 times [2019-09-08 06:42:51,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:42:51,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:42:51,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:51,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:42:51,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:51,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:42:51,929 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:42:51,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:42:51,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:42:51,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:42:51,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:42:51,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:42:51,932 INFO L87 Difference]: Start difference. First operand 345 states and 488 transitions. Second operand 5 states. [2019-09-08 06:42:52,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:42:52,632 INFO L93 Difference]: Finished difference Result 733 states and 1067 transitions. [2019-09-08 06:42:52,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:42:52,632 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 175 [2019-09-08 06:42:52,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:42:52,638 INFO L225 Difference]: With dead ends: 733 [2019-09-08 06:42:52,638 INFO L226 Difference]: Without dead ends: 414 [2019-09-08 06:42:52,640 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:42:52,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2019-09-08 06:42:52,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 345. [2019-09-08 06:42:52,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-09-08 06:42:52,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 487 transitions. [2019-09-08 06:42:52,675 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 487 transitions. Word has length 175 [2019-09-08 06:42:52,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:42:52,677 INFO L475 AbstractCegarLoop]: Abstraction has 345 states and 487 transitions. [2019-09-08 06:42:52,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:42:52,677 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 487 transitions. [2019-09-08 06:42:52,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 06:42:52,679 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:42:52,680 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:42:52,681 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:42:52,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:42:52,681 INFO L82 PathProgramCache]: Analyzing trace with hash 454235987, now seen corresponding path program 1 times [2019-09-08 06:42:52,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:42:52,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:42:52,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:52,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:42:52,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:52,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:42:52,811 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:42:52,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:42:52,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:42:52,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:42:52,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:42:52,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:42:52,813 INFO L87 Difference]: Start difference. First operand 345 states and 487 transitions. Second operand 5 states. [2019-09-08 06:42:53,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:42:53,483 INFO L93 Difference]: Finished difference Result 731 states and 1061 transitions. [2019-09-08 06:42:53,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:42:53,484 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 175 [2019-09-08 06:42:53,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:42:53,487 INFO L225 Difference]: With dead ends: 731 [2019-09-08 06:42:53,487 INFO L226 Difference]: Without dead ends: 412 [2019-09-08 06:42:53,489 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:42:53,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2019-09-08 06:42:53,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 345. [2019-09-08 06:42:53,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-09-08 06:42:53,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 486 transitions. [2019-09-08 06:42:53,522 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 486 transitions. Word has length 175 [2019-09-08 06:42:53,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:42:53,522 INFO L475 AbstractCegarLoop]: Abstraction has 345 states and 486 transitions. [2019-09-08 06:42:53,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:42:53,522 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 486 transitions. [2019-09-08 06:42:53,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 06:42:53,524 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:42: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] [2019-09-08 06:42:53,525 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:42:53,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:42:53,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1163204463, now seen corresponding path program 1 times [2019-09-08 06:42:53,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:42:53,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:42:53,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:53,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:42:53,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:53,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:42:53,605 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:42:53,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:42:53,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:42:53,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:42:53,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:42:53,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:42:53,608 INFO L87 Difference]: Start difference. First operand 345 states and 486 transitions. Second operand 5 states. [2019-09-08 06:42:54,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:42:54,211 INFO L93 Difference]: Finished difference Result 729 states and 1055 transitions. [2019-09-08 06:42:54,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:42:54,212 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 175 [2019-09-08 06:42:54,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:42:54,216 INFO L225 Difference]: With dead ends: 729 [2019-09-08 06:42:54,216 INFO L226 Difference]: Without dead ends: 410 [2019-09-08 06:42:54,217 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:42:54,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-09-08 06:42:54,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 345. [2019-09-08 06:42:54,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-09-08 06:42:54,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 485 transitions. [2019-09-08 06:42:54,248 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 485 transitions. Word has length 175 [2019-09-08 06:42:54,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:42:54,249 INFO L475 AbstractCegarLoop]: Abstraction has 345 states and 485 transitions. [2019-09-08 06:42:54,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:42:54,249 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 485 transitions. [2019-09-08 06:42:54,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 06:42:54,250 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:42:54,251 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] [2019-09-08 06:42:54,251 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:42:54,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:42:54,252 INFO L82 PathProgramCache]: Analyzing trace with hash -799737965, now seen corresponding path program 1 times [2019-09-08 06:42:54,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:42:54,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:42:54,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:54,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:42:54,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:54,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:42:54,384 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:42:54,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:42:54,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:42:54,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:42:54,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:42:54,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:42:54,386 INFO L87 Difference]: Start difference. First operand 345 states and 485 transitions. Second operand 5 states. [2019-09-08 06:42:55,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:42:55,227 INFO L93 Difference]: Finished difference Result 727 states and 1049 transitions. [2019-09-08 06:42:55,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:42:55,228 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 175 [2019-09-08 06:42:55,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:42:55,232 INFO L225 Difference]: With dead ends: 727 [2019-09-08 06:42:55,232 INFO L226 Difference]: Without dead ends: 408 [2019-09-08 06:42:55,234 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:42:55,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2019-09-08 06:42:55,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 345. [2019-09-08 06:42:55,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-09-08 06:42:55,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 484 transitions. [2019-09-08 06:42:55,276 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 484 transitions. Word has length 175 [2019-09-08 06:42:55,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:42:55,277 INFO L475 AbstractCegarLoop]: Abstraction has 345 states and 484 transitions. [2019-09-08 06:42:55,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:42:55,277 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 484 transitions. [2019-09-08 06:42:55,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 06:42:55,279 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:42:55,279 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] [2019-09-08 06:42:55,280 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:42:55,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:42:55,280 INFO L82 PathProgramCache]: Analyzing trace with hash -510918575, now seen corresponding path program 1 times [2019-09-08 06:42:55,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:42:55,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:42:55,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:55,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:42:55,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:55,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:42:55,403 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:42:55,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:42:55,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:42:55,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:42:55,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:42:55,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:42:55,409 INFO L87 Difference]: Start difference. First operand 345 states and 484 transitions. Second operand 5 states. [2019-09-08 06:42:56,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:42:56,115 INFO L93 Difference]: Finished difference Result 725 states and 1043 transitions. [2019-09-08 06:42:56,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:42:56,116 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 175 [2019-09-08 06:42:56,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:42:56,122 INFO L225 Difference]: With dead ends: 725 [2019-09-08 06:42:56,122 INFO L226 Difference]: Without dead ends: 406 [2019-09-08 06:42:56,124 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:42:56,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-09-08 06:42:56,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 345. [2019-09-08 06:42:56,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-09-08 06:42:56,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 483 transitions. [2019-09-08 06:42:56,169 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 483 transitions. Word has length 175 [2019-09-08 06:42:56,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:42:56,169 INFO L475 AbstractCegarLoop]: Abstraction has 345 states and 483 transitions. [2019-09-08 06:42:56,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:42:56,169 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 483 transitions. [2019-09-08 06:42:56,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 06:42:56,171 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:42:56,171 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:42:56,172 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:42:56,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:42:56,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1055791149, now seen corresponding path program 1 times [2019-09-08 06:42:56,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:42:56,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:42:56,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:56,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:42:56,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:56,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:42:56,305 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:42:56,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:42:56,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:42:56,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:42:56,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:42:56,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:42:56,308 INFO L87 Difference]: Start difference. First operand 345 states and 483 transitions. Second operand 5 states. [2019-09-08 06:42:57,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:42:57,110 INFO L93 Difference]: Finished difference Result 723 states and 1037 transitions. [2019-09-08 06:42:57,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:42:57,111 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 175 [2019-09-08 06:42:57,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:42:57,114 INFO L225 Difference]: With dead ends: 723 [2019-09-08 06:42:57,115 INFO L226 Difference]: Without dead ends: 404 [2019-09-08 06:42:57,120 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:42:57,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2019-09-08 06:42:57,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 345. [2019-09-08 06:42:57,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-09-08 06:42:57,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 482 transitions. [2019-09-08 06:42:57,178 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 482 transitions. Word has length 175 [2019-09-08 06:42:57,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:42:57,178 INFO L475 AbstractCegarLoop]: Abstraction has 345 states and 482 transitions. [2019-09-08 06:42:57,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:42:57,179 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 482 transitions. [2019-09-08 06:42:57,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 06:42:57,181 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:42:57,181 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] [2019-09-08 06:42:57,182 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:42:57,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:42:57,182 INFO L82 PathProgramCache]: Analyzing trace with hash -380631023, now seen corresponding path program 1 times [2019-09-08 06:42:57,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:42:57,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:42:57,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:57,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:42:57,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:57,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:42:57,281 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:42:57,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:42:57,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:42:57,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:42:57,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:42:57,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:42:57,283 INFO L87 Difference]: Start difference. First operand 345 states and 482 transitions. Second operand 6 states. [2019-09-08 06:42:57,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:42:57,367 INFO L93 Difference]: Finished difference Result 694 states and 1000 transitions. [2019-09-08 06:42:57,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:42:57,368 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 175 [2019-09-08 06:42:57,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:42:57,371 INFO L225 Difference]: With dead ends: 694 [2019-09-08 06:42:57,372 INFO L226 Difference]: Without dead ends: 376 [2019-09-08 06:42:57,373 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:42:57,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-09-08 06:42:57,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 350. [2019-09-08 06:42:57,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-09-08 06:42:57,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 487 transitions. [2019-09-08 06:42:57,408 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 487 transitions. Word has length 175 [2019-09-08 06:42:57,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:42:57,408 INFO L475 AbstractCegarLoop]: Abstraction has 350 states and 487 transitions. [2019-09-08 06:42:57,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:42:57,409 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 487 transitions. [2019-09-08 06:42:57,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 06:42:57,410 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:42:57,410 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] [2019-09-08 06:42:57,411 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:42:57,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:42:57,411 INFO L82 PathProgramCache]: Analyzing trace with hash -2102633709, now seen corresponding path program 1 times [2019-09-08 06:42:57,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:42:57,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:42:57,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:57,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:42:57,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:57,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:42:57,492 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:42:57,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:42:57,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:42:57,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:42:57,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:42:57,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:42:57,494 INFO L87 Difference]: Start difference. First operand 350 states and 487 transitions. Second operand 4 states. [2019-09-08 06:42:57,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:42:57,882 INFO L93 Difference]: Finished difference Result 989 states and 1423 transitions. [2019-09-08 06:42:57,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:42:57,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2019-09-08 06:42:57,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:42:57,888 INFO L225 Difference]: With dead ends: 989 [2019-09-08 06:42:57,889 INFO L226 Difference]: Without dead ends: 666 [2019-09-08 06:42:57,893 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:42:57,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2019-09-08 06:42:57,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 661. [2019-09-08 06:42:57,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 661 states. [2019-09-08 06:42:58,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 919 transitions. [2019-09-08 06:42:58,004 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 919 transitions. Word has length 175 [2019-09-08 06:42:58,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:42:58,004 INFO L475 AbstractCegarLoop]: Abstraction has 661 states and 919 transitions. [2019-09-08 06:42:58,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:42:58,004 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 919 transitions. [2019-09-08 06:42:58,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 06:42:58,006 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:42:58,007 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] [2019-09-08 06:42:58,007 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:42:58,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:42:58,008 INFO L82 PathProgramCache]: Analyzing trace with hash -652015118, now seen corresponding path program 1 times [2019-09-08 06:42:58,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:42:58,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:42:58,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:58,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:42:58,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:58,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:42:58,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:42:58,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:42:58,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:42:58,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:42:58,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:42:58,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:42:58,101 INFO L87 Difference]: Start difference. First operand 661 states and 919 transitions. Second operand 6 states. [2019-09-08 06:42:58,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:42:58,197 INFO L93 Difference]: Finished difference Result 1323 states and 1889 transitions. [2019-09-08 06:42:58,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:42:58,198 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 175 [2019-09-08 06:42:58,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:42:58,204 INFO L225 Difference]: With dead ends: 1323 [2019-09-08 06:42:58,204 INFO L226 Difference]: Without dead ends: 689 [2019-09-08 06:42:58,206 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:42:58,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2019-09-08 06:42:58,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 666. [2019-09-08 06:42:58,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2019-09-08 06:42:58,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 923 transitions. [2019-09-08 06:42:58,283 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 923 transitions. Word has length 175 [2019-09-08 06:42:58,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:42:58,284 INFO L475 AbstractCegarLoop]: Abstraction has 666 states and 923 transitions. [2019-09-08 06:42:58,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:42:58,284 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 923 transitions. [2019-09-08 06:42:58,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 06:42:58,285 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:42:58,285 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] [2019-09-08 06:42:58,286 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:42:58,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:42:58,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1669786800, now seen corresponding path program 1 times [2019-09-08 06:42:58,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:42:58,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:42:58,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:58,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:42:58,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:58,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:42:58,364 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:42:58,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:42:58,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:42:58,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:42:58,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:42:58,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:42:58,366 INFO L87 Difference]: Start difference. First operand 666 states and 923 transitions. Second operand 6 states. [2019-09-08 06:42:58,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:42:58,455 INFO L93 Difference]: Finished difference Result 1355 states and 1933 transitions. [2019-09-08 06:42:58,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:42:58,456 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 175 [2019-09-08 06:42:58,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:42:58,461 INFO L225 Difference]: With dead ends: 1355 [2019-09-08 06:42:58,462 INFO L226 Difference]: Without dead ends: 716 [2019-09-08 06:42:58,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:42:58,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2019-09-08 06:42:58,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 676. [2019-09-08 06:42:58,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2019-09-08 06:42:58,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 933 transitions. [2019-09-08 06:42:58,537 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 933 transitions. Word has length 175 [2019-09-08 06:42:58,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:42:58,537 INFO L475 AbstractCegarLoop]: Abstraction has 676 states and 933 transitions. [2019-09-08 06:42:58,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:42:58,537 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 933 transitions. [2019-09-08 06:42:58,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 06:42:58,539 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:42:58,539 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] [2019-09-08 06:42:58,539 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:42:58,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:42:58,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1594139598, now seen corresponding path program 1 times [2019-09-08 06:42:58,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:42:58,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:42:58,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:58,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:42:58,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:58,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:42:58,627 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:42:58,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:42:58,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:42:58,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:42:58,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:42:58,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:42:58,629 INFO L87 Difference]: Start difference. First operand 676 states and 933 transitions. Second operand 4 states. [2019-09-08 06:42:59,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:42:59,109 INFO L93 Difference]: Finished difference Result 1961 states and 2799 transitions. [2019-09-08 06:42:59,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:42:59,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2019-09-08 06:42:59,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:42:59,120 INFO L225 Difference]: With dead ends: 1961 [2019-09-08 06:42:59,120 INFO L226 Difference]: Without dead ends: 1312 [2019-09-08 06:42:59,124 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:42:59,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2019-09-08 06:42:59,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1305. [2019-09-08 06:42:59,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1305 states. [2019-09-08 06:42:59,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1305 states to 1305 states and 1799 transitions. [2019-09-08 06:42:59,265 INFO L78 Accepts]: Start accepts. Automaton has 1305 states and 1799 transitions. Word has length 175 [2019-09-08 06:42:59,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:42:59,266 INFO L475 AbstractCegarLoop]: Abstraction has 1305 states and 1799 transitions. [2019-09-08 06:42:59,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:42:59,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 1799 transitions. [2019-09-08 06:42:59,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 06:42:59,267 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:42:59,268 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] [2019-09-08 06:42:59,268 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:42:59,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:42:59,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1238543151, now seen corresponding path program 1 times [2019-09-08 06:42:59,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:42:59,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:42:59,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:59,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:42:59,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:59,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:42:59,349 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:42:59,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:42:59,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:42:59,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:42:59,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:42:59,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:42:59,351 INFO L87 Difference]: Start difference. First operand 1305 states and 1799 transitions. Second operand 6 states. [2019-09-08 06:42:59,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:42:59,515 INFO L93 Difference]: Finished difference Result 2627 states and 3716 transitions. [2019-09-08 06:42:59,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:42:59,516 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 175 [2019-09-08 06:42:59,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:42:59,525 INFO L225 Difference]: With dead ends: 2627 [2019-09-08 06:42:59,525 INFO L226 Difference]: Without dead ends: 1349 [2019-09-08 06:42:59,531 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:42:59,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2019-09-08 06:42:59,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1315. [2019-09-08 06:42:59,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1315 states. [2019-09-08 06:42:59,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1315 states and 1807 transitions. [2019-09-08 06:42:59,663 INFO L78 Accepts]: Start accepts. Automaton has 1315 states and 1807 transitions. Word has length 175 [2019-09-08 06:42:59,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:42:59,663 INFO L475 AbstractCegarLoop]: Abstraction has 1315 states and 1807 transitions. [2019-09-08 06:42:59,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:42:59,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1315 states and 1807 transitions. [2019-09-08 06:42:59,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 06:42:59,665 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:42:59,665 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] [2019-09-08 06:42:59,665 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:42:59,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:42:59,666 INFO L82 PathProgramCache]: Analyzing trace with hash 638520079, now seen corresponding path program 1 times [2019-09-08 06:42:59,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:42:59,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:42:59,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:59,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:42:59,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:59,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:42:59,759 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:42:59,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:42:59,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:42:59,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:42:59,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:42:59,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:42:59,763 INFO L87 Difference]: Start difference. First operand 1315 states and 1807 transitions. Second operand 4 states. [2019-09-08 06:43:00,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:00,459 INFO L93 Difference]: Finished difference Result 3866 states and 5499 transitions. [2019-09-08 06:43:00,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:43:00,460 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2019-09-08 06:43:00,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:00,476 INFO L225 Difference]: With dead ends: 3866 [2019-09-08 06:43:00,476 INFO L226 Difference]: Without dead ends: 2578 [2019-09-08 06:43:00,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:43:00,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2578 states. [2019-09-08 06:43:00,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2578 to 2567. [2019-09-08 06:43:00,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2567 states. [2019-09-08 06:43:00,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2567 states to 2567 states and 3525 transitions. [2019-09-08 06:43:00,782 INFO L78 Accepts]: Start accepts. Automaton has 2567 states and 3525 transitions. Word has length 175 [2019-09-08 06:43:00,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:00,783 INFO L475 AbstractCegarLoop]: Abstraction has 2567 states and 3525 transitions. [2019-09-08 06:43:00,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:43:00,783 INFO L276 IsEmpty]: Start isEmpty. Operand 2567 states and 3525 transitions. [2019-09-08 06:43:00,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 06:43:00,784 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:00,785 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] [2019-09-08 06:43:00,785 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:00,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:00,785 INFO L82 PathProgramCache]: Analyzing trace with hash -846720112, now seen corresponding path program 1 times [2019-09-08 06:43:00,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:00,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:00,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:00,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:00,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:00,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:00,868 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:43:00,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:00,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:43:00,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:43:00,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:43:00,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:43:00,870 INFO L87 Difference]: Start difference. First operand 2567 states and 3525 transitions. Second operand 6 states. [2019-09-08 06:43:01,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:01,135 INFO L93 Difference]: Finished difference Result 5183 states and 7304 transitions. [2019-09-08 06:43:01,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:43:01,136 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 175 [2019-09-08 06:43:01,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:01,152 INFO L225 Difference]: With dead ends: 5183 [2019-09-08 06:43:01,153 INFO L226 Difference]: Without dead ends: 2643 [2019-09-08 06:43:01,163 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:43:01,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2643 states. [2019-09-08 06:43:01,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2643 to 2587. [2019-09-08 06:43:01,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2587 states. [2019-09-08 06:43:01,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2587 states to 2587 states and 3541 transitions. [2019-09-08 06:43:01,595 INFO L78 Accepts]: Start accepts. Automaton has 2587 states and 3541 transitions. Word has length 175 [2019-09-08 06:43:01,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:01,595 INFO L475 AbstractCegarLoop]: Abstraction has 2587 states and 3541 transitions. [2019-09-08 06:43:01,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:43:01,596 INFO L276 IsEmpty]: Start isEmpty. Operand 2587 states and 3541 transitions. [2019-09-08 06:43:01,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 06:43:01,598 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:01,598 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] [2019-09-08 06:43:01,599 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:01,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:01,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1904558190, now seen corresponding path program 1 times [2019-09-08 06:43:01,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:01,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:01,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:01,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:01,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:01,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:01,694 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:43:01,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:01,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:43:01,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:43:01,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:43:01,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:43:01,696 INFO L87 Difference]: Start difference. First operand 2587 states and 3541 transitions. Second operand 6 states. [2019-09-08 06:43:01,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:01,982 INFO L93 Difference]: Finished difference Result 5275 states and 7417 transitions. [2019-09-08 06:43:01,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:43:01,983 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 175 [2019-09-08 06:43:01,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:02,001 INFO L225 Difference]: With dead ends: 5275 [2019-09-08 06:43:02,001 INFO L226 Difference]: Without dead ends: 2715 [2019-09-08 06:43:02,012 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:43:02,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2715 states. [2019-09-08 06:43:02,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2715 to 2627. [2019-09-08 06:43:02,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2627 states. [2019-09-08 06:43:02,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2627 states to 2627 states and 3581 transitions. [2019-09-08 06:43:02,264 INFO L78 Accepts]: Start accepts. Automaton has 2627 states and 3581 transitions. Word has length 175 [2019-09-08 06:43:02,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:02,265 INFO L475 AbstractCegarLoop]: Abstraction has 2627 states and 3581 transitions. [2019-09-08 06:43:02,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:43:02,265 INFO L276 IsEmpty]: Start isEmpty. Operand 2627 states and 3581 transitions. [2019-09-08 06:43:02,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 06:43:02,266 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:02,266 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] [2019-09-08 06:43:02,267 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:02,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:02,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1827657392, now seen corresponding path program 1 times [2019-09-08 06:43:02,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:02,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:02,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:02,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:02,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:02,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:02,338 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:43:02,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:02,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:43:02,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:43:02,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:43:02,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:43:02,339 INFO L87 Difference]: Start difference. First operand 2627 states and 3581 transitions. Second operand 6 states. [2019-09-08 06:43:02,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:02,627 INFO L93 Difference]: Finished difference Result 5331 states and 7457 transitions. [2019-09-08 06:43:02,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:43:02,627 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 175 [2019-09-08 06:43:02,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:02,643 INFO L225 Difference]: With dead ends: 5331 [2019-09-08 06:43:02,644 INFO L226 Difference]: Without dead ends: 2731 [2019-09-08 06:43:02,656 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:43:02,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2731 states. [2019-09-08 06:43:02,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2731 to 2667. [2019-09-08 06:43:02,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2667 states. [2019-09-08 06:43:02,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2667 states to 2667 states and 3621 transitions. [2019-09-08 06:43:02,922 INFO L78 Accepts]: Start accepts. Automaton has 2667 states and 3621 transitions. Word has length 175 [2019-09-08 06:43:02,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:02,923 INFO L475 AbstractCegarLoop]: Abstraction has 2667 states and 3621 transitions. [2019-09-08 06:43:02,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:43:02,923 INFO L276 IsEmpty]: Start isEmpty. Operand 2667 states and 3621 transitions. [2019-09-08 06:43:02,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 06:43:02,925 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:02,925 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] [2019-09-08 06:43:02,926 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:02,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:02,926 INFO L82 PathProgramCache]: Analyzing trace with hash 2049913298, now seen corresponding path program 1 times [2019-09-08 06:43:02,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:02,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:02,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:02,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:02,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:02,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:03,012 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:43:03,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:03,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:43:03,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:43:03,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:43:03,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:43:03,014 INFO L87 Difference]: Start difference. First operand 2667 states and 3621 transitions. Second operand 4 states. [2019-09-08 06:43:03,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:03,928 INFO L93 Difference]: Finished difference Result 7898 states and 11107 transitions. [2019-09-08 06:43:03,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:43:03,928 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2019-09-08 06:43:03,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:03,984 INFO L225 Difference]: With dead ends: 7898 [2019-09-08 06:43:03,985 INFO L226 Difference]: Without dead ends: 5258 [2019-09-08 06:43:04,005 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:43:04,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5258 states. [2019-09-08 06:43:04,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5258 to 5239. [2019-09-08 06:43:04,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5239 states. [2019-09-08 06:43:04,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5239 states to 5239 states and 7115 transitions. [2019-09-08 06:43:04,795 INFO L78 Accepts]: Start accepts. Automaton has 5239 states and 7115 transitions. Word has length 175 [2019-09-08 06:43:04,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:04,796 INFO L475 AbstractCegarLoop]: Abstraction has 5239 states and 7115 transitions. [2019-09-08 06:43:04,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:43:04,797 INFO L276 IsEmpty]: Start isEmpty. Operand 5239 states and 7115 transitions. [2019-09-08 06:43:04,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 06:43:04,799 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:04,799 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] [2019-09-08 06:43:04,799 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:04,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:04,800 INFO L82 PathProgramCache]: Analyzing trace with hash 143429105, now seen corresponding path program 1 times [2019-09-08 06:43:04,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:04,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:04,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:04,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:04,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:04,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:04,928 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:43:04,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:04,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:43:04,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:43:04,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:43:04,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:43:04,930 INFO L87 Difference]: Start difference. First operand 5239 states and 7115 transitions. Second operand 6 states. [2019-09-08 06:43:05,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:05,904 INFO L93 Difference]: Finished difference Result 10531 states and 14666 transitions. [2019-09-08 06:43:05,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:43:05,905 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 175 [2019-09-08 06:43:05,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:05,941 INFO L225 Difference]: With dead ends: 10531 [2019-09-08 06:43:05,942 INFO L226 Difference]: Without dead ends: 5319 [2019-09-08 06:43:05,967 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:43:05,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5319 states. [2019-09-08 06:43:06,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5319 to 5279. [2019-09-08 06:43:06,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5279 states. [2019-09-08 06:43:06,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5279 states to 5279 states and 7147 transitions. [2019-09-08 06:43:06,495 INFO L78 Accepts]: Start accepts. Automaton has 5279 states and 7147 transitions. Word has length 175 [2019-09-08 06:43:06,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:06,498 INFO L475 AbstractCegarLoop]: Abstraction has 5279 states and 7147 transitions. [2019-09-08 06:43:06,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:43:06,498 INFO L276 IsEmpty]: Start isEmpty. Operand 5279 states and 7147 transitions. [2019-09-08 06:43:06,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 06:43:06,500 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:06,500 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] [2019-09-08 06:43:06,500 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:06,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:06,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1019448111, now seen corresponding path program 1 times [2019-09-08 06:43:06,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:06,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:06,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:06,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:06,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:06,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:06,591 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:43:06,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:06,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:43:06,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:43:06,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:43:06,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:43:06,592 INFO L87 Difference]: Start difference. First operand 5279 states and 7147 transitions. Second operand 4 states. [2019-09-08 06:43:07,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:07,967 INFO L93 Difference]: Finished difference Result 15686 states and 22055 transitions. [2019-09-08 06:43:07,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:43:07,968 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2019-09-08 06:43:07,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:08,031 INFO L225 Difference]: With dead ends: 15686 [2019-09-08 06:43:08,032 INFO L226 Difference]: Without dead ends: 10434 [2019-09-08 06:43:08,060 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:43:08,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10434 states. [2019-09-08 06:43:09,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10434 to 10399. [2019-09-08 06:43:09,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10399 states. [2019-09-08 06:43:09,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10399 states to 10399 states and 14109 transitions. [2019-09-08 06:43:09,697 INFO L78 Accepts]: Start accepts. Automaton has 10399 states and 14109 transitions. Word has length 175 [2019-09-08 06:43:09,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:09,698 INFO L475 AbstractCegarLoop]: Abstraction has 10399 states and 14109 transitions. [2019-09-08 06:43:09,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:43:09,698 INFO L276 IsEmpty]: Start isEmpty. Operand 10399 states and 14109 transitions. [2019-09-08 06:43:09,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 06:43:09,699 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:09,700 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] [2019-09-08 06:43:09,700 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:09,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:09,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1081393104, now seen corresponding path program 1 times [2019-09-08 06:43:09,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:09,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:09,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:09,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:09,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:09,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:09,784 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:43:09,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:09,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:43:09,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:43:09,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:43:09,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:43:09,785 INFO L87 Difference]: Start difference. First operand 10399 states and 14109 transitions. Second operand 6 states. [2019-09-08 06:43:10,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:10,549 INFO L93 Difference]: Finished difference Result 20883 states and 29096 transitions. [2019-09-08 06:43:10,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:43:10,550 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 175 [2019-09-08 06:43:10,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:10,590 INFO L225 Difference]: With dead ends: 20883 [2019-09-08 06:43:10,591 INFO L226 Difference]: Without dead ends: 10511 [2019-09-08 06:43:10,619 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:43:10,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10511 states. [2019-09-08 06:43:11,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10511 to 10479. [2019-09-08 06:43:11,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10479 states. [2019-09-08 06:43:11,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10479 states to 10479 states and 14173 transitions. [2019-09-08 06:43:11,600 INFO L78 Accepts]: Start accepts. Automaton has 10479 states and 14173 transitions. Word has length 175 [2019-09-08 06:43:11,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:11,601 INFO L475 AbstractCegarLoop]: Abstraction has 10479 states and 14173 transitions. [2019-09-08 06:43:11,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:43:11,601 INFO L276 IsEmpty]: Start isEmpty. Operand 10479 states and 14173 transitions. [2019-09-08 06:43:11,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 06:43:11,603 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:11,603 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] [2019-09-08 06:43:11,603 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:11,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:11,604 INFO L82 PathProgramCache]: Analyzing trace with hash -187906766, now seen corresponding path program 1 times [2019-09-08 06:43:11,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:11,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:11,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:11,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:11,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:11,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:11,698 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:43:11,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:11,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:43:11,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:43:11,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:43:11,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:43:11,700 INFO L87 Difference]: Start difference. First operand 10479 states and 14173 transitions. Second operand 5 states. [2019-09-08 06:43:13,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:13,798 INFO L93 Difference]: Finished difference Result 25986 states and 34982 transitions. [2019-09-08 06:43:13,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:43:13,799 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 175 [2019-09-08 06:43:13,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:13,864 INFO L225 Difference]: With dead ends: 25986 [2019-09-08 06:43:13,864 INFO L226 Difference]: Without dead ends: 15535 [2019-09-08 06:43:13,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:43:13,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15535 states. [2019-09-08 06:43:14,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15535 to 14415. [2019-09-08 06:43:14,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14415 states. [2019-09-08 06:43:14,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14415 states to 14415 states and 18589 transitions. [2019-09-08 06:43:14,986 INFO L78 Accepts]: Start accepts. Automaton has 14415 states and 18589 transitions. Word has length 175 [2019-09-08 06:43:14,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:14,986 INFO L475 AbstractCegarLoop]: Abstraction has 14415 states and 18589 transitions. [2019-09-08 06:43:14,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:43:14,987 INFO L276 IsEmpty]: Start isEmpty. Operand 14415 states and 18589 transitions. [2019-09-08 06:43:14,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 06:43:14,988 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:14,988 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] [2019-09-08 06:43:14,988 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:14,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:14,989 INFO L82 PathProgramCache]: Analyzing trace with hash 235739956, now seen corresponding path program 1 times [2019-09-08 06:43:14,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:14,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:14,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:14,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:14,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:15,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:15,076 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:43:15,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:15,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:43:15,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:43:15,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:43:15,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:43:15,078 INFO L87 Difference]: Start difference. First operand 14415 states and 18589 transitions. Second operand 5 states. [2019-09-08 06:43:16,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:16,856 INFO L93 Difference]: Finished difference Result 28802 states and 37203 transitions. [2019-09-08 06:43:16,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:43:16,857 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 175 [2019-09-08 06:43:16,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:16,910 INFO L225 Difference]: With dead ends: 28802 [2019-09-08 06:43:16,910 INFO L226 Difference]: Without dead ends: 14415 [2019-09-08 06:43:16,943 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:43:16,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14415 states. [2019-09-08 06:43:18,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14415 to 14415. [2019-09-08 06:43:18,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14415 states. [2019-09-08 06:43:18,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14415 states to 14415 states and 18525 transitions. [2019-09-08 06:43:18,080 INFO L78 Accepts]: Start accepts. Automaton has 14415 states and 18525 transitions. Word has length 175 [2019-09-08 06:43:18,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:18,081 INFO L475 AbstractCegarLoop]: Abstraction has 14415 states and 18525 transitions. [2019-09-08 06:43:18,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:43:18,081 INFO L276 IsEmpty]: Start isEmpty. Operand 14415 states and 18525 transitions. [2019-09-08 06:43:18,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 06:43:18,082 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:18,082 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] [2019-09-08 06:43:18,083 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:18,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:18,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1136067342, now seen corresponding path program 1 times [2019-09-08 06:43:18,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:18,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:18,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:18,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:18,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:18,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:18,180 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:43:18,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:18,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:43:18,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:43:18,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:43:18,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:43:18,182 INFO L87 Difference]: Start difference. First operand 14415 states and 18525 transitions. Second operand 5 states. [2019-09-08 06:43:20,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:20,273 INFO L93 Difference]: Finished difference Result 28802 states and 37075 transitions. [2019-09-08 06:43:20,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:43:20,273 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 175 [2019-09-08 06:43:20,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:20,317 INFO L225 Difference]: With dead ends: 28802 [2019-09-08 06:43:20,317 INFO L226 Difference]: Without dead ends: 14415 [2019-09-08 06:43:20,344 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:43:20,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14415 states. [2019-09-08 06:43:21,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14415 to 14415. [2019-09-08 06:43:21,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14415 states. [2019-09-08 06:43:21,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14415 states to 14415 states and 18461 transitions. [2019-09-08 06:43:21,313 INFO L78 Accepts]: Start accepts. Automaton has 14415 states and 18461 transitions. Word has length 175 [2019-09-08 06:43:21,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:21,314 INFO L475 AbstractCegarLoop]: Abstraction has 14415 states and 18461 transitions. [2019-09-08 06:43:21,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:43:21,314 INFO L276 IsEmpty]: Start isEmpty. Operand 14415 states and 18461 transitions. [2019-09-08 06:43:21,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 06:43:21,316 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:21,316 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] [2019-09-08 06:43:21,316 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:21,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:21,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1313532788, now seen corresponding path program 1 times [2019-09-08 06:43:21,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:21,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:21,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:21,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:21,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:21,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:21,400 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:43:21,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:21,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:43:21,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:43:21,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:43:21,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:43:21,402 INFO L87 Difference]: Start difference. First operand 14415 states and 18461 transitions. Second operand 5 states. [2019-09-08 06:43:23,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:23,444 INFO L93 Difference]: Finished difference Result 34532 states and 44428 transitions. [2019-09-08 06:43:23,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:43:23,445 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 175 [2019-09-08 06:43:23,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:23,514 INFO L225 Difference]: With dead ends: 34532 [2019-09-08 06:43:23,515 INFO L226 Difference]: Without dead ends: 20145 [2019-09-08 06:43:23,547 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 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:43:23,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20145 states. [2019-09-08 06:43:25,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20145 to 19569. [2019-09-08 06:43:25,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19569 states. [2019-09-08 06:43:25,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19569 states to 19569 states and 24643 transitions. [2019-09-08 06:43:25,482 INFO L78 Accepts]: Start accepts. Automaton has 19569 states and 24643 transitions. Word has length 175 [2019-09-08 06:43:25,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:25,482 INFO L475 AbstractCegarLoop]: Abstraction has 19569 states and 24643 transitions. [2019-09-08 06:43:25,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:43:25,482 INFO L276 IsEmpty]: Start isEmpty. Operand 19569 states and 24643 transitions. [2019-09-08 06:43:25,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 06:43:25,484 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:25,484 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] [2019-09-08 06:43:25,485 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:25,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:25,485 INFO L82 PathProgramCache]: Analyzing trace with hash 284173490, now seen corresponding path program 1 times [2019-09-08 06:43:25,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:25,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:25,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:25,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:25,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:25,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:25,561 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:43:25,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:25,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:43:25,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:43:25,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:43:25,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:43:25,563 INFO L87 Difference]: Start difference. First operand 19569 states and 24643 transitions. Second operand 5 states. [2019-09-08 06:43:27,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:27,854 INFO L93 Difference]: Finished difference Result 39108 states and 49371 transitions. [2019-09-08 06:43:27,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:43:27,855 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 175 [2019-09-08 06:43:27,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:27,913 INFO L225 Difference]: With dead ends: 39108 [2019-09-08 06:43:27,913 INFO L226 Difference]: Without dead ends: 19569 [2019-09-08 06:43:27,943 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:43:27,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19569 states. [2019-09-08 06:43:29,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19569 to 19569. [2019-09-08 06:43:29,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19569 states. [2019-09-08 06:43:30,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19569 states to 19569 states and 24547 transitions. [2019-09-08 06:43:30,266 INFO L78 Accepts]: Start accepts. Automaton has 19569 states and 24547 transitions. Word has length 175 [2019-09-08 06:43:30,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:30,266 INFO L475 AbstractCegarLoop]: Abstraction has 19569 states and 24547 transitions. [2019-09-08 06:43:30,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:43:30,266 INFO L276 IsEmpty]: Start isEmpty. Operand 19569 states and 24547 transitions. [2019-09-08 06:43:30,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 06:43:30,268 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:30,268 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] [2019-09-08 06:43:30,269 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:30,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:30,269 INFO L82 PathProgramCache]: Analyzing trace with hash 943705012, now seen corresponding path program 1 times [2019-09-08 06:43:30,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:30,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:30,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:30,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:30,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:30,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:30,353 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:43:30,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:30,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:43:30,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:43:30,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:43:30,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:43:30,355 INFO L87 Difference]: Start difference. First operand 19569 states and 24547 transitions. Second operand 5 states. [2019-09-08 06:43:32,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:32,062 INFO L93 Difference]: Finished difference Result 39108 states and 49179 transitions. [2019-09-08 06:43:32,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:43:32,063 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 175 [2019-09-08 06:43:32,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:32,116 INFO L225 Difference]: With dead ends: 39108 [2019-09-08 06:43:32,116 INFO L226 Difference]: Without dead ends: 19569 [2019-09-08 06:43:32,141 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:43:32,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19569 states. [2019-09-08 06:43:33,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19569 to 19569. [2019-09-08 06:43:33,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19569 states. [2019-09-08 06:43:33,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19569 states to 19569 states and 24451 transitions. [2019-09-08 06:43:33,643 INFO L78 Accepts]: Start accepts. Automaton has 19569 states and 24451 transitions. Word has length 175 [2019-09-08 06:43:33,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:33,644 INFO L475 AbstractCegarLoop]: Abstraction has 19569 states and 24451 transitions. [2019-09-08 06:43:33,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:43:33,644 INFO L276 IsEmpty]: Start isEmpty. Operand 19569 states and 24451 transitions. [2019-09-08 06:43:33,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 06:43:33,646 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:33,646 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] [2019-09-08 06:43:33,646 INFO L418 AbstractCegarLoop]: === Iteration 38 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:33,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:33,647 INFO L82 PathProgramCache]: Analyzing trace with hash 549338226, now seen corresponding path program 1 times [2019-09-08 06:43:33,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:33,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:33,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:33,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:33,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:33,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:33,721 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:43:33,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:33,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:43:33,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:43:33,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:43:33,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:43:33,723 INFO L87 Difference]: Start difference. First operand 19569 states and 24451 transitions. Second operand 5 states. [2019-09-08 06:43:35,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:35,504 INFO L93 Difference]: Finished difference Result 39108 states and 48987 transitions. [2019-09-08 06:43:35,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:43:35,505 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 175 [2019-09-08 06:43:35,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:35,547 INFO L225 Difference]: With dead ends: 39108 [2019-09-08 06:43:35,547 INFO L226 Difference]: Without dead ends: 19569 [2019-09-08 06:43:35,574 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:43:35,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19569 states. [2019-09-08 06:43:36,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19569 to 19569. [2019-09-08 06:43:36,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19569 states. [2019-09-08 06:43:36,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19569 states to 19569 states and 24355 transitions. [2019-09-08 06:43:36,935 INFO L78 Accepts]: Start accepts. Automaton has 19569 states and 24355 transitions. Word has length 175 [2019-09-08 06:43:36,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:36,935 INFO L475 AbstractCegarLoop]: Abstraction has 19569 states and 24355 transitions. [2019-09-08 06:43:36,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:43:36,935 INFO L276 IsEmpty]: Start isEmpty. Operand 19569 states and 24355 transitions. [2019-09-08 06:43:36,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 06:43:36,937 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:36,937 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] [2019-09-08 06:43:36,937 INFO L418 AbstractCegarLoop]: === Iteration 39 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:36,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:36,938 INFO L82 PathProgramCache]: Analyzing trace with hash -294667276, now seen corresponding path program 1 times [2019-09-08 06:43:36,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:36,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:36,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:36,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:36,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:36,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:37,038 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:43:37,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:37,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:43:37,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:43:37,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:43:37,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:43:37,040 INFO L87 Difference]: Start difference. First operand 19569 states and 24355 transitions. Second operand 5 states. [2019-09-08 06:43:39,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:39,102 INFO L93 Difference]: Finished difference Result 39108 states and 48795 transitions. [2019-09-08 06:43:39,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:43:39,103 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 175 [2019-09-08 06:43:39,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:39,149 INFO L225 Difference]: With dead ends: 39108 [2019-09-08 06:43:39,150 INFO L226 Difference]: Without dead ends: 19569 [2019-09-08 06:43:39,169 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:43:39,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19569 states. [2019-09-08 06:43:40,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19569 to 19569. [2019-09-08 06:43:40,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19569 states. [2019-09-08 06:43:40,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19569 states to 19569 states and 24259 transitions. [2019-09-08 06:43:40,381 INFO L78 Accepts]: Start accepts. Automaton has 19569 states and 24259 transitions. Word has length 175 [2019-09-08 06:43:40,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:40,382 INFO L475 AbstractCegarLoop]: Abstraction has 19569 states and 24259 transitions. [2019-09-08 06:43:40,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:43:40,382 INFO L276 IsEmpty]: Start isEmpty. Operand 19569 states and 24259 transitions. [2019-09-08 06:43:40,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 06:43:40,383 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:40,384 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] [2019-09-08 06:43:40,384 INFO L418 AbstractCegarLoop]: === Iteration 40 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:40,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:40,384 INFO L82 PathProgramCache]: Analyzing trace with hash -367053834, now seen corresponding path program 1 times [2019-09-08 06:43:40,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:40,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:40,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:40,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:40,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:40,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:40,462 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:43:40,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:40,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:43:40,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:43:40,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:43:40,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:43:40,464 INFO L87 Difference]: Start difference. First operand 19569 states and 24259 transitions. Second operand 5 states. [2019-09-08 06:43:43,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:43,209 INFO L93 Difference]: Finished difference Result 43414 states and 55498 transitions. [2019-09-08 06:43:43,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:43:43,209 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 175 [2019-09-08 06:43:43,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:43,294 INFO L225 Difference]: With dead ends: 43414 [2019-09-08 06:43:43,294 INFO L226 Difference]: Without dead ends: 23873 [2019-09-08 06:43:43,344 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:43:43,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23873 states. [2019-09-08 06:43:45,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23873 to 21217. [2019-09-08 06:43:45,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21217 states. [2019-09-08 06:43:46,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21217 states to 21217 states and 25923 transitions. [2019-09-08 06:43:46,004 INFO L78 Accepts]: Start accepts. Automaton has 21217 states and 25923 transitions. Word has length 175 [2019-09-08 06:43:46,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:46,005 INFO L475 AbstractCegarLoop]: Abstraction has 21217 states and 25923 transitions. [2019-09-08 06:43:46,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:43:46,005 INFO L276 IsEmpty]: Start isEmpty. Operand 21217 states and 25923 transitions. [2019-09-08 06:43:46,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 06:43:46,006 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:46,006 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] [2019-09-08 06:43:46,006 INFO L418 AbstractCegarLoop]: === Iteration 41 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:46,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:46,007 INFO L82 PathProgramCache]: Analyzing trace with hash -92294220, now seen corresponding path program 1 times [2019-09-08 06:43:46,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:46,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:46,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:46,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:46,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:46,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:46,086 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:43:46,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:46,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:43:46,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:43:46,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:43:46,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:43:46,088 INFO L87 Difference]: Start difference. First operand 21217 states and 25923 transitions. Second operand 5 states. [2019-09-08 06:43:48,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:48,851 INFO L93 Difference]: Finished difference Result 47612 states and 60584 transitions. [2019-09-08 06:43:48,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:43:48,852 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 175 [2019-09-08 06:43:48,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:48,944 INFO L225 Difference]: With dead ends: 47612 [2019-09-08 06:43:48,944 INFO L226 Difference]: Without dead ends: 26425 [2019-09-08 06:43:48,986 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:43:49,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26425 states. [2019-09-08 06:43:50,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26425 to 24713. [2019-09-08 06:43:50,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24713 states. [2019-09-08 06:43:50,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24713 states to 24713 states and 29707 transitions. [2019-09-08 06:43:50,804 INFO L78 Accepts]: Start accepts. Automaton has 24713 states and 29707 transitions. Word has length 175 [2019-09-08 06:43:50,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:50,805 INFO L475 AbstractCegarLoop]: Abstraction has 24713 states and 29707 transitions. [2019-09-08 06:43:50,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:43:50,805 INFO L276 IsEmpty]: Start isEmpty. Operand 24713 states and 29707 transitions. [2019-09-08 06:43:50,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 06:43:50,806 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:50,806 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] [2019-09-08 06:43:50,806 INFO L418 AbstractCegarLoop]: === Iteration 42 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:50,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:50,807 INFO L82 PathProgramCache]: Analyzing trace with hash 609305654, now seen corresponding path program 1 times [2019-09-08 06:43:50,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:50,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:50,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:50,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:50,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:50,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:50,898 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:43:50,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:50,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:43:50,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:43:50,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:43:50,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:43:50,901 INFO L87 Difference]: Start difference. First operand 24713 states and 29707 transitions. Second operand 5 states. [2019-09-08 06:43:54,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:54,451 INFO L93 Difference]: Finished difference Result 64444 states and 79897 transitions. [2019-09-08 06:43:54,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 06:43:54,456 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 175 [2019-09-08 06:43:54,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:54,570 INFO L225 Difference]: With dead ends: 64444 [2019-09-08 06:43:54,570 INFO L226 Difference]: Without dead ends: 39759 [2019-09-08 06:43:54,616 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 06:43:54,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39759 states. [2019-09-08 06:43:56,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39759 to 33421. [2019-09-08 06:43:56,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33421 states. [2019-09-08 06:43:57,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33421 states to 33421 states and 39755 transitions. [2019-09-08 06:43:57,025 INFO L78 Accepts]: Start accepts. Automaton has 33421 states and 39755 transitions. Word has length 175 [2019-09-08 06:43:57,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:57,026 INFO L475 AbstractCegarLoop]: Abstraction has 33421 states and 39755 transitions. [2019-09-08 06:43:57,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:43:57,026 INFO L276 IsEmpty]: Start isEmpty. Operand 33421 states and 39755 transitions. [2019-09-08 06:43:57,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 06:43:57,028 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:57,029 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] [2019-09-08 06:43:57,029 INFO L418 AbstractCegarLoop]: === Iteration 43 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:57,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:57,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1262446110, now seen corresponding path program 1 times [2019-09-08 06:43:57,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:57,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:57,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:57,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:57,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:57,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:57,104 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:43:57,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:57,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:43:57,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:43:57,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:43:57,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:43:57,105 INFO L87 Difference]: Start difference. First operand 33421 states and 39755 transitions. Second operand 5 states. [2019-09-08 06:44:00,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:44:00,597 INFO L93 Difference]: Finished difference Result 60202 states and 72465 transitions. [2019-09-08 06:44:00,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:44:00,599 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-08 06:44:00,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:44:00,700 INFO L225 Difference]: With dead ends: 60202 [2019-09-08 06:44:00,701 INFO L226 Difference]: Without dead ends: 26809 [2019-09-08 06:44:00,752 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:44:00,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26809 states. [2019-09-08 06:44:02,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26809 to 25961. [2019-09-08 06:44:02,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25961 states. [2019-09-08 06:44:02,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25961 states to 25961 states and 30747 transitions. [2019-09-08 06:44:02,670 INFO L78 Accepts]: Start accepts. Automaton has 25961 states and 30747 transitions. Word has length 176 [2019-09-08 06:44:02,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:44:02,671 INFO L475 AbstractCegarLoop]: Abstraction has 25961 states and 30747 transitions. [2019-09-08 06:44:02,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:44:02,671 INFO L276 IsEmpty]: Start isEmpty. Operand 25961 states and 30747 transitions. [2019-09-08 06:44:02,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 06:44:02,673 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:44:02,673 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] [2019-09-08 06:44:02,673 INFO L418 AbstractCegarLoop]: === Iteration 44 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:44:02,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:44:02,674 INFO L82 PathProgramCache]: Analyzing trace with hash 631937908, now seen corresponding path program 1 times [2019-09-08 06:44:02,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:44:02,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:44:02,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:44:02,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:44:02,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:44:02,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:44:02,766 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:44:02,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:44:02,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:44:02,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:44:02,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:44:02,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:44:02,768 INFO L87 Difference]: Start difference. First operand 25961 states and 30747 transitions. Second operand 5 states. [2019-09-08 06:44:06,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:44:06,198 INFO L93 Difference]: Finished difference Result 56868 states and 69992 transitions. [2019-09-08 06:44:06,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:44:06,199 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 175 [2019-09-08 06:44:06,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:44:06,278 INFO L225 Difference]: With dead ends: 56868 [2019-09-08 06:44:06,278 INFO L226 Difference]: Without dead ends: 30937 [2019-09-08 06:44:06,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:44:06,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30937 states. [2019-09-08 06:44:09,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30937 to 29097. [2019-09-08 06:44:09,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29097 states. [2019-09-08 06:44:09,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29097 states to 29097 states and 34027 transitions. [2019-09-08 06:44:09,624 INFO L78 Accepts]: Start accepts. Automaton has 29097 states and 34027 transitions. Word has length 175 [2019-09-08 06:44:09,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:44:09,624 INFO L475 AbstractCegarLoop]: Abstraction has 29097 states and 34027 transitions. [2019-09-08 06:44:09,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:44:09,624 INFO L276 IsEmpty]: Start isEmpty. Operand 29097 states and 34027 transitions. [2019-09-08 06:44:09,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 06:44:09,625 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:44:09,625 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] [2019-09-08 06:44:09,625 INFO L418 AbstractCegarLoop]: === Iteration 45 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:44:09,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:44:09,626 INFO L82 PathProgramCache]: Analyzing trace with hash 2018141302, now seen corresponding path program 1 times [2019-09-08 06:44:09,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:44:09,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:44:09,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:44:09,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:44:09,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:44:09,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:44:09,712 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:44:09,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:44:09,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:44:09,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:44:09,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:44:09,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:44:09,713 INFO L87 Difference]: Start difference. First operand 29097 states and 34027 transitions. Second operand 5 states. [2019-09-08 06:44:13,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:44:13,018 INFO L93 Difference]: Finished difference Result 60340 states and 72219 transitions. [2019-09-08 06:44:13,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:44:13,019 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 175 [2019-09-08 06:44:13,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:44:13,085 INFO L225 Difference]: With dead ends: 60340 [2019-09-08 06:44:13,085 INFO L226 Difference]: Without dead ends: 31273 [2019-09-08 06:44:13,123 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:44:13,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31273 states. [2019-09-08 06:44:15,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31273 to 30417. [2019-09-08 06:44:15,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30417 states. [2019-09-08 06:44:15,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30417 states to 30417 states and 35227 transitions. [2019-09-08 06:44:15,436 INFO L78 Accepts]: Start accepts. Automaton has 30417 states and 35227 transitions. Word has length 175 [2019-09-08 06:44:15,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:44:15,436 INFO L475 AbstractCegarLoop]: Abstraction has 30417 states and 35227 transitions. [2019-09-08 06:44:15,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:44:15,437 INFO L276 IsEmpty]: Start isEmpty. Operand 30417 states and 35227 transitions. [2019-09-08 06:44:15,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 06:44:15,438 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:44:15,438 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] [2019-09-08 06:44:15,438 INFO L418 AbstractCegarLoop]: === Iteration 46 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:44:15,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:44:15,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1508668212, now seen corresponding path program 1 times [2019-09-08 06:44:15,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:44:15,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:44:15,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:44:15,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:44:15,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:44:15,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:44:15,514 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:44:15,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:44:15,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:44:15,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:44:15,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:44:15,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:44:15,515 INFO L87 Difference]: Start difference. First operand 30417 states and 35227 transitions. Second operand 5 states. [2019-09-08 06:44:20,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:44:20,048 INFO L93 Difference]: Finished difference Result 63126 states and 75418 transitions. [2019-09-08 06:44:20,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:44:20,048 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 175 [2019-09-08 06:44:20,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:44:20,119 INFO L225 Difference]: With dead ends: 63126 [2019-09-08 06:44:20,120 INFO L226 Difference]: Without dead ends: 32737 [2019-09-08 06:44:20,159 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:44:20,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32737 states. [2019-09-08 06:44:22,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32737 to 31185. [2019-09-08 06:44:22,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31185 states. [2019-09-08 06:44:22,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31185 states to 31185 states and 35659 transitions. [2019-09-08 06:44:22,480 INFO L78 Accepts]: Start accepts. Automaton has 31185 states and 35659 transitions. Word has length 175 [2019-09-08 06:44:22,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:44:22,480 INFO L475 AbstractCegarLoop]: Abstraction has 31185 states and 35659 transitions. [2019-09-08 06:44:22,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:44:22,480 INFO L276 IsEmpty]: Start isEmpty. Operand 31185 states and 35659 transitions. [2019-09-08 06:44:22,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 06:44:22,481 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:44:22,482 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] [2019-09-08 06:44:22,482 INFO L418 AbstractCegarLoop]: === Iteration 47 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:44:22,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:44:22,482 INFO L82 PathProgramCache]: Analyzing trace with hash -863071050, now seen corresponding path program 1 times [2019-09-08 06:44:22,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:44:22,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:44:22,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:44:22,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:44:22,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:44:22,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:44:22,556 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:44:22,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:44:22,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:44:22,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:44:22,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:44:22,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:44:22,558 INFO L87 Difference]: Start difference. First operand 31185 states and 35659 transitions. Second operand 5 states. [2019-09-08 06:44:26,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:44:26,432 INFO L93 Difference]: Finished difference Result 66836 states and 79280 transitions. [2019-09-08 06:44:26,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:44:26,433 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 175 [2019-09-08 06:44:26,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:44:26,518 INFO L225 Difference]: With dead ends: 66836 [2019-09-08 06:44:26,519 INFO L226 Difference]: Without dead ends: 35681 [2019-09-08 06:44:26,560 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:44:26,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35681 states. [2019-09-08 06:44:29,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35681 to 33841. [2019-09-08 06:44:29,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33841 states. [2019-09-08 06:44:29,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33841 states to 33841 states and 38267 transitions. [2019-09-08 06:44:29,241 INFO L78 Accepts]: Start accepts. Automaton has 33841 states and 38267 transitions. Word has length 175 [2019-09-08 06:44:29,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:44:29,241 INFO L475 AbstractCegarLoop]: Abstraction has 33841 states and 38267 transitions. [2019-09-08 06:44:29,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:44:29,241 INFO L276 IsEmpty]: Start isEmpty. Operand 33841 states and 38267 transitions. [2019-09-08 06:44:29,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 06:44:29,242 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:44:29,243 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] [2019-09-08 06:44:29,243 INFO L418 AbstractCegarLoop]: === Iteration 48 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:44:29,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:44:29,243 INFO L82 PathProgramCache]: Analyzing trace with hash -722522440, now seen corresponding path program 1 times [2019-09-08 06:44:29,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:44:29,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:44:29,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:44:29,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:44:29,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:44:29,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:44:29,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:44:29,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:44:29,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:44:29,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:44:29,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:44:29,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:44:29,320 INFO L87 Difference]: Start difference. First operand 33841 states and 38267 transitions. Second operand 5 states. [2019-09-08 06:44:33,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:44:33,946 INFO L93 Difference]: Finished difference Result 69468 states and 80371 transitions. [2019-09-08 06:44:33,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:44:33,946 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 175 [2019-09-08 06:44:33,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:44:34,047 INFO L225 Difference]: With dead ends: 69468 [2019-09-08 06:44:34,047 INFO L226 Difference]: Without dead ends: 35657 [2019-09-08 06:44:34,105 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:44:34,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35657 states. [2019-09-08 06:44:36,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35657 to 34801. [2019-09-08 06:44:36,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34801 states. [2019-09-08 06:44:36,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34801 states to 34801 states and 38963 transitions. [2019-09-08 06:44:36,806 INFO L78 Accepts]: Start accepts. Automaton has 34801 states and 38963 transitions. Word has length 175 [2019-09-08 06:44:36,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:44:36,807 INFO L475 AbstractCegarLoop]: Abstraction has 34801 states and 38963 transitions. [2019-09-08 06:44:36,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:44:36,807 INFO L276 IsEmpty]: Start isEmpty. Operand 34801 states and 38963 transitions. [2019-09-08 06:44:36,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 06:44:36,809 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:44:36,809 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] [2019-09-08 06:44:36,809 INFO L418 AbstractCegarLoop]: === Iteration 49 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:44:36,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:44:36,809 INFO L82 PathProgramCache]: Analyzing trace with hash -856535946, now seen corresponding path program 1 times [2019-09-08 06:44:36,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:44:36,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:44:36,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:44:36,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:44:36,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:44:36,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:44:36,898 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:44:36,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:44:36,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:44:36,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:44:36,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:44:36,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:44:36,900 INFO L87 Difference]: Start difference. First operand 34801 states and 38963 transitions. Second operand 3 states. [2019-09-08 06:44:42,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:44:42,262 INFO L93 Difference]: Finished difference Result 103798 states and 119566 transitions. [2019-09-08 06:44:42,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:44:42,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-09-08 06:44:42,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:44:42,612 INFO L225 Difference]: With dead ends: 103798 [2019-09-08 06:44:42,612 INFO L226 Difference]: Without dead ends: 69025 [2019-09-08 06:44:42,672 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:44:42,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69025 states. [2019-09-08 06:44:49,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69025 to 68993. [2019-09-08 06:44:49,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68993 states. [2019-09-08 06:44:49,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68993 states to 68993 states and 78556 transitions. [2019-09-08 06:44:49,986 INFO L78 Accepts]: Start accepts. Automaton has 68993 states and 78556 transitions. Word has length 175 [2019-09-08 06:44:49,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:44:49,987 INFO L475 AbstractCegarLoop]: Abstraction has 68993 states and 78556 transitions. [2019-09-08 06:44:49,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:44:49,987 INFO L276 IsEmpty]: Start isEmpty. Operand 68993 states and 78556 transitions. [2019-09-08 06:44:50,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-09-08 06:44:50,052 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:44:50,053 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:50,053 INFO L418 AbstractCegarLoop]: === Iteration 50 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:44:50,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:44:50,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1859735219, now seen corresponding path program 1 times [2019-09-08 06:44:50,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:44:50,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:44:50,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:44:50,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:44:50,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:44:50,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:44:50,150 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-08 06:44:50,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:44:50,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:44:50,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:44:50,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:44:50,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:44:50,152 INFO L87 Difference]: Start difference. First operand 68993 states and 78556 transitions. Second operand 4 states. [2019-09-08 06:45:02,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:45:02,463 INFO L93 Difference]: Finished difference Result 185691 states and 213391 transitions. [2019-09-08 06:45:02,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:45:02,464 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 289 [2019-09-08 06:45:02,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:45:02,761 INFO L225 Difference]: With dead ends: 185691 [2019-09-08 06:45:02,761 INFO L226 Difference]: Without dead ends: 85753 [2019-09-08 06:45:03,003 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:45:03,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85753 states. [2019-09-08 06:45:09,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85753 to 83901. [2019-09-08 06:45:09,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83901 states. [2019-09-08 06:45:09,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83901 states to 83901 states and 94705 transitions. [2019-09-08 06:45:09,812 INFO L78 Accepts]: Start accepts. Automaton has 83901 states and 94705 transitions. Word has length 289 [2019-09-08 06:45:09,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:45:09,812 INFO L475 AbstractCegarLoop]: Abstraction has 83901 states and 94705 transitions. [2019-09-08 06:45:09,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:45:09,813 INFO L276 IsEmpty]: Start isEmpty. Operand 83901 states and 94705 transitions. [2019-09-08 06:45:09,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2019-09-08 06:45:09,960 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:45:09,961 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2019-09-08 06:45:09,961 INFO L418 AbstractCegarLoop]: === Iteration 51 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:45:09,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:45:09,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1326430488, now seen corresponding path program 1 times [2019-09-08 06:45:09,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:45:09,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:45:09,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:45:09,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:45:09,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:45:09,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:45:10,113 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 28 proven. 8 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2019-09-08 06:45:10,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:45:10,114 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:45:10,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:45:10,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:45:10,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 2131 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 06:45:10,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:45:10,939 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream closed [2019-09-08 06:45:10,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:45:10,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-09-08 06:45:10,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:45:10,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:45:10,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:45:10,958 INFO L87 Difference]: Start difference. First operand 83901 states and 94705 transitions. Second operand 6 states. [2019-09-08 06:45:37,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:45:37,261 INFO L93 Difference]: Finished difference Result 318792 states and 372350 transitions. [2019-09-08 06:45:37,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:45:37,262 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 414 [2019-09-08 06:45:37,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:45:38,582 INFO L225 Difference]: With dead ends: 318792 [2019-09-08 06:45:38,582 INFO L226 Difference]: Without dead ends: 182457 [2019-09-08 06:45:39,023 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:45:39,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182457 states. [2019-09-08 06:46:03,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182457 to 181728. [2019-09-08 06:46:03,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181728 states. [2019-09-08 06:46:04,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181728 states to 181728 states and 209833 transitions. [2019-09-08 06:46:04,377 INFO L78 Accepts]: Start accepts. Automaton has 181728 states and 209833 transitions. Word has length 414 [2019-09-08 06:46:04,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:46:04,378 INFO L475 AbstractCegarLoop]: Abstraction has 181728 states and 209833 transitions. [2019-09-08 06:46:04,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:46:04,378 INFO L276 IsEmpty]: Start isEmpty. Operand 181728 states and 209833 transitions. [2019-09-08 06:46:04,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 714 [2019-09-08 06:46:04,695 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:46:04,696 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:04,696 INFO L418 AbstractCegarLoop]: === Iteration 52 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:46:04,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:46:04,697 INFO L82 PathProgramCache]: Analyzing trace with hash 769540777, now seen corresponding path program 1 times [2019-09-08 06:46:04,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:46:04,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:46:04,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:46:04,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:46:04,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:46:04,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:46:05,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1087 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 1040 trivial. 0 not checked. [2019-09-08 06:46:05,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:46:05,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:46:05,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:46:05,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:46:05,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:46:05,142 INFO L87 Difference]: Start difference. First operand 181728 states and 209833 transitions. Second operand 4 states. [2019-09-08 06:46:22,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:46:22,142 INFO L93 Difference]: Finished difference Result 181731 states and 209835 transitions. [2019-09-08 06:46:22,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:46:22,143 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 713 [2019-09-08 06:46:22,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:46:22,661 INFO L225 Difference]: With dead ends: 181731 [2019-09-08 06:46:22,661 INFO L226 Difference]: Without dead ends: 135654 [2019-09-08 06:46:22,749 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:46:22,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135654 states. [2019-09-08 06:46:35,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135654 to 135654. [2019-09-08 06:46:35,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135654 states. [2019-09-08 06:46:35,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135654 states to 135654 states and 157951 transitions. [2019-09-08 06:46:35,741 INFO L78 Accepts]: Start accepts. Automaton has 135654 states and 157951 transitions. Word has length 713 [2019-09-08 06:46:35,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:46:35,742 INFO L475 AbstractCegarLoop]: Abstraction has 135654 states and 157951 transitions. [2019-09-08 06:46:35,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:46:35,742 INFO L276 IsEmpty]: Start isEmpty. Operand 135654 states and 157951 transitions. [2019-09-08 06:46:35,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 720 [2019-09-08 06:46:35,970 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:46:35,970 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 06:46:35,970 INFO L418 AbstractCegarLoop]: === Iteration 53 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:46:35,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:46:35,971 INFO L82 PathProgramCache]: Analyzing trace with hash 601236553, now seen corresponding path program 1 times [2019-09-08 06:46:35,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:46:35,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:46:35,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:46:35,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:46:35,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:46:36,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:46:36,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1099 backedges. 54 proven. 32 refuted. 0 times theorem prover too weak. 1013 trivial. 0 not checked. [2019-09-08 06:46:36,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:46:36,326 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:46:36,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:46:36,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:46:36,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 3171 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 06:46:36,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:46:40,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1099 backedges. 636 proven. 0 refuted. 0 times theorem prover too weak. 463 trivial. 0 not checked. [2019-09-08 06:46:40,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:46:40,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-09-08 06:46:40,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 06:46:40,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 06:46:40,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 06:46:40,640 INFO L87 Difference]: Start difference. First operand 135654 states and 157951 transitions. Second operand 9 states. [2019-09-08 06:47:00,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:47:00,953 INFO L93 Difference]: Finished difference Result 347670 states and 411657 transitions. [2019-09-08 06:47:00,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 06:47:00,954 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 719 [2019-09-08 06:47:00,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:47:02,046 INFO L225 Difference]: With dead ends: 347670 [2019-09-08 06:47:02,046 INFO L226 Difference]: Without dead ends: 182861 [2019-09-08 06:47:02,351 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 742 GetRequests, 725 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2019-09-08 06:47:02,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182861 states. [2019-09-08 06:47:24,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182861 to 177439. [2019-09-08 06:47:24,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177439 states. [2019-09-08 06:47:25,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177439 states to 177439 states and 204655 transitions. [2019-09-08 06:47:25,055 INFO L78 Accepts]: Start accepts. Automaton has 177439 states and 204655 transitions. Word has length 719 [2019-09-08 06:47:25,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:47:25,056 INFO L475 AbstractCegarLoop]: Abstraction has 177439 states and 204655 transitions. [2019-09-08 06:47:25,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 06:47:25,056 INFO L276 IsEmpty]: Start isEmpty. Operand 177439 states and 204655 transitions. [2019-09-08 06:47:25,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 625 [2019-09-08 06:47:25,276 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:47:25,276 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:25,276 INFO L418 AbstractCegarLoop]: === Iteration 54 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:47:25,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:47:25,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1909212517, now seen corresponding path program 1 times [2019-09-08 06:47:25,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:47:25,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:47:25,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:47:25,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:47:25,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:47:25,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:47:25,528 INFO L134 CoverageAnalysis]: Checked inductivity of 911 backedges. 31 proven. 10 refuted. 0 times theorem prover too weak. 870 trivial. 0 not checked. [2019-09-08 06:47:25,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:47:25,528 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:47:25,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:47:25,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:47:25,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 2857 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:47:25,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:47:26,560 INFO L134 CoverageAnalysis]: Checked inductivity of 911 backedges. 665 proven. 0 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2019-09-08 06:47:26,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:47:26,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-08 06:47:26,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:47:26,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:47:26,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:47:26,572 INFO L87 Difference]: Start difference. First operand 177439 states and 204655 transitions. Second operand 5 states. [2019-09-08 06:48:22,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:48:22,562 INFO L93 Difference]: Finished difference Result 612106 states and 767824 transitions. [2019-09-08 06:48:22,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 06:48:22,562 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 624 [2019-09-08 06:48:22,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:48:23,996 INFO L225 Difference]: With dead ends: 612106 [2019-09-08 06:48:23,996 INFO L226 Difference]: Without dead ends: 434871 [2019-09-08 06:48:25,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 638 GetRequests, 631 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 06:48:25,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434871 states. [2019-09-08 06:49:27,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434871 to 429336. [2019-09-08 06:49:27,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429336 states. [2019-09-08 06:49:29,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429336 states to 429336 states and 520396 transitions. [2019-09-08 06:49:30,024 INFO L78 Accepts]: Start accepts. Automaton has 429336 states and 520396 transitions. Word has length 624 [2019-09-08 06:49:30,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:49:30,024 INFO L475 AbstractCegarLoop]: Abstraction has 429336 states and 520396 transitions. [2019-09-08 06:49:30,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:49:30,024 INFO L276 IsEmpty]: Start isEmpty. Operand 429336 states and 520396 transitions. [2019-09-08 06:49:31,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 626 [2019-09-08 06:49:31,033 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:31,033 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:31,033 INFO L418 AbstractCegarLoop]: === Iteration 55 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:31,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:31,034 INFO L82 PathProgramCache]: Analyzing trace with hash 296274831, now seen corresponding path program 1 times [2019-09-08 06:49:31,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:31,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:31,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:31,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:31,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:31,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:31,377 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 911 trivial. 0 not checked. [2019-09-08 06:49:31,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:49:31,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:49:31,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:49:31,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:49:31,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:49:31,380 INFO L87 Difference]: Start difference. First operand 429336 states and 520396 transitions. Second operand 4 states. [2019-09-08 06:50:29,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:50:29,977 INFO L93 Difference]: Finished difference Result 823461 states and 998645 transitions. [2019-09-08 06:50:29,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:50:29,977 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 625 [2019-09-08 06:50:29,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:50:31,592 INFO L225 Difference]: With dead ends: 823461 [2019-09-08 06:50:31,592 INFO L226 Difference]: Without dead ends: 429083 [2019-09-08 06:50:33,688 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:33,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429083 states. [2019-09-08 06:51:38,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429083 to 429075. [2019-09-08 06:51:38,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429075 states. [2019-09-08 06:51:40,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429075 states to 429075 states and 519902 transitions. [2019-09-08 06:51:41,029 INFO L78 Accepts]: Start accepts. Automaton has 429075 states and 519902 transitions. Word has length 625 [2019-09-08 06:51:41,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:41,029 INFO L475 AbstractCegarLoop]: Abstraction has 429075 states and 519902 transitions. [2019-09-08 06:51:41,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:51:41,029 INFO L276 IsEmpty]: Start isEmpty. Operand 429075 states and 519902 transitions. [2019-09-08 06:51:41,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 626 [2019-09-08 06:51:41,911 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:41,911 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41,911 INFO L418 AbstractCegarLoop]: === Iteration 56 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:41,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:41,912 INFO L82 PathProgramCache]: Analyzing trace with hash -928377207, now seen corresponding path program 1 times [2019-09-08 06:51:41,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:41,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:41,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:41,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:41,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:41,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:42,241 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 1 proven. 56 refuted. 0 times theorem prover too weak. 855 trivial. 0 not checked. [2019-09-08 06:51:42,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:51:42,241 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) [2019-09-08 06:51:42,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:51:42,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:42,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 2884 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 06:51:42,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:51:44,036 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 231 proven. 0 refuted. 0 times theorem prover too weak. 681 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 06:51:44,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:51:44,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-08 06:51:44,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:44,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:44,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:44,056 INFO L87 Difference]: Start difference. First operand 429075 states and 519902 transitions. Second operand 5 states. [2019-09-08 06:52:40,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:52:40,394 INFO L93 Difference]: Finished difference Result 775486 states and 937908 transitions. [2019-09-08 06:52:40,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:52:40,395 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 625 [2019-09-08 06:52:40,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:52:41,610 INFO L225 Difference]: With dead ends: 775486 [2019-09-08 06:52:41,610 INFO L226 Difference]: Without dead ends: 381349 [2019-09-08 06:52:42,453 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 630 GetRequests, 626 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:52:42,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381349 states.