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.07.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 06:40:48,489 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 06:40:48,491 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 06:40:48,503 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 06:40:48,503 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 06:40:48,504 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 06:40:48,506 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 06:40:48,508 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 06:40:48,518 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 06:40:48,521 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 06:40:48,524 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 06:40:48,526 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 06:40:48,526 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 06:40:48,528 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 06:40:48,530 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 06:40:48,531 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 06:40:48,533 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 06:40:48,535 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 06:40:48,537 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 06:40:48,542 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 06:40:48,545 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 06:40:48,547 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 06:40:48,550 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 06:40:48,551 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 06:40:48,553 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 06:40:48,553 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 06:40:48,553 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 06:40:48,555 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 06:40:48,557 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 06:40:48,558 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 06:40:48,558 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 06:40:48,560 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 06:40:48,561 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 06:40:48,561 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 06:40:48,563 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 06:40:48,563 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 06:40:48,564 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 06:40:48,564 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 06:40:48,565 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 06:40:48,565 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 06:40:48,566 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 06:40:48,567 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:40:48,601 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 06:40:48,601 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 06:40:48,605 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 06:40:48,606 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 06:40:48,606 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 06:40:48,606 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 06:40:48,606 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 06:40:48,606 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 06:40:48,607 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 06:40:48,607 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 06:40:48,607 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 06:40:48,609 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 06:40:48,610 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 06:40:48,610 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 06:40:48,610 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 06:40:48,610 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 06:40:48,610 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 06:40:48,611 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 06:40:48,611 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 06:40:48,611 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 06:40:48,611 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 06:40:48,611 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 06:40:48,612 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 06:40:48,612 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 06:40:48,613 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 06:40:48,613 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 06:40:48,613 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 06:40:48,613 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 06:40:48,613 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 06:40:48,661 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 06:40:48,678 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 06:40:48,682 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 06:40:48,683 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 06:40:48,683 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 06:40:48,684 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.07.cil-1.c [2019-09-08 06:40:48,744 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c247d278a/8a3f28dfe2c24ad4b3dbe58626ac4d6f/FLAG2d4a95477 [2019-09-08 06:40:49,177 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 06:40:49,178 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.07.cil-1.c [2019-09-08 06:40:49,192 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c247d278a/8a3f28dfe2c24ad4b3dbe58626ac4d6f/FLAG2d4a95477 [2019-09-08 06:40:49,579 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c247d278a/8a3f28dfe2c24ad4b3dbe58626ac4d6f [2019-09-08 06:40:49,588 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 06:40:49,589 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 06:40:49,590 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 06:40:49,591 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 06:40:49,594 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 06:40:49,595 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:40:49" (1/1) ... [2019-09-08 06:40:49,598 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b4d15ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:40:49, skipping insertion in model container [2019-09-08 06:40:49,598 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:40:49" (1/1) ... [2019-09-08 06:40:49,606 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 06:40:49,648 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 06:40:50,041 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:40:50,050 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 06:40:50,114 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:40:50,145 INFO L192 MainTranslator]: Completed translation [2019-09-08 06:40:50,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:40:50 WrapperNode [2019-09-08 06:40:50,146 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 06:40:50,146 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 06:40:50,146 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 06:40:50,146 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 06:40:50,156 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:40:50" (1/1) ... [2019-09-08 06:40:50,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:40:50" (1/1) ... [2019-09-08 06:40:50,168 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:40:50" (1/1) ... [2019-09-08 06:40:50,168 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:40:50" (1/1) ... [2019-09-08 06:40:50,189 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:40:50" (1/1) ... [2019-09-08 06:40:50,211 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:40:50" (1/1) ... [2019-09-08 06:40:50,214 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:40:50" (1/1) ... [2019-09-08 06:40:50,220 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 06:40:50,227 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 06:40:50,227 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 06:40:50,227 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 06:40:50,228 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:40:50" (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:40:50,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 06:40:50,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 06:40:50,277 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-09-08 06:40:50,277 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-09-08 06:40:50,277 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-09-08 06:40:50,277 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-09-08 06:40:50,277 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-09-08 06:40:50,277 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit4 [2019-09-08 06:40:50,278 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit5 [2019-09-08 06:40:50,278 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit6 [2019-09-08 06:40:50,278 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit7 [2019-09-08 06:40:50,278 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-09-08 06:40:50,278 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-09-08 06:40:50,278 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-09-08 06:40:50,279 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-09-08 06:40:50,279 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit4_triggered [2019-09-08 06:40:50,279 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit5_triggered [2019-09-08 06:40:50,279 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit6_triggered [2019-09-08 06:40:50,279 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit7_triggered [2019-09-08 06:40:50,279 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-09-08 06:40:50,280 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-09-08 06:40:50,280 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-09-08 06:40:50,280 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-09-08 06:40:50,280 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-09-08 06:40:50,280 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-09-08 06:40:50,280 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-09-08 06:40:50,281 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-09-08 06:40:50,281 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-09-08 06:40:50,281 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-09-08 06:40:50,281 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-09-08 06:40:50,281 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-09-08 06:40:50,281 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-09-08 06:40:50,282 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 06:40:50,282 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 06:40:50,282 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-09-08 06:40:50,282 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-09-08 06:40:50,282 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-09-08 06:40:50,282 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-09-08 06:40:50,282 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-09-08 06:40:50,283 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit4_triggered [2019-09-08 06:40:50,283 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit5_triggered [2019-09-08 06:40:50,283 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit6_triggered [2019-09-08 06:40:50,283 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit7_triggered [2019-09-08 06:40:50,283 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-09-08 06:40:50,283 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 06:40:50,284 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-09-08 06:40:50,284 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-09-08 06:40:50,284 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-09-08 06:40:50,284 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-09-08 06:40:50,284 INFO L130 BoogieDeclarations]: Found specification of procedure transmit4 [2019-09-08 06:40:50,284 INFO L130 BoogieDeclarations]: Found specification of procedure transmit5 [2019-09-08 06:40:50,284 INFO L130 BoogieDeclarations]: Found specification of procedure transmit6 [2019-09-08 06:40:50,285 INFO L130 BoogieDeclarations]: Found specification of procedure transmit7 [2019-09-08 06:40:50,285 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-09-08 06:40:50,285 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-09-08 06:40:50,285 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-09-08 06:40:50,285 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-09-08 06:40:50,286 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-09-08 06:40:50,286 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-09-08 06:40:50,286 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-09-08 06:40:50,286 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-09-08 06:40:50,286 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-09-08 06:40:50,286 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-09-08 06:40:50,286 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-09-08 06:40:50,287 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-09-08 06:40:50,287 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 06:40:50,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 06:40:50,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 06:40:51,238 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 06:40:51,239 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-08 06:40:51,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:40:51 BoogieIcfgContainer [2019-09-08 06:40:51,240 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 06:40:51,241 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 06:40:51,242 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 06:40:51,247 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 06:40:51,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 06:40:49" (1/3) ... [2019-09-08 06:40:51,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@453bc0ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:40:51, skipping insertion in model container [2019-09-08 06:40:51,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:40:50" (2/3) ... [2019-09-08 06:40:51,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@453bc0ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:40:51, skipping insertion in model container [2019-09-08 06:40:51,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:40:51" (3/3) ... [2019-09-08 06:40:51,252 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.07.cil-1.c [2019-09-08 06:40:51,262 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 06:40:51,270 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 06:40:51,287 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 06:40:51,322 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 06:40:51,323 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 06:40:51,324 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 06:40:51,324 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 06:40:51,324 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 06:40:51,324 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 06:40:51,325 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 06:40:51,325 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 06:40:51,325 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 06:40:51,375 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states. [2019-09-08 06:40:51,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 06:40:51,399 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:40:51,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] [2019-09-08 06:40:51,404 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:40:51,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:40:51,410 INFO L82 PathProgramCache]: Analyzing trace with hash -684252572, now seen corresponding path program 1 times [2019-09-08 06:40:51,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:40:51,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:40:51,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:40:51,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:40:51,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:40:51,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:40:51,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:40:51,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:40:51,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:40:51,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:40:51,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:40:51,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:40:51,895 INFO L87 Difference]: Start difference. First operand 324 states. Second operand 4 states. [2019-09-08 06:40:52,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:40:52,222 INFO L93 Difference]: Finished difference Result 629 states and 953 transitions. [2019-09-08 06:40:52,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:40:52,223 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-09-08 06:40:52,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:40:52,239 INFO L225 Difference]: With dead ends: 629 [2019-09-08 06:40:52,240 INFO L226 Difference]: Without dead ends: 315 [2019-09-08 06:40:52,247 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:40:52,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-09-08 06:40:52,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2019-09-08 06:40:52,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-09-08 06:40:52,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 452 transitions. [2019-09-08 06:40:52,338 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 452 transitions. Word has length 161 [2019-09-08 06:40:52,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:40:52,339 INFO L475 AbstractCegarLoop]: Abstraction has 315 states and 452 transitions. [2019-09-08 06:40:52,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:40:52,340 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 452 transitions. [2019-09-08 06:40:52,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 06:40:52,344 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:40:52,345 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] [2019-09-08 06:40:52,345 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:40:52,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:40:52,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1110807070, now seen corresponding path program 1 times [2019-09-08 06:40:52,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:40:52,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:40:52,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:40:52,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:40:52,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:40:52,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:40:52,598 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:40:52,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:40:52,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:40:52,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:40:52,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:40:52,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:40:52,613 INFO L87 Difference]: Start difference. First operand 315 states and 452 transitions. Second operand 5 states. [2019-09-08 06:40:53,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:40:53,382 INFO L93 Difference]: Finished difference Result 655 states and 964 transitions. [2019-09-08 06:40:53,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:40:53,382 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 161 [2019-09-08 06:40:53,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:40:53,387 INFO L225 Difference]: With dead ends: 655 [2019-09-08 06:40:53,387 INFO L226 Difference]: Without dead ends: 365 [2019-09-08 06:40:53,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:40:53,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-09-08 06:40:53,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 315. [2019-09-08 06:40:53,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-09-08 06:40:53,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 451 transitions. [2019-09-08 06:40:53,450 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 451 transitions. Word has length 161 [2019-09-08 06:40:53,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:40:53,451 INFO L475 AbstractCegarLoop]: Abstraction has 315 states and 451 transitions. [2019-09-08 06:40:53,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:40:53,452 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 451 transitions. [2019-09-08 06:40:53,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 06:40:53,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:40:53,457 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] [2019-09-08 06:40:53,460 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:40:53,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:40:53,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1566719776, now seen corresponding path program 1 times [2019-09-08 06:40:53,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:40:53,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:40:53,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:40:53,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:40:53,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:40:53,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:40:53,665 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:40:53,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:40:53,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:40:53,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:40:53,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:40:53,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:40:53,668 INFO L87 Difference]: Start difference. First operand 315 states and 451 transitions. Second operand 5 states. [2019-09-08 06:40:54,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:40:54,351 INFO L93 Difference]: Finished difference Result 655 states and 963 transitions. [2019-09-08 06:40:54,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:40:54,351 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 161 [2019-09-08 06:40:54,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:40:54,355 INFO L225 Difference]: With dead ends: 655 [2019-09-08 06:40:54,355 INFO L226 Difference]: Without dead ends: 365 [2019-09-08 06:40:54,356 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:40:54,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-09-08 06:40:54,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 315. [2019-09-08 06:40:54,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-09-08 06:40:54,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 450 transitions. [2019-09-08 06:40:54,383 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 450 transitions. Word has length 161 [2019-09-08 06:40:54,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:40:54,384 INFO L475 AbstractCegarLoop]: Abstraction has 315 states and 450 transitions. [2019-09-08 06:40:54,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:40:54,384 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 450 transitions. [2019-09-08 06:40:54,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 06:40:54,387 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:40:54,387 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] [2019-09-08 06:40:54,387 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:40:54,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:40:54,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1930186274, now seen corresponding path program 1 times [2019-09-08 06:40:54,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:40:54,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:40:54,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:40:54,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:40:54,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:40:54,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:40:54,509 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:40:54,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:40:54,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:40:54,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:40:54,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:40:54,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:40:54,513 INFO L87 Difference]: Start difference. First operand 315 states and 450 transitions. Second operand 5 states. [2019-09-08 06:40:55,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:40:55,149 INFO L93 Difference]: Finished difference Result 653 states and 957 transitions. [2019-09-08 06:40:55,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:40:55,150 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 161 [2019-09-08 06:40:55,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:40:55,154 INFO L225 Difference]: With dead ends: 653 [2019-09-08 06:40:55,154 INFO L226 Difference]: Without dead ends: 363 [2019-09-08 06:40:55,155 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:40:55,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-09-08 06:40:55,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 315. [2019-09-08 06:40:55,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-09-08 06:40:55,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 449 transitions. [2019-09-08 06:40:55,182 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 449 transitions. Word has length 161 [2019-09-08 06:40:55,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:40:55,183 INFO L475 AbstractCegarLoop]: Abstraction has 315 states and 449 transitions. [2019-09-08 06:40:55,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:40:55,183 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 449 transitions. [2019-09-08 06:40:55,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 06:40:55,185 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:40:55,186 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] [2019-09-08 06:40:55,186 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:40:55,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:40:55,186 INFO L82 PathProgramCache]: Analyzing trace with hash -2075961632, now seen corresponding path program 1 times [2019-09-08 06:40:55,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:40:55,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:40:55,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:40:55,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:40:55,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:40:55,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:40:55,297 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:40:55,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:40:55,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:40:55,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:40:55,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:40:55,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:40:55,300 INFO L87 Difference]: Start difference. First operand 315 states and 449 transitions. Second operand 5 states. [2019-09-08 06:40:55,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:40:55,942 INFO L93 Difference]: Finished difference Result 651 states and 951 transitions. [2019-09-08 06:40:55,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:40:55,943 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 161 [2019-09-08 06:40:55,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:40:55,947 INFO L225 Difference]: With dead ends: 651 [2019-09-08 06:40:55,948 INFO L226 Difference]: Without dead ends: 361 [2019-09-08 06:40:55,950 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:40:55,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-09-08 06:40:55,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 315. [2019-09-08 06:40:55,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-09-08 06:40:55,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 448 transitions. [2019-09-08 06:40:55,981 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 448 transitions. Word has length 161 [2019-09-08 06:40:55,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:40:55,983 INFO L475 AbstractCegarLoop]: Abstraction has 315 states and 448 transitions. [2019-09-08 06:40:55,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:40:55,983 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 448 transitions. [2019-09-08 06:40:55,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 06:40:55,986 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:40:55,986 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] [2019-09-08 06:40:55,986 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:40:55,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:40:55,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1674133090, now seen corresponding path program 1 times [2019-09-08 06:40:55,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:40:55,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:40:55,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:40:55,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:40:55,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:40:56,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:40:56,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:40:56,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:40:56,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:40:56,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:40:56,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:40:56,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:40:56,101 INFO L87 Difference]: Start difference. First operand 315 states and 448 transitions. Second operand 5 states. [2019-09-08 06:40:56,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:40:56,727 INFO L93 Difference]: Finished difference Result 649 states and 945 transitions. [2019-09-08 06:40:56,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:40:56,727 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 161 [2019-09-08 06:40:56,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:40:56,731 INFO L225 Difference]: With dead ends: 649 [2019-09-08 06:40:56,731 INFO L226 Difference]: Without dead ends: 359 [2019-09-08 06:40:56,733 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:40:56,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2019-09-08 06:40:56,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 315. [2019-09-08 06:40:56,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-09-08 06:40:56,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 447 transitions. [2019-09-08 06:40:56,758 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 447 transitions. Word has length 161 [2019-09-08 06:40:56,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:40:56,759 INFO L475 AbstractCegarLoop]: Abstraction has 315 states and 447 transitions. [2019-09-08 06:40:56,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:40:56,759 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 447 transitions. [2019-09-08 06:40:56,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 06:40:56,762 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:40:56,762 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] [2019-09-08 06:40:56,763 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:40:56,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:40:56,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1945674080, now seen corresponding path program 1 times [2019-09-08 06:40:56,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:40:56,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:40:56,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:40:56,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:40:56,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:40:56,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:40:56,853 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:40:56,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:40:56,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:40:56,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:40:56,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:40:56,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:40:56,855 INFO L87 Difference]: Start difference. First operand 315 states and 447 transitions. Second operand 5 states. [2019-09-08 06:40:57,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:40:57,448 INFO L93 Difference]: Finished difference Result 645 states and 935 transitions. [2019-09-08 06:40:57,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:40:57,448 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 161 [2019-09-08 06:40:57,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:40:57,451 INFO L225 Difference]: With dead ends: 645 [2019-09-08 06:40:57,451 INFO L226 Difference]: Without dead ends: 355 [2019-09-08 06:40:57,453 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:40:57,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2019-09-08 06:40:57,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 315. [2019-09-08 06:40:57,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-09-08 06:40:57,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 446 transitions. [2019-09-08 06:40:57,475 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 446 transitions. Word has length 161 [2019-09-08 06:40:57,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:40:57,475 INFO L475 AbstractCegarLoop]: Abstraction has 315 states and 446 transitions. [2019-09-08 06:40:57,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:40:57,476 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 446 transitions. [2019-09-08 06:40:57,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 06:40:57,478 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:40:57,478 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] [2019-09-08 06:40:57,478 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:40:57,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:40:57,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1764521566, now seen corresponding path program 1 times [2019-09-08 06:40:57,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:40:57,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:40:57,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:40:57,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:40:57,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:40:57,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:40:57,614 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:40:57,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:40:57,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:40:57,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:40:57,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:40:57,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:40:57,617 INFO L87 Difference]: Start difference. First operand 315 states and 446 transitions. Second operand 5 states. [2019-09-08 06:40:58,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:40:58,182 INFO L93 Difference]: Finished difference Result 643 states and 929 transitions. [2019-09-08 06:40:58,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:40:58,182 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 161 [2019-09-08 06:40:58,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:40:58,185 INFO L225 Difference]: With dead ends: 643 [2019-09-08 06:40:58,185 INFO L226 Difference]: Without dead ends: 353 [2019-09-08 06:40:58,187 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:40:58,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2019-09-08 06:40:58,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 315. [2019-09-08 06:40:58,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-09-08 06:40:58,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 445 transitions. [2019-09-08 06:40:58,209 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 445 transitions. Word has length 161 [2019-09-08 06:40:58,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:40:58,209 INFO L475 AbstractCegarLoop]: Abstraction has 315 states and 445 transitions. [2019-09-08 06:40:58,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:40:58,210 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 445 transitions. [2019-09-08 06:40:58,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 06:40:58,212 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:40:58,212 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] [2019-09-08 06:40:58,212 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:40:58,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:40:58,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1330015968, now seen corresponding path program 1 times [2019-09-08 06:40:58,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:40:58,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:40:58,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:40:58,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:40:58,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:40:58,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:40:58,287 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:40:58,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:40:58,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:40:58,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:40:58,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:40:58,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:40:58,288 INFO L87 Difference]: Start difference. First operand 315 states and 445 transitions. Second operand 5 states. [2019-09-08 06:40:58,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:40:58,904 INFO L93 Difference]: Finished difference Result 675 states and 985 transitions. [2019-09-08 06:40:58,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:40:58,904 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 161 [2019-09-08 06:40:58,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:40:58,907 INFO L225 Difference]: With dead ends: 675 [2019-09-08 06:40:58,907 INFO L226 Difference]: Without dead ends: 385 [2019-09-08 06:40:58,909 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:40:58,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-09-08 06:40:58,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 315. [2019-09-08 06:40:58,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-09-08 06:40:58,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 444 transitions. [2019-09-08 06:40:58,945 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 444 transitions. Word has length 161 [2019-09-08 06:40:58,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:40:58,945 INFO L475 AbstractCegarLoop]: Abstraction has 315 states and 444 transitions. [2019-09-08 06:40:58,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:40:58,946 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 444 transitions. [2019-09-08 06:40:58,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 06:40:58,949 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:40:58,950 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] [2019-09-08 06:40:58,950 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:40:58,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:40:58,951 INFO L82 PathProgramCache]: Analyzing trace with hash 900357662, now seen corresponding path program 1 times [2019-09-08 06:40:58,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:40:58,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:40:58,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:40:58,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:40:58,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:40:58,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:40:59,072 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:40:59,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:40:59,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:40:59,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:40:59,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:40:59,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:40:59,075 INFO L87 Difference]: Start difference. First operand 315 states and 444 transitions. Second operand 5 states. [2019-09-08 06:40:59,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:40:59,887 INFO L93 Difference]: Finished difference Result 669 states and 974 transitions. [2019-09-08 06:40:59,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:40:59,888 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 161 [2019-09-08 06:40:59,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:40:59,894 INFO L225 Difference]: With dead ends: 669 [2019-09-08 06:40:59,894 INFO L226 Difference]: Without dead ends: 379 [2019-09-08 06:40:59,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:40:59,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-09-08 06:40:59,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 315. [2019-09-08 06:40:59,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-09-08 06:40:59,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 443 transitions. [2019-09-08 06:40:59,942 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 443 transitions. Word has length 161 [2019-09-08 06:40:59,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:40:59,943 INFO L475 AbstractCegarLoop]: Abstraction has 315 states and 443 transitions. [2019-09-08 06:40:59,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:40:59,943 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 443 transitions. [2019-09-08 06:40:59,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 06:40:59,947 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:40:59,947 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] [2019-09-08 06:40:59,948 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:40:59,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:40:59,948 INFO L82 PathProgramCache]: Analyzing trace with hash 193761056, now seen corresponding path program 1 times [2019-09-08 06:40:59,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:40:59,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:40:59,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:40:59,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:40:59,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:40:59,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:41:00,078 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:41:00,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:41:00,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:41:00,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:41:00,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:41:00,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:41:00,080 INFO L87 Difference]: Start difference. First operand 315 states and 443 transitions. Second operand 5 states. [2019-09-08 06:41:00,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:41:00,950 INFO L93 Difference]: Finished difference Result 671 states and 973 transitions. [2019-09-08 06:41:00,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:41:00,950 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 161 [2019-09-08 06:41:00,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:41:00,953 INFO L225 Difference]: With dead ends: 671 [2019-09-08 06:41:00,953 INFO L226 Difference]: Without dead ends: 381 [2019-09-08 06:41:00,955 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:41:00,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-09-08 06:41:00,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 315. [2019-09-08 06:41:00,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-09-08 06:41:00,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 442 transitions. [2019-09-08 06:41:00,988 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 442 transitions. Word has length 161 [2019-09-08 06:41:00,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:41:00,989 INFO L475 AbstractCegarLoop]: Abstraction has 315 states and 442 transitions. [2019-09-08 06:41:00,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:41:00,989 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 442 transitions. [2019-09-08 06:41:00,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 06:41:00,991 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:41:00,991 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:41:00,991 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:41:00,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:41:00,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1140798942, now seen corresponding path program 1 times [2019-09-08 06:41:00,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:41:00,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:41:00,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:41:00,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:41:00,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:41:01,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:41:01,091 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:41:01,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:41:01,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:41:01,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:41:01,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:41:01,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:41:01,094 INFO L87 Difference]: Start difference. First operand 315 states and 442 transitions. Second operand 5 states. [2019-09-08 06:41:01,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:41:01,692 INFO L93 Difference]: Finished difference Result 669 states and 967 transitions. [2019-09-08 06:41:01,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:41:01,692 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 161 [2019-09-08 06:41:01,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:41:01,698 INFO L225 Difference]: With dead ends: 669 [2019-09-08 06:41:01,699 INFO L226 Difference]: Without dead ends: 379 [2019-09-08 06:41:01,701 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:41:01,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-09-08 06:41:01,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 315. [2019-09-08 06:41:01,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-09-08 06:41:01,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 441 transitions. [2019-09-08 06:41:01,731 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 441 transitions. Word has length 161 [2019-09-08 06:41:01,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:41:01,733 INFO L475 AbstractCegarLoop]: Abstraction has 315 states and 441 transitions. [2019-09-08 06:41:01,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:41:01,733 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 441 transitions. [2019-09-08 06:41:01,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 06:41:01,736 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:41:01,736 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] [2019-09-08 06:41:01,737 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:41:01,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:41:01,737 INFO L82 PathProgramCache]: Analyzing trace with hash 2002632544, now seen corresponding path program 1 times [2019-09-08 06:41:01,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:41:01,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:41:01,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:41:01,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:41:01,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:41:01,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:41:01,822 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:41:01,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:41:01,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:41:01,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:41:01,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:41:01,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:41:01,824 INFO L87 Difference]: Start difference. First operand 315 states and 441 transitions. Second operand 5 states. [2019-09-08 06:41:02,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:41:02,438 INFO L93 Difference]: Finished difference Result 667 states and 961 transitions. [2019-09-08 06:41:02,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:41:02,439 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 161 [2019-09-08 06:41:02,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:41:02,441 INFO L225 Difference]: With dead ends: 667 [2019-09-08 06:41:02,442 INFO L226 Difference]: Without dead ends: 377 [2019-09-08 06:41:02,443 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:41:02,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-09-08 06:41:02,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 315. [2019-09-08 06:41:02,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-09-08 06:41:02,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 440 transitions. [2019-09-08 06:41:02,470 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 440 transitions. Word has length 161 [2019-09-08 06:41:02,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:41:02,471 INFO L475 AbstractCegarLoop]: Abstraction has 315 states and 440 transitions. [2019-09-08 06:41:02,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:41:02,471 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 440 transitions. [2019-09-08 06:41:02,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 06:41:02,473 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:41:02,473 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] [2019-09-08 06:41:02,473 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:41:02,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:41:02,474 INFO L82 PathProgramCache]: Analyzing trace with hash -47776354, now seen corresponding path program 1 times [2019-09-08 06:41:02,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:41:02,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:41:02,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:41:02,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:41:02,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:41:02,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:41:02,548 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:41:02,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:41:02,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:41:02,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:41:02,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:41:02,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:41:02,550 INFO L87 Difference]: Start difference. First operand 315 states and 440 transitions. Second operand 5 states. [2019-09-08 06:41:03,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:41:03,277 INFO L93 Difference]: Finished difference Result 663 states and 951 transitions. [2019-09-08 06:41:03,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:41:03,277 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 161 [2019-09-08 06:41:03,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:41:03,280 INFO L225 Difference]: With dead ends: 663 [2019-09-08 06:41:03,280 INFO L226 Difference]: Without dead ends: 373 [2019-09-08 06:41:03,282 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:41:03,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2019-09-08 06:41:03,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 315. [2019-09-08 06:41:03,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-09-08 06:41:03,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 439 transitions. [2019-09-08 06:41:03,313 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 439 transitions. Word has length 161 [2019-09-08 06:41:03,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:41:03,314 INFO L475 AbstractCegarLoop]: Abstraction has 315 states and 439 transitions. [2019-09-08 06:41:03,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:41:03,314 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 439 transitions. [2019-09-08 06:41:03,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 06:41:03,316 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:41:03,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] [2019-09-08 06:41:03,317 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:41:03,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:41:03,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1140411556, now seen corresponding path program 1 times [2019-09-08 06:41:03,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:41:03,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:41:03,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:41:03,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:41:03,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:41:03,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:41:03,394 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:41:03,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:41:03,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:41:03,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:41:03,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:41:03,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:41:03,396 INFO L87 Difference]: Start difference. First operand 315 states and 439 transitions. Second operand 5 states. [2019-09-08 06:41:04,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:41:04,045 INFO L93 Difference]: Finished difference Result 661 states and 945 transitions. [2019-09-08 06:41:04,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:41:04,046 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 161 [2019-09-08 06:41:04,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:41:04,049 INFO L225 Difference]: With dead ends: 661 [2019-09-08 06:41:04,049 INFO L226 Difference]: Without dead ends: 371 [2019-09-08 06:41:04,052 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:41:04,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-09-08 06:41:04,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 315. [2019-09-08 06:41:04,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-09-08 06:41:04,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 438 transitions. [2019-09-08 06:41:04,083 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 438 transitions. Word has length 161 [2019-09-08 06:41:04,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:41:04,083 INFO L475 AbstractCegarLoop]: Abstraction has 315 states and 438 transitions. [2019-09-08 06:41:04,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:41:04,084 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 438 transitions. [2019-09-08 06:41:04,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 06:41:04,087 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:41:04,087 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] [2019-09-08 06:41:04,087 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:41:04,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:41:04,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1872383454, now seen corresponding path program 1 times [2019-09-08 06:41:04,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:41:04,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:41:04,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:41:04,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:41:04,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:41:04,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:41:04,162 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:41:04,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:41:04,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:41:04,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:41:04,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:41:04,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:41:04,166 INFO L87 Difference]: Start difference. First operand 315 states and 438 transitions. Second operand 4 states. [2019-09-08 06:41:04,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:41:04,486 INFO L93 Difference]: Finished difference Result 885 states and 1277 transitions. [2019-09-08 06:41:04,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:41:04,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-09-08 06:41:04,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:41:04,491 INFO L225 Difference]: With dead ends: 885 [2019-09-08 06:41:04,491 INFO L226 Difference]: Without dead ends: 596 [2019-09-08 06:41:04,493 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:41:04,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-09-08 06:41:04,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 595. [2019-09-08 06:41:04,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-09-08 06:41:04,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 826 transitions. [2019-09-08 06:41:04,556 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 826 transitions. Word has length 161 [2019-09-08 06:41:04,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:41:04,556 INFO L475 AbstractCegarLoop]: Abstraction has 595 states and 826 transitions. [2019-09-08 06:41:04,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:41:04,557 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 826 transitions. [2019-09-08 06:41:04,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-09-08 06:41:04,562 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:41:04,562 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:04,563 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:41:04,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:41:04,563 INFO L82 PathProgramCache]: Analyzing trace with hash 145844660, now seen corresponding path program 1 times [2019-09-08 06:41:04,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:41:04,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:41:04,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:41:04,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:41:04,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:41:04,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:41:04,689 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 1 proven. 28 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-09-08 06:41:04,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:41:04,689 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:41:04,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:41:04,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:41:04,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 1627 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:41:05,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:41:05,114 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 06:41:05,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:41:05,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:41:05,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:41:05,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:41:05,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:41:05,125 INFO L87 Difference]: Start difference. First operand 595 states and 826 transitions. Second operand 7 states. [2019-09-08 06:41:05,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:41:05,425 INFO L93 Difference]: Finished difference Result 1762 states and 2590 transitions. [2019-09-08 06:41:05,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:41:05,425 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 265 [2019-09-08 06:41:05,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:41:05,435 INFO L225 Difference]: With dead ends: 1762 [2019-09-08 06:41:05,435 INFO L226 Difference]: Without dead ends: 1193 [2019-09-08 06:41:05,438 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:41:05,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2019-09-08 06:41:05,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 1138. [2019-09-08 06:41:05,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1138 states. [2019-09-08 06:41:05,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1616 transitions. [2019-09-08 06:41:05,570 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1616 transitions. Word has length 265 [2019-09-08 06:41:05,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:41:05,570 INFO L475 AbstractCegarLoop]: Abstraction has 1138 states and 1616 transitions. [2019-09-08 06:41:05,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:41:05,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1616 transitions. [2019-09-08 06:41:05,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-09-08 06:41:05,574 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:41:05,574 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:05,574 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:41:05,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:41:05,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1983975913, now seen corresponding path program 1 times [2019-09-08 06:41:05,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:41:05,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:41:05,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:41:05,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:41:05,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:41:05,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:41:05,689 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-09-08 06:41:05,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:41:05,690 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) [2019-09-08 06:41:05,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:41:05,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:41:05,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 1632 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:41:05,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:41:06,030 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-08 06:41:06,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:41:06,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-08 06:41:06,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:41:06,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:41:06,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:41:06,036 INFO L87 Difference]: Start difference. First operand 1138 states and 1616 transitions. Second operand 5 states. [2019-09-08 06:41:07,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:41:07,048 INFO L93 Difference]: Finished difference Result 5467 states and 8535 transitions. [2019-09-08 06:41:07,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:41:07,049 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 266 [2019-09-08 06:41:07,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:41:07,078 INFO L225 Difference]: With dead ends: 5467 [2019-09-08 06:41:07,078 INFO L226 Difference]: Without dead ends: 4355 [2019-09-08 06:41:07,089 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 270 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:41:07,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4355 states. [2019-09-08 06:41:07,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4355 to 4306. [2019-09-08 06:41:07,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4306 states. [2019-09-08 06:41:07,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4306 states to 4306 states and 6379 transitions. [2019-09-08 06:41:07,547 INFO L78 Accepts]: Start accepts. Automaton has 4306 states and 6379 transitions. Word has length 266 [2019-09-08 06:41:07,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:41:07,547 INFO L475 AbstractCegarLoop]: Abstraction has 4306 states and 6379 transitions. [2019-09-08 06:41:07,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:41:07,548 INFO L276 IsEmpty]: Start isEmpty. Operand 4306 states and 6379 transitions. [2019-09-08 06:41:07,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-09-08 06:41:07,557 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:41:07,558 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:07,558 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:41:07,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:41:07,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1506568315, now seen corresponding path program 1 times [2019-09-08 06:41:07,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:41:07,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:41:07,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:41:07,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:41:07,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:41:07,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:41:07,655 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-09-08 06:41:07,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:41:07,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:41:07,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:41:07,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:41:07,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:41:07,657 INFO L87 Difference]: Start difference. First operand 4306 states and 6379 transitions. Second operand 4 states. [2019-09-08 06:41:08,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:41:08,237 INFO L93 Difference]: Finished difference Result 8578 states and 12707 transitions. [2019-09-08 06:41:08,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:41:08,237 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 291 [2019-09-08 06:41:08,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:41:08,264 INFO L225 Difference]: With dead ends: 8578 [2019-09-08 06:41:08,264 INFO L226 Difference]: Without dead ends: 4298 [2019-09-08 06:41:08,281 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:41:08,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4298 states. [2019-09-08 06:41:08,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4298 to 4298. [2019-09-08 06:41:08,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4298 states. [2019-09-08 06:41:08,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4298 states to 4298 states and 6363 transitions. [2019-09-08 06:41:08,736 INFO L78 Accepts]: Start accepts. Automaton has 4298 states and 6363 transitions. Word has length 291 [2019-09-08 06:41:08,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:41:08,737 INFO L475 AbstractCegarLoop]: Abstraction has 4298 states and 6363 transitions. [2019-09-08 06:41:08,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:41:08,737 INFO L276 IsEmpty]: Start isEmpty. Operand 4298 states and 6363 transitions. [2019-09-08 06:41:08,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-09-08 06:41:08,744 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:41:08,744 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:08,745 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:41:08,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:41:08,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1224034220, now seen corresponding path program 1 times [2019-09-08 06:41:08,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:41:08,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:41:08,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:41:08,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:41:08,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:41:08,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:41:08,859 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 1 proven. 23 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-08 06:41:08,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:41:08,860 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) [2019-09-08 06:41:08,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:41:09,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:41:09,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 1633 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:41:09,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:41:09,193 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-08 06:41:09,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:41:09,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-08 06:41:09,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:41:09,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:41:09,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:41:09,205 INFO L87 Difference]: Start difference. First operand 4298 states and 6363 transitions. Second operand 5 states. [2019-09-08 06:41:11,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:41:11,121 INFO L93 Difference]: Finished difference Result 16889 states and 27942 transitions. [2019-09-08 06:41:11,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:41:11,121 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 267 [2019-09-08 06:41:11,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:41:11,198 INFO L225 Difference]: With dead ends: 16889 [2019-09-08 06:41:11,198 INFO L226 Difference]: Without dead ends: 12617 [2019-09-08 06:41:11,247 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 269 SyntacticMatches, 2 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:41:11,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12617 states. [2019-09-08 06:41:12,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12617 to 12504. [2019-09-08 06:41:12,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12504 states. [2019-09-08 06:41:12,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12504 states to 12504 states and 19442 transitions. [2019-09-08 06:41:12,884 INFO L78 Accepts]: Start accepts. Automaton has 12504 states and 19442 transitions. Word has length 267 [2019-09-08 06:41:12,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:41:12,884 INFO L475 AbstractCegarLoop]: Abstraction has 12504 states and 19442 transitions. [2019-09-08 06:41:12,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:41:12,884 INFO L276 IsEmpty]: Start isEmpty. Operand 12504 states and 19442 transitions. [2019-09-08 06:41:12,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-09-08 06:41:12,902 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:41:12,902 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:12,902 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:41:12,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:41:12,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1060692261, now seen corresponding path program 1 times [2019-09-08 06:41:12,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:41:12,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:41:12,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:41:12,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:41:12,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:41:12,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:41:12,995 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-09-08 06:41:12,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:41:12,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:41:12,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:41:12,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:41:12,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:41:12,997 INFO L87 Difference]: Start difference. First operand 12504 states and 19442 transitions. Second operand 4 states. [2019-09-08 06:41:14,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:41:14,131 INFO L93 Difference]: Finished difference Result 24976 states and 38838 transitions. [2019-09-08 06:41:14,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:41:14,131 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 293 [2019-09-08 06:41:14,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:41:14,213 INFO L225 Difference]: With dead ends: 24976 [2019-09-08 06:41:14,213 INFO L226 Difference]: Without dead ends: 12498 [2019-09-08 06:41:14,256 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:41:14,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12498 states. [2019-09-08 06:41:15,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12498 to 12498. [2019-09-08 06:41:15,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12498 states. [2019-09-08 06:41:15,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12498 states to 12498 states and 19430 transitions. [2019-09-08 06:41:15,296 INFO L78 Accepts]: Start accepts. Automaton has 12498 states and 19430 transitions. Word has length 293 [2019-09-08 06:41:15,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:41:15,296 INFO L475 AbstractCegarLoop]: Abstraction has 12498 states and 19430 transitions. [2019-09-08 06:41:15,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:41:15,296 INFO L276 IsEmpty]: Start isEmpty. Operand 12498 states and 19430 transitions. [2019-09-08 06:41:15,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-09-08 06:41:15,308 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:41:15,308 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:15,308 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:41:15,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:41:15,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1303310743, now seen corresponding path program 1 times [2019-09-08 06:41:15,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:41:15,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:41:15,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:41:15,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:41:15,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:41:15,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:41:15,410 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-09-08 06:41:15,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:41:15,411 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:41:15,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:41:15,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:41:15,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 1634 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 06:41:15,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:41:16,090 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-08 06:41:16,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:41:16,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:41:16,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:41:16,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:41:16,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:41:16,118 INFO L87 Difference]: Start difference. First operand 12498 states and 19430 transitions. Second operand 7 states. [2019-09-08 06:41:17,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:41:17,904 INFO L93 Difference]: Finished difference Result 37882 states and 65683 transitions. [2019-09-08 06:41:17,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:41:17,905 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 268 [2019-09-08 06:41:17,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:41:18,006 INFO L225 Difference]: With dead ends: 37882 [2019-09-08 06:41:18,006 INFO L226 Difference]: Without dead ends: 19236 [2019-09-08 06:41:18,097 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 268 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:41:18,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19236 states. [2019-09-08 06:41:20,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19236 to 19236. [2019-09-08 06:41:20,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19236 states. [2019-09-08 06:41:20,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19236 states to 19236 states and 31591 transitions. [2019-09-08 06:41:20,539 INFO L78 Accepts]: Start accepts. Automaton has 19236 states and 31591 transitions. Word has length 268 [2019-09-08 06:41:20,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:41:20,539 INFO L475 AbstractCegarLoop]: Abstraction has 19236 states and 31591 transitions. [2019-09-08 06:41:20,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:41:20,539 INFO L276 IsEmpty]: Start isEmpty. Operand 19236 states and 31591 transitions. [2019-09-08 06:41:20,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2019-09-08 06:41:20,600 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:41:20,601 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:41:20,601 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:41:20,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:41:20,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1439464356, now seen corresponding path program 1 times [2019-09-08 06:41:20,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:41:20,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:41:20,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:41:20,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:41:20,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:41:20,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:41:20,747 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 1 proven. 34 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2019-09-08 06:41:20,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:41:20,747 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:41:20,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:41:21,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:41:21,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 1986 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 06:41:21,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:41:21,298 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-09-08 06:41:21,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:41:21,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-08 06:41:21,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:41:21,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:41:21,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:41:21,306 INFO L87 Difference]: Start difference. First operand 19236 states and 31591 transitions. Second operand 5 states. [2019-09-08 06:41:27,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:41:27,038 INFO L93 Difference]: Finished difference Result 76153 states and 146838 transitions. [2019-09-08 06:41:27,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:41:27,039 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 363 [2019-09-08 06:41:27,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:41:27,430 INFO L225 Difference]: With dead ends: 76153 [2019-09-08 06:41:27,431 INFO L226 Difference]: Without dead ends: 56943 [2019-09-08 06:41:27,773 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 364 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:41:27,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56943 states. [2019-09-08 06:41:34,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56943 to 56574. [2019-09-08 06:41:34,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56574 states. [2019-09-08 06:41:35,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56574 states to 56574 states and 96025 transitions. [2019-09-08 06:41:35,090 INFO L78 Accepts]: Start accepts. Automaton has 56574 states and 96025 transitions. Word has length 363 [2019-09-08 06:41:35,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:41:35,090 INFO L475 AbstractCegarLoop]: Abstraction has 56574 states and 96025 transitions. [2019-09-08 06:41:35,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:41:35,090 INFO L276 IsEmpty]: Start isEmpty. Operand 56574 states and 96025 transitions. [2019-09-08 06:41:35,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2019-09-08 06:41:35,280 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:41:35,280 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, 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] [2019-09-08 06:41:35,280 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:41:35,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:41:35,281 INFO L82 PathProgramCache]: Analyzing trace with hash 388147291, now seen corresponding path program 1 times [2019-09-08 06:41:35,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:41:35,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:41:35,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:41:35,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:41:35,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:41:35,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:41:35,460 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 1 proven. 32 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-09-08 06:41:35,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:41:35,460 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:41:35,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:41:35,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:41:35,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 1906 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 06:41:35,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:41:35,914 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-09-08 06:41:35,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:41:35,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:41:35,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:41:35,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:41:35,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:41:35,931 INFO L87 Difference]: Start difference. First operand 56574 states and 96025 transitions. Second operand 7 states. [2019-09-08 06:41:43,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:41:43,481 INFO L93 Difference]: Finished difference Result 144145 states and 275753 transitions. [2019-09-08 06:41:43,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:41:43,481 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 356 [2019-09-08 06:41:43,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:41:43,909 INFO L225 Difference]: With dead ends: 144145 [2019-09-08 06:41:43,909 INFO L226 Difference]: Without dead ends: 87597 [2019-09-08 06:41:44,338 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 356 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:41:44,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87597 states. [2019-09-08 06:41:54,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87597 to 87378. [2019-09-08 06:41:54,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87378 states. [2019-09-08 06:41:57,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87378 states to 87378 states and 149204 transitions. [2019-09-08 06:41:57,623 INFO L78 Accepts]: Start accepts. Automaton has 87378 states and 149204 transitions. Word has length 356 [2019-09-08 06:41:57,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:41:57,624 INFO L475 AbstractCegarLoop]: Abstraction has 87378 states and 149204 transitions. [2019-09-08 06:41:57,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:41:57,624 INFO L276 IsEmpty]: Start isEmpty. Operand 87378 states and 149204 transitions. [2019-09-08 06:41:57,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-09-08 06:41:57,777 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:41:57,778 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, 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] [2019-09-08 06:41:57,778 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:41:57,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:41:57,779 INFO L82 PathProgramCache]: Analyzing trace with hash 911726031, now seen corresponding path program 1 times [2019-09-08 06:41:57,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:41:57,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:41:57,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:41:57,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:41:57,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:41:57,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:41:57,940 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2019-09-08 06:41:57,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:41:57,940 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:41:57,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:41:58,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:41:58,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 1901 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:41:58,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:41:58,263 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-08 06:41:58,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:41:58,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:41:58,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:41:58,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:41:58,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:41:58,279 INFO L87 Difference]: Start difference. First operand 87378 states and 149204 transitions. Second operand 7 states. [2019-09-08 06:42:15,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:42:15,500 INFO L93 Difference]: Finished difference Result 264890 states and 557023 transitions. [2019-09-08 06:42:15,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:42:15,501 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 357 [2019-09-08 06:42:15,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:42:16,591 INFO L225 Difference]: With dead ends: 264890 [2019-09-08 06:42:16,591 INFO L226 Difference]: Without dead ends: 177538 [2019-09-08 06:42:17,458 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:42:17,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177538 states. [2019-09-08 06:42:40,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177538 to 176887. [2019-09-08 06:42:40,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176887 states. [2019-09-08 06:42:41,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176887 states to 176887 states and 336883 transitions. [2019-09-08 06:42:41,736 INFO L78 Accepts]: Start accepts. Automaton has 176887 states and 336883 transitions. Word has length 357 [2019-09-08 06:42:41,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:42:41,737 INFO L475 AbstractCegarLoop]: Abstraction has 176887 states and 336883 transitions. [2019-09-08 06:42:41,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:42:41,737 INFO L276 IsEmpty]: Start isEmpty. Operand 176887 states and 336883 transitions. [2019-09-08 06:42:42,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-09-08 06:42:42,003 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:42:42,004 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, 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] [2019-09-08 06:42:42,004 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:42:42,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:42:42,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1649950738, now seen corresponding path program 1 times [2019-09-08 06:42:42,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:42:42,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:42:42,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:42,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:42:42,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:42,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:42:42,129 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 1 proven. 28 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-08 06:42:42,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:42:42,130 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:42:42,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:42:42,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:42:42,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 1907 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 06:42:42,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:42:43,343 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2019-09-08 06:42:43,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:42:43,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-08 06:42:43,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:42:43,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:42:43,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:42:43,356 INFO L87 Difference]: Start difference. First operand 176887 states and 336883 transitions. Second operand 5 states. [2019-09-08 06:43:01,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:01,183 INFO L93 Difference]: Finished difference Result 267265 states and 511407 transitions. [2019-09-08 06:43:01,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:43:01,183 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 357 [2019-09-08 06:43:01,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:02,723 INFO L225 Difference]: With dead ends: 267265 [2019-09-08 06:43:02,724 INFO L226 Difference]: Without dead ends: 177537 [2019-09-08 06:43:03,320 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 358 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:43:03,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177537 states. [2019-09-08 06:43:27,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177537 to 176886. [2019-09-08 06:43:27,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176886 states. [2019-09-08 06:43:28,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176886 states to 176886 states and 321532 transitions. [2019-09-08 06:43:28,851 INFO L78 Accepts]: Start accepts. Automaton has 176886 states and 321532 transitions. Word has length 357 [2019-09-08 06:43:28,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:28,852 INFO L475 AbstractCegarLoop]: Abstraction has 176886 states and 321532 transitions. [2019-09-08 06:43:28,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:43:28,852 INFO L276 IsEmpty]: Start isEmpty. Operand 176886 states and 321532 transitions. [2019-09-08 06:43:35,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-09-08 06:43:35,067 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:35,068 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, 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] [2019-09-08 06:43:35,068 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:35,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:35,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1751871561, now seen corresponding path program 1 times [2019-09-08 06:43:35,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:35,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:35,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:35,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:35,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:35,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:35,228 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2019-09-08 06:43:35,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:35,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:43:35,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:43:35,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:43:35,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:43:35,230 INFO L87 Difference]: Start difference. First operand 176886 states and 321532 transitions. Second operand 5 states. [2019-09-08 06:44:00,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:44:00,431 INFO L93 Difference]: Finished difference Result 445437 states and 832157 transitions. [2019-09-08 06:44:00,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:44:00,431 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 357 [2019-09-08 06:44:00,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:44:01,774 INFO L225 Difference]: With dead ends: 445437 [2019-09-08 06:44:01,774 INFO L226 Difference]: Without dead ends: 268578 [2019-09-08 06:44:11,347 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:44:11,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268578 states. [2019-09-08 06:44:38,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268578 to 247194. [2019-09-08 06:44:38,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247194 states. [2019-09-08 06:44:39,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247194 states to 247194 states and 403624 transitions. [2019-09-08 06:44:41,195 INFO L78 Accepts]: Start accepts. Automaton has 247194 states and 403624 transitions. Word has length 357 [2019-09-08 06:44:41,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:44:41,196 INFO L475 AbstractCegarLoop]: Abstraction has 247194 states and 403624 transitions. [2019-09-08 06:44:41,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:44:41,196 INFO L276 IsEmpty]: Start isEmpty. Operand 247194 states and 403624 transitions. [2019-09-08 06:44:41,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-09-08 06:44:41,446 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:44:41,446 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, 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] [2019-09-08 06:44:41,447 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:44:41,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:44:41,447 INFO L82 PathProgramCache]: Analyzing trace with hash 635903435, now seen corresponding path program 1 times [2019-09-08 06:44:41,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:44:41,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:44:41,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:44:41,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:44:41,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:44:41,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:44:41,588 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2019-09-08 06:44:41,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:44:41,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:44:41,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:44:41,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:44:41,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:44:41,590 INFO L87 Difference]: Start difference. First operand 247194 states and 403624 transitions. Second operand 5 states. [2019-09-08 06:45:14,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:45:14,167 INFO L93 Difference]: Finished difference Result 494361 states and 808510 transitions. [2019-09-08 06:45:14,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:45:14,167 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 357 [2019-09-08 06:45:14,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:45:15,825 INFO L225 Difference]: With dead ends: 494361 [2019-09-08 06:45:15,825 INFO L226 Difference]: Without dead ends: 247194 [2019-09-08 06:45:16,814 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:45:16,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247194 states. [2019-09-08 06:45:48,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247194 to 247194. [2019-09-08 06:45:48,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247194 states. [2019-09-08 06:45:49,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247194 states to 247194 states and 402328 transitions. [2019-09-08 06:45:49,510 INFO L78 Accepts]: Start accepts. Automaton has 247194 states and 402328 transitions. Word has length 357 [2019-09-08 06:45:49,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:45:49,511 INFO L475 AbstractCegarLoop]: Abstraction has 247194 states and 402328 transitions. [2019-09-08 06:45:49,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:45:49,511 INFO L276 IsEmpty]: Start isEmpty. Operand 247194 states and 402328 transitions. [2019-09-08 06:45:49,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-09-08 06:45:49,745 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:45:49,745 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, 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] [2019-09-08 06:45:49,746 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:45:49,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:45:49,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1755400183, now seen corresponding path program 1 times [2019-09-08 06:45:49,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:45:49,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:45:49,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:45:49,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:45:49,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:45:49,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:45:51,214 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2019-09-08 06:45:51,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:45:51,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:45:51,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:45:51,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:45:51,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:45:51,218 INFO L87 Difference]: Start difference. First operand 247194 states and 402328 transitions. Second operand 5 states. [2019-09-08 06:46:21,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:46:21,102 INFO L93 Difference]: Finished difference Result 494361 states and 805918 transitions. [2019-09-08 06:46:21,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:46:21,103 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 357 [2019-09-08 06:46:21,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:46:22,170 INFO L225 Difference]: With dead ends: 494361 [2019-09-08 06:46:22,170 INFO L226 Difference]: Without dead ends: 247194 [2019-09-08 06:46:23,218 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:46:23,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247194 states. [2019-09-08 06:46:59,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247194 to 247194. [2019-09-08 06:46:59,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247194 states. [2019-09-08 06:47:01,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247194 states to 247194 states and 401032 transitions. [2019-09-08 06:47:01,857 INFO L78 Accepts]: Start accepts. Automaton has 247194 states and 401032 transitions. Word has length 357 [2019-09-08 06:47:01,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:47:01,858 INFO L475 AbstractCegarLoop]: Abstraction has 247194 states and 401032 transitions. [2019-09-08 06:47:01,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:47:01,858 INFO L276 IsEmpty]: Start isEmpty. Operand 247194 states and 401032 transitions. [2019-09-08 06:47:02,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-09-08 06:47:02,090 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:47:02,090 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, 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] [2019-09-08 06:47:02,091 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:47:02,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:47:02,091 INFO L82 PathProgramCache]: Analyzing trace with hash -774649401, now seen corresponding path program 1 times [2019-09-08 06:47:02,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:47:02,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:47:02,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:47:02,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:47:02,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:47:02,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:47:02,241 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2019-09-08 06:47:02,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:47:02,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:47:02,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:47:02,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:47:02,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:47:02,242 INFO L87 Difference]: Start difference. First operand 247194 states and 401032 transitions. Second operand 5 states. [2019-09-08 06:47:31,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:47:31,438 INFO L93 Difference]: Finished difference Result 494361 states and 803326 transitions. [2019-09-08 06:47:31,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:47:31,438 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 357 [2019-09-08 06:47:31,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:47:33,095 INFO L225 Difference]: With dead ends: 494361 [2019-09-08 06:47:33,096 INFO L226 Difference]: Without dead ends: 247194 [2019-09-08 06:47:34,249 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:47:34,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247194 states. [2019-09-08 06:48:09,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247194 to 247194. [2019-09-08 06:48:09,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247194 states. [2019-09-08 06:48:10,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247194 states to 247194 states and 399736 transitions. [2019-09-08 06:48:10,716 INFO L78 Accepts]: Start accepts. Automaton has 247194 states and 399736 transitions. Word has length 357 [2019-09-08 06:48:10,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:48:10,716 INFO L475 AbstractCegarLoop]: Abstraction has 247194 states and 399736 transitions. [2019-09-08 06:48:10,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:48:10,717 INFO L276 IsEmpty]: Start isEmpty. Operand 247194 states and 399736 transitions. [2019-09-08 06:48:10,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-09-08 06:48:10,934 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:48:10,935 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, 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] [2019-09-08 06:48:10,935 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:48:10,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:48:10,935 INFO L82 PathProgramCache]: Analyzing trace with hash -743012279, now seen corresponding path program 1 times [2019-09-08 06:48:10,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:48:10,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:48:10,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:48:10,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:48:10,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:48:10,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:48:12,168 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2019-09-08 06:48:12,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:48:12,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:48:12,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:48:12,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:48:12,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:48:12,169 INFO L87 Difference]: Start difference. First operand 247194 states and 399736 transitions. Second operand 5 states. [2019-09-08 06:48:51,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:48:51,466 INFO L93 Difference]: Finished difference Result 597071 states and 1009531 transitions. [2019-09-08 06:48:51,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:48:51,466 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 357 [2019-09-08 06:48:51,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:48:53,161 INFO L225 Difference]: With dead ends: 597071 [2019-09-08 06:48:53,162 INFO L226 Difference]: Without dead ends: 349904 [2019-09-08 06:48:55,594 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:48:55,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349904 states. [2019-09-08 06:49:51,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349904 to 338240. [2019-09-08 06:49:51,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338240 states. [2019-09-08 06:49:53,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338240 states to 338240 states and 514994 transitions. [2019-09-08 06:49:53,617 INFO L78 Accepts]: Start accepts. Automaton has 338240 states and 514994 transitions. Word has length 357 [2019-09-08 06:49:53,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:49:53,617 INFO L475 AbstractCegarLoop]: Abstraction has 338240 states and 514994 transitions. [2019-09-08 06:49:53,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:49:53,617 INFO L276 IsEmpty]: Start isEmpty. Operand 338240 states and 514994 transitions. [2019-09-08 06:49:55,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-09-08 06:49:55,956 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:55,956 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, 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] [2019-09-08 06:49:55,956 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:55,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:55,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1059123591, now seen corresponding path program 1 times [2019-09-08 06:49:55,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:55,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:55,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:55,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:55,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:55,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:56,114 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2019-09-08 06:49:56,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:49:56,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:49:56,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:49:56,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:49:56,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:49:56,116 INFO L87 Difference]: Start difference. First operand 338240 states and 514994 transitions. Second operand 5 states. [2019-09-08 06:50:35,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:50:35,654 INFO L93 Difference]: Finished difference Result 676451 states and 1032542 transitions. [2019-09-08 06:50:35,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:50:35,661 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 357 [2019-09-08 06:50:35,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:50:37,848 INFO L225 Difference]: With dead ends: 676451 [2019-09-08 06:50:37,848 INFO L226 Difference]: Without dead ends: 338240 [2019-09-08 06:50:39,013 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:50:39,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338240 states.