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.02.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:50:20,403 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:50:20,407 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:50:20,419 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:50:20,419 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:50:20,420 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:50:20,421 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:50:20,423 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:50:20,425 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:50:20,426 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:50:20,427 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:50:20,428 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:50:20,428 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:50:20,429 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:50:20,430 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:50:20,431 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:50:20,432 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:50:20,433 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:50:20,435 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:50:20,437 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:50:20,439 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:50:20,441 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:50:20,442 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:50:20,443 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:50:20,449 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:50:20,449 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:50:20,449 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:50:20,450 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:50:20,451 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:50:20,452 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:50:20,454 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:50:20,455 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:50:20,456 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:50:20,458 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:50:20,462 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:50:20,462 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:50:20,463 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:50:20,465 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:50:20,465 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:50:20,467 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:50:20,468 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:50:20,469 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-14 23:50:20,499 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:50:20,499 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:50:20,501 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:50:20,503 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:50:20,503 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:50:20,504 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:50:20,504 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:50:20,504 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:50:20,504 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:50:20,504 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:50:20,506 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:50:20,506 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:50:20,506 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:50:20,506 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:50:20,507 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:50:20,507 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:50:20,507 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:50:20,507 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:50:20,507 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:50:20,508 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:50:20,508 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:50:20,508 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:50:20,509 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:50:20,509 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:50:20,509 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:50:20,509 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:50:20,509 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:50:20,509 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:50:20,510 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:50:20,790 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:50:20,809 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:50:20,813 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:50:20,815 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:50:20,815 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:50:20,816 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.02.cil-1.c [2019-10-14 23:50:20,888 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab7946c07/5215c20ff4b549e9a0f9b16cba98636a/FLAG75815a5c6 [2019-10-14 23:50:21,351 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:50:21,352 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.02.cil-1.c [2019-10-14 23:50:21,362 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab7946c07/5215c20ff4b549e9a0f9b16cba98636a/FLAG75815a5c6 [2019-10-14 23:50:21,723 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab7946c07/5215c20ff4b549e9a0f9b16cba98636a [2019-10-14 23:50:21,735 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:50:21,737 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:50:21,738 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:50:21,738 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:50:21,742 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:50:21,743 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:50:21" (1/1) ... [2019-10-14 23:50:21,746 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@247dfb19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:21, skipping insertion in model container [2019-10-14 23:50:21,747 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:50:21" (1/1) ... [2019-10-14 23:50:21,753 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:50:21,788 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:50:21,985 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:50:21,991 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:50:22,115 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:50:22,135 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:50:22,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:22 WrapperNode [2019-10-14 23:50:22,136 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:50:22,137 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:50:22,137 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:50:22,137 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:50:22,147 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:22" (1/1) ... [2019-10-14 23:50:22,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:22" (1/1) ... [2019-10-14 23:50:22,155 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:22" (1/1) ... [2019-10-14 23:50:22,155 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:22" (1/1) ... [2019-10-14 23:50:22,165 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:22" (1/1) ... [2019-10-14 23:50:22,177 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:22" (1/1) ... [2019-10-14 23:50:22,179 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:22" (1/1) ... [2019-10-14 23:50:22,183 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:50:22,184 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:50:22,184 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:50:22,184 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:50:22,185 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:22" (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-10-14 23:50:22,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:50:22,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:50:22,239 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-14 23:50:22,239 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-10-14 23:50:22,239 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-10-14 23:50:22,239 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-10-14 23:50:22,240 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-10-14 23:50:22,240 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-10-14 23:50:22,240 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-10-14 23:50:22,240 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-10-14 23:50:22,240 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-10-14 23:50:22,240 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-10-14 23:50:22,241 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-14 23:50:22,241 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-10-14 23:50:22,241 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-10-14 23:50:22,241 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-10-14 23:50:22,241 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-10-14 23:50:22,242 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-10-14 23:50:22,242 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-10-14 23:50:22,242 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-10-14 23:50:22,242 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-10-14 23:50:22,242 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-14 23:50:22,242 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:50:22,243 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:50:22,243 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-14 23:50:22,243 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-10-14 23:50:22,243 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-10-14 23:50:22,243 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-10-14 23:50:22,243 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-10-14 23:50:22,244 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:50:22,244 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-10-14 23:50:22,244 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-10-14 23:50:22,244 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-10-14 23:50:22,244 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-10-14 23:50:22,244 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-10-14 23:50:22,245 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-10-14 23:50:22,245 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-14 23:50:22,245 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-10-14 23:50:22,245 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-10-14 23:50:22,245 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-10-14 23:50:22,245 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-10-14 23:50:22,246 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-10-14 23:50:22,246 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-10-14 23:50:22,246 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-10-14 23:50:22,246 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-14 23:50:22,246 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:50:22,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:50:22,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:50:22,866 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:50:22,866 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-14 23:50:22,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:50:22 BoogieIcfgContainer [2019-10-14 23:50:22,868 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:50:22,869 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:50:22,870 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:50:22,873 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:50:22,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:50:21" (1/3) ... [2019-10-14 23:50:22,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3207aa09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:50:22, skipping insertion in model container [2019-10-14 23:50:22,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:22" (2/3) ... [2019-10-14 23:50:22,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3207aa09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:50:22, skipping insertion in model container [2019-10-14 23:50:22,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:50:22" (3/3) ... [2019-10-14 23:50:22,880 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-1.c [2019-10-14 23:50:22,892 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:50:22,914 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:50:22,926 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:50:22,973 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:50:22,973 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:50:22,974 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:50:22,974 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:50:22,974 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:50:22,975 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:50:22,975 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:50:22,975 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:50:23,013 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states. [2019-10-14 23:50:23,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-14 23:50:23,024 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:23,025 INFO L380 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] [2019-10-14 23:50:23,027 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:23,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:23,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1715943758, now seen corresponding path program 1 times [2019-10-14 23:50:23,043 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:23,043 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910258554] [2019-10-14 23:50:23,044 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:23,044 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:23,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:23,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:23,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:23,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:23,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:23,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:23,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:23,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:23,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:23,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:23,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:23,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:23,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:23,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:23,712 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910258554] [2019-10-14 23:50:23,713 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:23,713 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:23,713 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146255519] [2019-10-14 23:50:23,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:23,720 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:23,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:23,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:23,739 INFO L87 Difference]: Start difference. First operand 174 states. Second operand 10 states. [2019-10-14 23:50:25,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:25,664 INFO L93 Difference]: Finished difference Result 422 states and 652 transitions. [2019-10-14 23:50:25,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-14 23:50:25,666 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 91 [2019-10-14 23:50:25,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:25,684 INFO L225 Difference]: With dead ends: 422 [2019-10-14 23:50:25,685 INFO L226 Difference]: Without dead ends: 256 [2019-10-14 23:50:25,691 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2019-10-14 23:50:25,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-10-14 23:50:25,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 165. [2019-10-14 23:50:25,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-14 23:50:25,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 220 transitions. [2019-10-14 23:50:25,804 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 220 transitions. Word has length 91 [2019-10-14 23:50:25,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:25,805 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 220 transitions. [2019-10-14 23:50:25,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:25,806 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 220 transitions. [2019-10-14 23:50:25,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-14 23:50:25,827 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:25,827 INFO L380 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] [2019-10-14 23:50:25,828 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:25,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:25,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1625083380, now seen corresponding path program 1 times [2019-10-14 23:50:25,829 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:25,829 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729195608] [2019-10-14 23:50:25,830 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:25,830 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:25,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:25,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:25,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:26,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:26,125 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729195608] [2019-10-14 23:50:26,126 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:26,126 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:26,126 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046785566] [2019-10-14 23:50:26,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:26,129 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:26,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:26,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:26,130 INFO L87 Difference]: Start difference. First operand 165 states and 220 transitions. Second operand 10 states. [2019-10-14 23:50:27,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:27,670 INFO L93 Difference]: Finished difference Result 401 states and 576 transitions. [2019-10-14 23:50:27,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 23:50:27,671 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 91 [2019-10-14 23:50:27,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:27,676 INFO L225 Difference]: With dead ends: 401 [2019-10-14 23:50:27,676 INFO L226 Difference]: Without dead ends: 256 [2019-10-14 23:50:27,678 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-10-14 23:50:27,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-10-14 23:50:27,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 165. [2019-10-14 23:50:27,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-14 23:50:27,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 217 transitions. [2019-10-14 23:50:27,712 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 217 transitions. Word has length 91 [2019-10-14 23:50:27,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:27,712 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 217 transitions. [2019-10-14 23:50:27,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:27,713 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 217 transitions. [2019-10-14 23:50:27,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-14 23:50:27,715 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:27,715 INFO L380 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] [2019-10-14 23:50:27,715 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:27,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:27,716 INFO L82 PathProgramCache]: Analyzing trace with hash -918009072, now seen corresponding path program 1 times [2019-10-14 23:50:27,716 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:27,716 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377787883] [2019-10-14 23:50:27,716 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:27,716 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:27,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:27,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:27,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:27,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:27,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:27,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:27,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:27,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:27,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:27,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:27,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:27,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:27,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:27,964 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377787883] [2019-10-14 23:50:27,964 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:27,965 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:27,965 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912512631] [2019-10-14 23:50:27,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:27,968 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:27,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:27,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:27,969 INFO L87 Difference]: Start difference. First operand 165 states and 217 transitions. Second operand 10 states. [2019-10-14 23:50:29,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:29,924 INFO L93 Difference]: Finished difference Result 480 states and 713 transitions. [2019-10-14 23:50:29,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-14 23:50:29,931 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 91 [2019-10-14 23:50:29,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:29,938 INFO L225 Difference]: With dead ends: 480 [2019-10-14 23:50:29,938 INFO L226 Difference]: Without dead ends: 335 [2019-10-14 23:50:29,940 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2019-10-14 23:50:29,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-10-14 23:50:29,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 201. [2019-10-14 23:50:29,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-10-14 23:50:29,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 257 transitions. [2019-10-14 23:50:29,997 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 257 transitions. Word has length 91 [2019-10-14 23:50:29,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:29,997 INFO L462 AbstractCegarLoop]: Abstraction has 201 states and 257 transitions. [2019-10-14 23:50:29,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:29,998 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 257 transitions. [2019-10-14 23:50:29,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-14 23:50:29,999 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:29,999 INFO L380 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] [2019-10-14 23:50:30,000 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:30,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:30,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1347669555, now seen corresponding path program 1 times [2019-10-14 23:50:30,000 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:30,001 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842028871] [2019-10-14 23:50:30,001 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:30,001 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:30,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:30,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:30,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:30,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:30,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:30,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:30,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:30,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:30,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:30,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:30,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:30,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:30,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:30,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:30,202 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842028871] [2019-10-14 23:50:30,202 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:30,202 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:30,202 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71651631] [2019-10-14 23:50:30,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:30,203 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:30,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:30,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:30,204 INFO L87 Difference]: Start difference. First operand 201 states and 257 transitions. Second operand 10 states. [2019-10-14 23:50:32,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:32,214 INFO L93 Difference]: Finished difference Result 562 states and 806 transitions. [2019-10-14 23:50:32,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-14 23:50:32,217 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 91 [2019-10-14 23:50:32,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:32,220 INFO L225 Difference]: With dead ends: 562 [2019-10-14 23:50:32,221 INFO L226 Difference]: Without dead ends: 381 [2019-10-14 23:50:32,222 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2019-10-14 23:50:32,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-10-14 23:50:32,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 237. [2019-10-14 23:50:32,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-10-14 23:50:32,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 295 transitions. [2019-10-14 23:50:32,254 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 295 transitions. Word has length 91 [2019-10-14 23:50:32,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:32,254 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 295 transitions. [2019-10-14 23:50:32,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:32,256 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 295 transitions. [2019-10-14 23:50:32,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-14 23:50:32,257 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:32,258 INFO L380 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] [2019-10-14 23:50:32,258 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:32,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:32,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1401666513, now seen corresponding path program 1 times [2019-10-14 23:50:32,258 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:32,259 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873896265] [2019-10-14 23:50:32,259 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:32,259 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:32,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:32,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:32,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:32,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:32,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:32,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:32,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:32,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:32,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:32,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:32,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:32,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:32,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:32,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:32,438 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873896265] [2019-10-14 23:50:32,438 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:32,438 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:32,439 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490042353] [2019-10-14 23:50:32,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:32,439 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:32,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:32,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:32,440 INFO L87 Difference]: Start difference. First operand 237 states and 295 transitions. Second operand 10 states. [2019-10-14 23:50:34,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:34,342 INFO L93 Difference]: Finished difference Result 639 states and 888 transitions. [2019-10-14 23:50:34,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-14 23:50:34,343 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 91 [2019-10-14 23:50:34,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:34,346 INFO L225 Difference]: With dead ends: 639 [2019-10-14 23:50:34,346 INFO L226 Difference]: Without dead ends: 422 [2019-10-14 23:50:34,348 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2019-10-14 23:50:34,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2019-10-14 23:50:34,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 270. [2019-10-14 23:50:34,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-10-14 23:50:34,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 328 transitions. [2019-10-14 23:50:34,391 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 328 transitions. Word has length 91 [2019-10-14 23:50:34,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:34,391 INFO L462 AbstractCegarLoop]: Abstraction has 270 states and 328 transitions. [2019-10-14 23:50:34,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:34,392 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 328 transitions. [2019-10-14 23:50:34,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-14 23:50:34,395 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:34,395 INFO L380 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] [2019-10-14 23:50:34,395 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:34,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:34,396 INFO L82 PathProgramCache]: Analyzing trace with hash 256331726, now seen corresponding path program 1 times [2019-10-14 23:50:34,396 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:34,396 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212801545] [2019-10-14 23:50:34,396 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:34,397 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:34,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:34,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:34,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:34,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:34,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:34,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:34,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:34,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:34,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:34,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:34,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:34,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:34,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:34,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:34,623 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212801545] [2019-10-14 23:50:34,624 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:34,624 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:34,625 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784427678] [2019-10-14 23:50:34,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:34,625 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:34,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:34,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:34,626 INFO L87 Difference]: Start difference. First operand 270 states and 328 transitions. Second operand 10 states. [2019-10-14 23:50:36,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:36,493 INFO L93 Difference]: Finished difference Result 650 states and 843 transitions. [2019-10-14 23:50:36,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-14 23:50:36,494 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 91 [2019-10-14 23:50:36,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:36,498 INFO L225 Difference]: With dead ends: 650 [2019-10-14 23:50:36,499 INFO L226 Difference]: Without dead ends: 401 [2019-10-14 23:50:36,500 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-10-14 23:50:36,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2019-10-14 23:50:36,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 275. [2019-10-14 23:50:36,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-10-14 23:50:36,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 330 transitions. [2019-10-14 23:50:36,529 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 330 transitions. Word has length 91 [2019-10-14 23:50:36,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:36,530 INFO L462 AbstractCegarLoop]: Abstraction has 275 states and 330 transitions. [2019-10-14 23:50:36,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:36,530 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 330 transitions. [2019-10-14 23:50:36,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-14 23:50:36,531 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:36,532 INFO L380 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] [2019-10-14 23:50:36,532 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:36,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:36,532 INFO L82 PathProgramCache]: Analyzing trace with hash 504478220, now seen corresponding path program 1 times [2019-10-14 23:50:36,533 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:36,533 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754310589] [2019-10-14 23:50:36,533 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:36,533 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:36,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:36,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:36,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:36,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:36,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:36,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:36,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:36,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:36,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:36,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:36,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:36,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:36,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:36,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:36,746 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754310589] [2019-10-14 23:50:36,746 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:36,746 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:36,747 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998283907] [2019-10-14 23:50:36,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:36,747 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:36,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:36,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:36,748 INFO L87 Difference]: Start difference. First operand 275 states and 330 transitions. Second operand 10 states. [2019-10-14 23:50:39,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:39,249 INFO L93 Difference]: Finished difference Result 1032 states and 1299 transitions. [2019-10-14 23:50:39,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-14 23:50:39,250 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 91 [2019-10-14 23:50:39,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:39,258 INFO L225 Difference]: With dead ends: 1032 [2019-10-14 23:50:39,259 INFO L226 Difference]: Without dead ends: 777 [2019-10-14 23:50:39,261 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2019-10-14 23:50:39,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2019-10-14 23:50:39,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 568. [2019-10-14 23:50:39,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-10-14 23:50:39,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 674 transitions. [2019-10-14 23:50:39,367 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 674 transitions. Word has length 91 [2019-10-14 23:50:39,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:39,367 INFO L462 AbstractCegarLoop]: Abstraction has 568 states and 674 transitions. [2019-10-14 23:50:39,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:39,368 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 674 transitions. [2019-10-14 23:50:39,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-14 23:50:39,370 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:39,370 INFO L380 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] [2019-10-14 23:50:39,370 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:39,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:39,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1890681614, now seen corresponding path program 1 times [2019-10-14 23:50:39,372 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:39,372 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874558675] [2019-10-14 23:50:39,373 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:39,373 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:39,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:39,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:39,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:39,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:39,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:39,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:39,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:39,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:39,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:39,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:39,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:39,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:39,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:39,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:39,596 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874558675] [2019-10-14 23:50:39,596 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:39,596 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-14 23:50:39,597 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745678272] [2019-10-14 23:50:39,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 23:50:39,597 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:39,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 23:50:39,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:50:39,598 INFO L87 Difference]: Start difference. First operand 568 states and 674 transitions. Second operand 7 states. [2019-10-14 23:50:41,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:41,501 INFO L93 Difference]: Finished difference Result 2003 states and 2570 transitions. [2019-10-14 23:50:41,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-14 23:50:41,502 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2019-10-14 23:50:41,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:41,515 INFO L225 Difference]: With dead ends: 2003 [2019-10-14 23:50:41,515 INFO L226 Difference]: Without dead ends: 1456 [2019-10-14 23:50:41,519 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-10-14 23:50:41,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2019-10-14 23:50:41,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1182. [2019-10-14 23:50:41,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1182 states. [2019-10-14 23:50:41,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1460 transitions. [2019-10-14 23:50:41,751 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1460 transitions. Word has length 91 [2019-10-14 23:50:41,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:41,752 INFO L462 AbstractCegarLoop]: Abstraction has 1182 states and 1460 transitions. [2019-10-14 23:50:41,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 23:50:41,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1460 transitions. [2019-10-14 23:50:41,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-14 23:50:41,759 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:41,759 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 23:50:41,760 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:41,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:41,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1914461978, now seen corresponding path program 1 times [2019-10-14 23:50:41,761 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:41,761 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484805105] [2019-10-14 23:50:41,761 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:41,762 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:41,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:41,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:41,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:41,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:41,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:41,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:41,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:41,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:41,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:41,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:41,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:41,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:41,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:41,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:41,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:41,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:41,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:41,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:41,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:41,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:41,991 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-14 23:50:41,991 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484805105] [2019-10-14 23:50:41,993 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:41,993 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-14 23:50:41,993 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064046109] [2019-10-14 23:50:41,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-14 23:50:41,994 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:41,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-14 23:50:41,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:50:41,995 INFO L87 Difference]: Start difference. First operand 1182 states and 1460 transitions. Second operand 9 states. [2019-10-14 23:50:44,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:44,776 INFO L93 Difference]: Finished difference Result 3800 states and 4907 transitions. [2019-10-14 23:50:44,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-14 23:50:44,776 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 145 [2019-10-14 23:50:44,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:44,794 INFO L225 Difference]: With dead ends: 3800 [2019-10-14 23:50:44,794 INFO L226 Difference]: Without dead ends: 2640 [2019-10-14 23:50:44,800 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-10-14 23:50:44,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2640 states. [2019-10-14 23:50:45,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2640 to 2272. [2019-10-14 23:50:45,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2272 states. [2019-10-14 23:50:45,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2272 states to 2272 states and 2899 transitions. [2019-10-14 23:50:45,065 INFO L78 Accepts]: Start accepts. Automaton has 2272 states and 2899 transitions. Word has length 145 [2019-10-14 23:50:45,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:45,067 INFO L462 AbstractCegarLoop]: Abstraction has 2272 states and 2899 transitions. [2019-10-14 23:50:45,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-14 23:50:45,069 INFO L276 IsEmpty]: Start isEmpty. Operand 2272 states and 2899 transitions. [2019-10-14 23:50:45,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-10-14 23:50:45,078 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:45,078 INFO L380 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, 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] [2019-10-14 23:50:45,078 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:45,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:45,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1988983491, now seen corresponding path program 1 times [2019-10-14 23:50:45,079 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:45,079 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198143673] [2019-10-14 23:50:45,079 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:45,080 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:45,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:45,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:45,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:45,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:45,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:45,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:45,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:45,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:45,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:45,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:45,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:45,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:45,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:45,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:45,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:45,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:45,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:45,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:45,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:45,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:45,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:45,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:45,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:45,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:45,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:45,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:45,398 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-10-14 23:50:45,398 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198143673] [2019-10-14 23:50:45,398 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:45,399 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:45,399 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17649043] [2019-10-14 23:50:45,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:45,400 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:45,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:45,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:45,400 INFO L87 Difference]: Start difference. First operand 2272 states and 2899 transitions. Second operand 10 states. [2019-10-14 23:50:48,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:48,038 INFO L93 Difference]: Finished difference Result 6824 states and 9500 transitions. [2019-10-14 23:50:48,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-14 23:50:48,038 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 189 [2019-10-14 23:50:48,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:48,065 INFO L225 Difference]: With dead ends: 6824 [2019-10-14 23:50:48,066 INFO L226 Difference]: Without dead ends: 4579 [2019-10-14 23:50:48,078 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 52 SyntacticMatches, 9 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2019-10-14 23:50:48,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4579 states. [2019-10-14 23:50:48,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4579 to 4160. [2019-10-14 23:50:48,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4160 states. [2019-10-14 23:50:48,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4160 states to 4160 states and 5275 transitions. [2019-10-14 23:50:48,574 INFO L78 Accepts]: Start accepts. Automaton has 4160 states and 5275 transitions. Word has length 189 [2019-10-14 23:50:48,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:48,575 INFO L462 AbstractCegarLoop]: Abstraction has 4160 states and 5275 transitions. [2019-10-14 23:50:48,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:48,575 INFO L276 IsEmpty]: Start isEmpty. Operand 4160 states and 5275 transitions. [2019-10-14 23:50:48,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-10-14 23:50:48,583 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:48,583 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 23:50:48,584 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:48,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:48,584 INFO L82 PathProgramCache]: Analyzing trace with hash 638674602, now seen corresponding path program 1 times [2019-10-14 23:50:48,584 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:48,584 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452448818] [2019-10-14 23:50:48,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:48,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:48,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:48,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:48,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:48,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:48,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:48,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:48,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:48,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:48,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:48,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:48,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:48,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:48,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:48,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:48,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:48,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:48,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:48,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:48,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:48,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:48,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:48,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:48,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:48,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:48,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:48,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:48,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:48,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:48,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:48,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:48,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:48,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:48,895 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2019-10-14 23:50:48,896 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452448818] [2019-10-14 23:50:48,896 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:48,896 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:48,896 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457789271] [2019-10-14 23:50:48,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:48,897 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:48,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:48,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:48,897 INFO L87 Difference]: Start difference. First operand 4160 states and 5275 transitions. Second operand 10 states. [2019-10-14 23:50:50,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:50,629 INFO L93 Difference]: Finished difference Result 8676 states and 11082 transitions. [2019-10-14 23:50:50,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-14 23:50:50,630 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 247 [2019-10-14 23:50:50,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:50,660 INFO L225 Difference]: With dead ends: 8676 [2019-10-14 23:50:50,660 INFO L226 Difference]: Without dead ends: 4537 [2019-10-14 23:50:50,678 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2019-10-14 23:50:50,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4537 states. [2019-10-14 23:50:51,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4537 to 4153. [2019-10-14 23:50:51,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4153 states. [2019-10-14 23:50:51,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4153 states to 4153 states and 5261 transitions. [2019-10-14 23:50:51,183 INFO L78 Accepts]: Start accepts. Automaton has 4153 states and 5261 transitions. Word has length 247 [2019-10-14 23:50:51,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:51,183 INFO L462 AbstractCegarLoop]: Abstraction has 4153 states and 5261 transitions. [2019-10-14 23:50:51,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:51,183 INFO L276 IsEmpty]: Start isEmpty. Operand 4153 states and 5261 transitions. [2019-10-14 23:50:51,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-10-14 23:50:51,190 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:51,190 INFO L380 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, 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] [2019-10-14 23:50:51,190 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:51,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:51,191 INFO L82 PathProgramCache]: Analyzing trace with hash 591399379, now seen corresponding path program 1 times [2019-10-14 23:50:51,191 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:51,191 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927872933] [2019-10-14 23:50:51,191 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:51,192 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:51,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:51,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,520 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 36 proven. 8 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-10-14 23:50:51,520 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927872933] [2019-10-14 23:50:51,520 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752652204] [2019-10-14 23:50:51,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:51,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 839 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:50:51,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:50:51,766 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-14 23:50:51,766 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:50:51,766 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [13] total 14 [2019-10-14 23:50:51,767 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115935287] [2019-10-14 23:50:51,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:51,767 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:51,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:51,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-10-14 23:50:51,768 INFO L87 Difference]: Start difference. First operand 4153 states and 5261 transitions. Second operand 3 states. [2019-10-14 23:50:52,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:52,541 INFO L93 Difference]: Finished difference Result 11438 states and 15641 transitions. [2019-10-14 23:50:52,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:52,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2019-10-14 23:50:52,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:52,590 INFO L225 Difference]: With dead ends: 11438 [2019-10-14 23:50:52,590 INFO L226 Difference]: Without dead ends: 7307 [2019-10-14 23:50:52,614 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-10-14 23:50:52,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7307 states. [2019-10-14 23:50:53,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7307 to 7288. [2019-10-14 23:50:53,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7288 states. [2019-10-14 23:50:53,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7288 states to 7288 states and 9491 transitions. [2019-10-14 23:50:53,446 INFO L78 Accepts]: Start accepts. Automaton has 7288 states and 9491 transitions. Word has length 190 [2019-10-14 23:50:53,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:53,447 INFO L462 AbstractCegarLoop]: Abstraction has 7288 states and 9491 transitions. [2019-10-14 23:50:53,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:53,447 INFO L276 IsEmpty]: Start isEmpty. Operand 7288 states and 9491 transitions. [2019-10-14 23:50:53,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-14 23:50:53,457 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:53,457 INFO L380 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, 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] [2019-10-14 23:50:53,662 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:53,662 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:53,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:53,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1984479964, now seen corresponding path program 1 times [2019-10-14 23:50:53,663 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:53,663 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511259674] [2019-10-14 23:50:53,663 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:53,663 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:53,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:53,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:53,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:53,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:53,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:53,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:53,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:53,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:53,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:53,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:53,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:53,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:53,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:53,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:53,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:53,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:53,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:53,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:53,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:53,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:53,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:53,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:53,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:53,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:53,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:53,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:53,952 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 1 proven. 23 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-10-14 23:50:53,952 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511259674] [2019-10-14 23:50:53,952 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060133543] [2019-10-14 23:50:53,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:54,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:54,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 847 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-14 23:50:54,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:50:54,255 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-10-14 23:50:54,256 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:50:54,256 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 11 [2019-10-14 23:50:54,256 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710543390] [2019-10-14 23:50:54,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:54,257 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:54,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:54,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-10-14 23:50:54,258 INFO L87 Difference]: Start difference. First operand 7288 states and 9491 transitions. Second operand 3 states. [2019-10-14 23:50:55,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:55,745 INFO L93 Difference]: Finished difference Result 11342 states and 14593 transitions. [2019-10-14 23:50:55,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:55,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2019-10-14 23:50:55,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:55,785 INFO L225 Difference]: With dead ends: 11342 [2019-10-14 23:50:55,785 INFO L226 Difference]: Without dead ends: 7290 [2019-10-14 23:50:55,805 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 235 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-10-14 23:50:55,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7290 states.