java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/transmitter.03.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:50:39,822 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:50:39,824 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:50:39,837 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:50:39,837 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:50:39,838 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:50:39,839 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:50:39,841 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:50:39,843 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:50:39,844 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:50:39,845 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:50:39,846 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:50:39,846 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:50:39,847 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:50:39,848 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:50:39,849 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:50:39,850 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:50:39,851 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:50:39,853 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:50:39,855 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:50:39,856 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:50:39,858 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:50:39,859 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:50:39,860 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:50:39,862 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:50:39,862 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:50:39,862 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:50:39,863 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:50:39,863 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:50:39,864 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:50:39,865 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:50:39,865 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:50:39,866 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:50:39,867 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:50:39,868 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:50:39,868 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:50:39,869 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:50:39,869 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:50:39,869 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:50:39,870 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:50:39,871 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:50:39,872 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:39,889 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:50:39,889 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:50:39,891 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:50:39,891 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:50:39,891 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:50:39,892 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:50:39,892 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:50:39,893 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:50:39,893 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:50:39,893 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:50:39,893 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:50:39,893 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:50:39,894 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:50:39,894 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:50:39,894 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:50:39,894 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:50:39,894 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:50:39,895 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:50:39,895 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:50:39,896 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:50:39,896 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:50:39,897 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:50:39,897 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:50:39,897 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:50:39,897 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:50:39,897 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:50:39,898 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:50:39,898 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:50:39,898 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:50:40,240 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:50:40,263 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:50:40,267 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:50:40,270 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:50:40,270 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:50:40,271 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.03.cil.c [2019-10-14 23:50:40,349 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c4fc66f9/a66cff8f4c9447d5a3f419a3b5c63db7/FLAG3ff9052ee [2019-10-14 23:50:40,821 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:50:40,823 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.03.cil.c [2019-10-14 23:50:40,836 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c4fc66f9/a66cff8f4c9447d5a3f419a3b5c63db7/FLAG3ff9052ee [2019-10-14 23:50:41,162 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c4fc66f9/a66cff8f4c9447d5a3f419a3b5c63db7 [2019-10-14 23:50:41,172 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:50:41,173 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:50:41,174 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:50:41,175 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:50:41,178 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:50:41,179 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:50:41" (1/1) ... [2019-10-14 23:50:41,183 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a7abc93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:41, skipping insertion in model container [2019-10-14 23:50:41,183 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:50:41" (1/1) ... [2019-10-14 23:50:41,191 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:50:41,253 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:50:41,551 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:50:41,557 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:50:41,719 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:50:41,741 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:50:41,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:41 WrapperNode [2019-10-14 23:50:41,741 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:50:41,742 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:50:41,742 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:50:41,742 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:50:41,753 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:41" (1/1) ... [2019-10-14 23:50:41,753 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:41" (1/1) ... [2019-10-14 23:50:41,761 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:41" (1/1) ... [2019-10-14 23:50:41,761 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:41" (1/1) ... [2019-10-14 23:50:41,772 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:41" (1/1) ... [2019-10-14 23:50:41,786 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:41" (1/1) ... [2019-10-14 23:50:41,789 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:41" (1/1) ... [2019-10-14 23:50:41,794 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:50:41,794 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:50:41,794 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:50:41,795 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:50:41,797 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:41" (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:41,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:50:41,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:50:41,858 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-14 23:50:41,859 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-10-14 23:50:41,859 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-10-14 23:50:41,859 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-10-14 23:50:41,859 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-10-14 23:50:41,859 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-10-14 23:50:41,859 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-10-14 23:50:41,860 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-10-14 23:50:41,860 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-10-14 23:50:41,860 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-10-14 23:50:41,860 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-10-14 23:50:41,860 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-10-14 23:50:41,860 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-14 23:50:41,861 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-10-14 23:50:41,861 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-10-14 23:50:41,861 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-10-14 23:50:41,861 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-10-14 23:50:41,861 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-10-14 23:50:41,861 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-10-14 23:50:41,862 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-10-14 23:50:41,862 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-10-14 23:50:41,862 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-14 23:50:41,862 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:50:41,862 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:50:41,862 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:50:41,863 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-14 23:50:41,863 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-10-14 23:50:41,863 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-10-14 23:50:41,863 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-10-14 23:50:41,863 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-10-14 23:50:41,863 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-10-14 23:50:41,863 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-10-14 23:50:41,864 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-10-14 23:50:41,864 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-10-14 23:50:41,864 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-10-14 23:50:41,864 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-10-14 23:50:41,864 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-10-14 23:50:41,864 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-10-14 23:50:41,865 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-14 23:50:41,865 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-10-14 23:50:41,865 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-10-14 23:50:41,865 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-10-14 23:50:41,865 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-10-14 23:50:41,865 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-10-14 23:50:41,865 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-10-14 23:50:41,866 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-10-14 23:50:41,866 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-14 23:50:41,866 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:50:41,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:50:41,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:50:42,510 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:50:42,510 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-14 23:50:42,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:50:42 BoogieIcfgContainer [2019-10-14 23:50:42,513 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:50:42,514 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:50:42,515 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:50:42,518 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:50:42,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:50:41" (1/3) ... [2019-10-14 23:50:42,521 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dd197d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:50:42, skipping insertion in model container [2019-10-14 23:50:42,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:41" (2/3) ... [2019-10-14 23:50:42,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dd197d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:50:42, skipping insertion in model container [2019-10-14 23:50:42,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:50:42" (3/3) ... [2019-10-14 23:50:42,527 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.03.cil.c [2019-10-14 23:50:42,537 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:50:42,556 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:50:42,567 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:50:42,601 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:50:42,601 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:50:42,601 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:50:42,602 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:50:42,602 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:50:42,602 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:50:42,603 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:50:42,603 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:50:42,631 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states. [2019-10-14 23:50:42,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-14 23:50:42,644 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:42,645 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:42,647 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:42,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:42,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1961190691, now seen corresponding path program 1 times [2019-10-14 23:50:42,664 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:42,664 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986353385] [2019-10-14 23:50:42,664 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:42,664 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:42,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:42,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:43,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:43,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:43,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:43,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:43,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:43,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:43,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:43,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:43,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:43,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:43,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:43,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:43,326 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:43,327 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986353385] [2019-10-14 23:50:43,327 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:43,328 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-14 23:50:43,328 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127816463] [2019-10-14 23:50:43,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-14 23:50:43,335 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:43,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-14 23:50:43,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:50:43,353 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 9 states. [2019-10-14 23:50:46,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:46,418 INFO L93 Difference]: Finished difference Result 735 states and 1166 transitions. [2019-10-14 23:50:46,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-14 23:50:46,420 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-10-14 23:50:46,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:46,442 INFO L225 Difference]: With dead ends: 735 [2019-10-14 23:50:46,442 INFO L226 Difference]: Without dead ends: 538 [2019-10-14 23:50:46,449 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-10-14 23:50:46,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-10-14 23:50:46,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 355. [2019-10-14 23:50:46,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2019-10-14 23:50:46,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 488 transitions. [2019-10-14 23:50:46,657 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 488 transitions. Word has length 105 [2019-10-14 23:50:46,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:46,659 INFO L462 AbstractCegarLoop]: Abstraction has 355 states and 488 transitions. [2019-10-14 23:50:46,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-14 23:50:46,659 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 488 transitions. [2019-10-14 23:50:46,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-14 23:50:46,673 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:46,673 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:46,673 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:46,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:46,676 INFO L82 PathProgramCache]: Analyzing trace with hash 645369824, now seen corresponding path program 1 times [2019-10-14 23:50:46,676 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:46,676 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478657981] [2019-10-14 23:50:46,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:46,677 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:46,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:46,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:46,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:46,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:46,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:46,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:46,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,057 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:47,058 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478657981] [2019-10-14 23:50:47,059 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:47,059 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:47,059 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873778825] [2019-10-14 23:50:47,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:47,065 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:47,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:47,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:47,066 INFO L87 Difference]: Start difference. First operand 355 states and 488 transitions. Second operand 10 states. [2019-10-14 23:50:48,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:48,622 INFO L93 Difference]: Finished difference Result 863 states and 1244 transitions. [2019-10-14 23:50:48,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 23:50:48,623 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2019-10-14 23:50:48,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:48,629 INFO L225 Difference]: With dead ends: 863 [2019-10-14 23:50:48,629 INFO L226 Difference]: Without dead ends: 529 [2019-10-14 23:50:48,631 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-10-14 23:50:48,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2019-10-14 23:50:48,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 355. [2019-10-14 23:50:48,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2019-10-14 23:50:48,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 481 transitions. [2019-10-14 23:50:48,683 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 481 transitions. Word has length 105 [2019-10-14 23:50:48,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:48,684 INFO L462 AbstractCegarLoop]: Abstraction has 355 states and 481 transitions. [2019-10-14 23:50:48,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:48,684 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 481 transitions. [2019-10-14 23:50:48,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-14 23:50:48,686 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:48,686 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:48,686 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:48,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:48,687 INFO L82 PathProgramCache]: Analyzing trace with hash 289131620, now seen corresponding path program 1 times [2019-10-14 23:50:48,687 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:48,687 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574732353] [2019-10-14 23:50:48,688 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:48,688 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:48,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:48,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:48,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:48,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:48,800 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,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:48,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:48,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:48,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:48,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:48,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:48,899 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:48,899 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574732353] [2019-10-14 23:50:48,899 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:48,900 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:48,900 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468978528] [2019-10-14 23:50:48,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:48,901 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:48,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:48,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:48,902 INFO L87 Difference]: Start difference. First operand 355 states and 481 transitions. Second operand 10 states. [2019-10-14 23:50:50,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:50,528 INFO L93 Difference]: Finished difference Result 859 states and 1222 transitions. [2019-10-14 23:50:50,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 23:50:50,528 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2019-10-14 23:50:50,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:50,533 INFO L225 Difference]: With dead ends: 859 [2019-10-14 23:50:50,533 INFO L226 Difference]: Without dead ends: 525 [2019-10-14 23:50:50,535 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 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:50,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2019-10-14 23:50:50,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 355. [2019-10-14 23:50:50,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2019-10-14 23:50:50,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 474 transitions. [2019-10-14 23:50:50,577 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 474 transitions. Word has length 105 [2019-10-14 23:50:50,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:50,577 INFO L462 AbstractCegarLoop]: Abstraction has 355 states and 474 transitions. [2019-10-14 23:50:50,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:50,578 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 474 transitions. [2019-10-14 23:50:50,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-14 23:50:50,579 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:50,580 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:50,580 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:50,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:50,581 INFO L82 PathProgramCache]: Analyzing trace with hash -830738592, now seen corresponding path program 1 times [2019-10-14 23:50:50,581 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:50,581 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350796007] [2019-10-14 23:50:50,581 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:50,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:50,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:50,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,838 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:50,838 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350796007] [2019-10-14 23:50:50,839 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:50,839 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:50,839 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938825832] [2019-10-14 23:50:50,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:50,840 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:50,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:50,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:50,841 INFO L87 Difference]: Start difference. First operand 355 states and 474 transitions. Second operand 10 states. [2019-10-14 23:50:52,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:52,493 INFO L93 Difference]: Finished difference Result 855 states and 1200 transitions. [2019-10-14 23:50:52,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 23:50:52,495 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2019-10-14 23:50:52,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:52,505 INFO L225 Difference]: With dead ends: 855 [2019-10-14 23:50:52,505 INFO L226 Difference]: Without dead ends: 521 [2019-10-14 23:50:52,507 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 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:52,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2019-10-14 23:50:52,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 355. [2019-10-14 23:50:52,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2019-10-14 23:50:52,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 467 transitions. [2019-10-14 23:50:52,556 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 467 transitions. Word has length 105 [2019-10-14 23:50:52,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:52,557 INFO L462 AbstractCegarLoop]: Abstraction has 355 states and 467 transitions. [2019-10-14 23:50:52,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:52,557 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 467 transitions. [2019-10-14 23:50:52,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-14 23:50:52,558 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:52,558 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:52,559 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:52,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:52,559 INFO L82 PathProgramCache]: Analyzing trace with hash -590498846, now seen corresponding path program 1 times [2019-10-14 23:50:52,560 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:52,560 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953723574] [2019-10-14 23:50:52,560 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:52,561 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:52,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:52,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,767 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:52,767 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953723574] [2019-10-14 23:50:52,768 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:52,768 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:52,768 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826743369] [2019-10-14 23:50:52,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:52,769 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:52,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:52,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:52,770 INFO L87 Difference]: Start difference. First operand 355 states and 467 transitions. Second operand 10 states. [2019-10-14 23:50:55,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:55,007 INFO L93 Difference]: Finished difference Result 1038 states and 1509 transitions. [2019-10-14 23:50:55,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-14 23:50:55,008 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2019-10-14 23:50:55,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:55,014 INFO L225 Difference]: With dead ends: 1038 [2019-10-14 23:50:55,015 INFO L226 Difference]: Without dead ends: 704 [2019-10-14 23:50:55,017 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2019-10-14 23:50:55,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2019-10-14 23:50:55,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 447. [2019-10-14 23:50:55,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2019-10-14 23:50:55,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 571 transitions. [2019-10-14 23:50:55,074 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 571 transitions. Word has length 105 [2019-10-14 23:50:55,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:55,075 INFO L462 AbstractCegarLoop]: Abstraction has 447 states and 571 transitions. [2019-10-14 23:50:55,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:55,075 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 571 transitions. [2019-10-14 23:50:55,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-14 23:50:55,078 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:55,078 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:55,079 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:55,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:55,079 INFO L82 PathProgramCache]: Analyzing trace with hash -260938274, now seen corresponding path program 1 times [2019-10-14 23:50:55,079 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:55,080 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693839678] [2019-10-14 23:50:55,080 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:55,080 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:55,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:55,354 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:55,354 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693839678] [2019-10-14 23:50:55,356 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:55,356 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:55,356 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746232776] [2019-10-14 23:50:55,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:55,357 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:55,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:55,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:55,358 INFO L87 Difference]: Start difference. First operand 447 states and 571 transitions. Second operand 10 states. [2019-10-14 23:50:57,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:57,488 INFO L93 Difference]: Finished difference Result 1244 states and 1749 transitions. [2019-10-14 23:50:57,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-14 23:50:57,492 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2019-10-14 23:50:57,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:57,498 INFO L225 Difference]: With dead ends: 1244 [2019-10-14 23:50:57,498 INFO L226 Difference]: Without dead ends: 818 [2019-10-14 23:50:57,500 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 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:57,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2019-10-14 23:50:57,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 539. [2019-10-14 23:50:57,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2019-10-14 23:50:57,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 671 transitions. [2019-10-14 23:50:57,554 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 671 transitions. Word has length 105 [2019-10-14 23:50:57,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:57,555 INFO L462 AbstractCegarLoop]: Abstraction has 539 states and 671 transitions. [2019-10-14 23:50:57,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:50:57,555 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 671 transitions. [2019-10-14 23:50:57,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-14 23:50:57,557 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:57,557 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:57,557 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:57,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:57,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1689355362, now seen corresponding path program 1 times [2019-10-14 23:50:57,558 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:57,558 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810143235] [2019-10-14 23:50:57,558 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:57,558 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:57,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:57,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:57,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:57,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:57,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:57,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:57,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:57,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:57,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:57,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:57,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:57,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:57,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:57,771 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:57,772 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810143235] [2019-10-14 23:50:57,772 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:57,772 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:50:57,773 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693415884] [2019-10-14 23:50:57,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:50:57,773 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:57,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:50:57,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:50:57,774 INFO L87 Difference]: Start difference. First operand 539 states and 671 transitions. Second operand 10 states. [2019-10-14 23:50:59,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:59,988 INFO L93 Difference]: Finished difference Result 1296 states and 1710 transitions. [2019-10-14 23:50:59,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-14 23:50:59,988 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2019-10-14 23:50:59,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:59,994 INFO L225 Difference]: With dead ends: 1296 [2019-10-14 23:50:59,994 INFO L226 Difference]: Without dead ends: 779 [2019-10-14 23:50:59,996 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-10-14 23:50:59,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2019-10-14 23:51:00,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 554. [2019-10-14 23:51:00,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2019-10-14 23:51:00,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 683 transitions. [2019-10-14 23:51:00,047 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 683 transitions. Word has length 105 [2019-10-14 23:51:00,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:51:00,047 INFO L462 AbstractCegarLoop]: Abstraction has 554 states and 683 transitions. [2019-10-14 23:51:00,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:51:00,047 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 683 transitions. [2019-10-14 23:51:00,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-14 23:51:00,049 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:51:00,049 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:51:00,049 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:51:00,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:51:00,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1271958756, now seen corresponding path program 1 times [2019-10-14 23:51:00,050 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:51:00,050 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156751715] [2019-10-14 23:51:00,050 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:00,050 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:00,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:51:00,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:00,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:00,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:00,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:00,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:00,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:00,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:00,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:00,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:00,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:00,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:00,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:00,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:00,254 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:51:00,255 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156751715] [2019-10-14 23:51:00,255 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:51:00,256 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:51:00,256 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000175168] [2019-10-14 23:51:00,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:51:00,256 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:51:00,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:51:00,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:51:00,257 INFO L87 Difference]: Start difference. First operand 554 states and 683 transitions. Second operand 10 states. [2019-10-14 23:51:02,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:51:02,414 INFO L93 Difference]: Finished difference Result 1306 states and 1703 transitions. [2019-10-14 23:51:02,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-14 23:51:02,415 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2019-10-14 23:51:02,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:51:02,421 INFO L225 Difference]: With dead ends: 1306 [2019-10-14 23:51:02,421 INFO L226 Difference]: Without dead ends: 774 [2019-10-14 23:51:02,424 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-10-14 23:51:02,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2019-10-14 23:51:02,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 564. [2019-10-14 23:51:02,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2019-10-14 23:51:02,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 689 transitions. [2019-10-14 23:51:02,479 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 689 transitions. Word has length 105 [2019-10-14 23:51:02,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:51:02,481 INFO L462 AbstractCegarLoop]: Abstraction has 564 states and 689 transitions. [2019-10-14 23:51:02,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:51:02,482 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 689 transitions. [2019-10-14 23:51:02,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-14 23:51:02,484 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:51:02,484 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:51:02,484 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:51:02,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:51:02,484 INFO L82 PathProgramCache]: Analyzing trace with hash -2146989534, now seen corresponding path program 1 times [2019-10-14 23:51:02,485 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:51:02,485 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740447860] [2019-10-14 23:51:02,485 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:02,485 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:02,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:51:02,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:02,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:02,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:02,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:02,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:02,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:02,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:02,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:02,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:02,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:02,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:02,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:02,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:02,686 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:51:02,686 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740447860] [2019-10-14 23:51:02,687 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:51:02,687 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:51:02,687 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186447937] [2019-10-14 23:51:02,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:51:02,688 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:51:02,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:51:02,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:51:02,688 INFO L87 Difference]: Start difference. First operand 564 states and 689 transitions. Second operand 10 states. [2019-10-14 23:51:04,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:51:04,850 INFO L93 Difference]: Finished difference Result 1319 states and 1701 transitions. [2019-10-14 23:51:04,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-14 23:51:04,851 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2019-10-14 23:51:04,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:51:04,856 INFO L225 Difference]: With dead ends: 1319 [2019-10-14 23:51:04,856 INFO L226 Difference]: Without dead ends: 777 [2019-10-14 23:51:04,858 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-10-14 23:51:04,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2019-10-14 23:51:04,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 574. [2019-10-14 23:51:04,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-10-14 23:51:04,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 695 transitions. [2019-10-14 23:51:04,914 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 695 transitions. Word has length 105 [2019-10-14 23:51:04,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:51:04,915 INFO L462 AbstractCegarLoop]: Abstraction has 574 states and 695 transitions. [2019-10-14 23:51:04,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:51:04,915 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 695 transitions. [2019-10-14 23:51:04,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-14 23:51:04,916 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:51:04,916 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:51:04,916 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:51:04,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:51:04,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1253503196, now seen corresponding path program 1 times [2019-10-14 23:51:04,917 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:51:04,917 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989993054] [2019-10-14 23:51:04,918 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:04,918 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:04,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:51:04,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:04,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:04,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:04,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:05,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:05,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:05,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:05,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:05,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:05,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:05,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:05,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:05,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:05,136 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:51:05,136 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989993054] [2019-10-14 23:51:05,137 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:51:05,137 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:51:05,138 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555152156] [2019-10-14 23:51:05,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:51:05,139 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:51:05,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:51:05,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:51:05,139 INFO L87 Difference]: Start difference. First operand 574 states and 695 transitions. Second operand 10 states. [2019-10-14 23:51:07,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:51:07,204 INFO L93 Difference]: Finished difference Result 1372 states and 1756 transitions. [2019-10-14 23:51:07,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-14 23:51:07,205 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2019-10-14 23:51:07,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:51:07,211 INFO L225 Difference]: With dead ends: 1372 [2019-10-14 23:51:07,211 INFO L226 Difference]: Without dead ends: 820 [2019-10-14 23:51:07,213 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-10-14 23:51:07,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2019-10-14 23:51:07,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 604. [2019-10-14 23:51:07,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-10-14 23:51:07,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 725 transitions. [2019-10-14 23:51:07,292 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 725 transitions. Word has length 105 [2019-10-14 23:51:07,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:51:07,293 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 725 transitions. [2019-10-14 23:51:07,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:51:07,293 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 725 transitions. [2019-10-14 23:51:07,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-14 23:51:07,294 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:51:07,294 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:51:07,294 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:51:07,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:51:07,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1647869982, now seen corresponding path program 1 times [2019-10-14 23:51:07,295 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:51:07,295 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084688760] [2019-10-14 23:51:07,295 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:07,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:07,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:51:07,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:07,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:07,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:07,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:07,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:07,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:07,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:07,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:07,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:07,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:07,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:07,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:07,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:07,572 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:51:07,573 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084688760] [2019-10-14 23:51:07,573 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:51:07,573 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:51:07,573 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558295636] [2019-10-14 23:51:07,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:51:07,574 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:51:07,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:51:07,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:51:07,574 INFO L87 Difference]: Start difference. First operand 604 states and 725 transitions. Second operand 10 states. [2019-10-14 23:51:09,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:51:09,765 INFO L93 Difference]: Finished difference Result 1567 states and 2021 transitions. [2019-10-14 23:51:09,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-14 23:51:09,765 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2019-10-14 23:51:09,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:51:09,771 INFO L225 Difference]: With dead ends: 1567 [2019-10-14 23:51:09,771 INFO L226 Difference]: Without dead ends: 984 [2019-10-14 23:51:09,773 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2019-10-14 23:51:09,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2019-10-14 23:51:09,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 675. [2019-10-14 23:51:09,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 675 states. [2019-10-14 23:51:09,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 787 transitions. [2019-10-14 23:51:09,839 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 787 transitions. Word has length 105 [2019-10-14 23:51:09,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:51:09,839 INFO L462 AbstractCegarLoop]: Abstraction has 675 states and 787 transitions. [2019-10-14 23:51:09,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:51:09,840 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 787 transitions. [2019-10-14 23:51:09,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-14 23:51:09,841 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:51:09,841 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:51:09,841 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:51:09,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:51:09,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1585830368, now seen corresponding path program 1 times [2019-10-14 23:51:09,842 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:51:09,842 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926647931] [2019-10-14 23:51:09,842 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:09,842 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:09,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:51:09,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:09,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:09,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:09,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:09,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:09,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:09,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:09,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:09,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:09,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:09,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:09,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:09,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:09,970 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:51:09,970 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926647931] [2019-10-14 23:51:09,970 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:51:09,970 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-14 23:51:09,971 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4739699] [2019-10-14 23:51:09,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 23:51:09,971 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:51:09,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 23:51:09,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:51:09,972 INFO L87 Difference]: Start difference. First operand 675 states and 787 transitions. Second operand 7 states. [2019-10-14 23:51:12,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:51:12,278 INFO L93 Difference]: Finished difference Result 2210 states and 2715 transitions. [2019-10-14 23:51:12,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-14 23:51:12,279 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 105 [2019-10-14 23:51:12,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:51:12,286 INFO L225 Difference]: With dead ends: 2210 [2019-10-14 23:51:12,286 INFO L226 Difference]: Without dead ends: 1558 [2019-10-14 23:51:12,288 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-10-14 23:51:12,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2019-10-14 23:51:12,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 1270. [2019-10-14 23:51:12,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1270 states. [2019-10-14 23:51:12,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1515 transitions. [2019-10-14 23:51:12,423 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1515 transitions. Word has length 105 [2019-10-14 23:51:12,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:51:12,424 INFO L462 AbstractCegarLoop]: Abstraction has 1270 states and 1515 transitions. [2019-10-14 23:51:12,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 23:51:12,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1515 transitions. [2019-10-14 23:51:12,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-14 23:51:12,427 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:51:12,427 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:51:12,428 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:51:12,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:51:12,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1038281626, now seen corresponding path program 1 times [2019-10-14 23:51:12,428 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:51:12,429 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128481975] [2019-10-14 23:51:12,429 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:12,429 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:12,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:51:12,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:12,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:12,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:12,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:12,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:12,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:12,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:12,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:12,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:12,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:12,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:12,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:12,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:12,594 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:51:12,595 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128481975] [2019-10-14 23:51:12,595 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:51:12,595 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-14 23:51:12,595 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339305553] [2019-10-14 23:51:12,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 23:51:12,596 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:51:12,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 23:51:12,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:51:12,597 INFO L87 Difference]: Start difference. First operand 1270 states and 1515 transitions. Second operand 7 states.