java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/token_ring.03.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 19:51:23,917 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 19:51:23,920 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 19:51:23,935 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 19:51:23,935 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 19:51:23,937 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 19:51:23,938 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 19:51:23,940 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 19:51:23,952 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 19:51:23,953 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 19:51:23,954 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 19:51:23,955 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 19:51:23,956 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 19:51:23,959 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 19:51:23,962 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 19:51:23,963 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 19:51:23,964 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 19:51:23,968 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 19:51:23,972 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 19:51:23,977 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 19:51:23,982 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 19:51:23,983 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 19:51:23,984 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 19:51:23,985 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 19:51:23,988 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 19:51:23,988 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 19:51:23,989 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 19:51:23,990 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 19:51:23,991 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 19:51:23,992 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 19:51:23,992 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 19:51:23,993 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 19:51:23,994 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 19:51:23,994 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 19:51:23,995 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 19:51:23,996 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 19:51:23,996 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 19:51:23,997 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 19:51:23,997 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 19:51:23,998 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 19:51:23,998 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 19:51:24,002 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-13 19:51:24,024 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 19:51:24,025 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 19:51:24,027 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 19:51:24,027 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 19:51:24,028 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 19:51:24,028 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 19:51:24,028 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 19:51:24,029 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 19:51:24,029 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 19:51:24,029 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 19:51:24,030 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 19:51:24,031 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 19:51:24,031 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 19:51:24,031 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 19:51:24,031 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 19:51:24,032 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 19:51:24,032 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 19:51:24,032 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 19:51:24,032 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 19:51:24,032 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 19:51:24,033 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 19:51:24,033 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:51:24,033 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 19:51:24,033 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 19:51:24,034 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 19:51:24,034 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 19:51:24,034 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 19:51:24,034 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 19:51:24,034 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 19:51:24,385 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 19:51:24,406 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 19:51:24,409 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 19:51:24,411 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 19:51:24,411 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 19:51:24,412 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.03.cil-2.c [2019-10-13 19:51:24,481 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/239735557/8c4244d01a3b44d9afe2fd0585c0c443/FLAGb828c17cf [2019-10-13 19:51:24,989 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 19:51:24,990 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.03.cil-2.c [2019-10-13 19:51:25,009 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/239735557/8c4244d01a3b44d9afe2fd0585c0c443/FLAGb828c17cf [2019-10-13 19:51:25,343 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/239735557/8c4244d01a3b44d9afe2fd0585c0c443 [2019-10-13 19:51:25,355 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 19:51:25,357 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 19:51:25,358 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 19:51:25,358 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 19:51:25,362 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 19:51:25,363 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:51:25" (1/1) ... [2019-10-13 19:51:25,366 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f7e0ad1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:25, skipping insertion in model container [2019-10-13 19:51:25,366 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:51:25" (1/1) ... [2019-10-13 19:51:25,374 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 19:51:25,428 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 19:51:25,663 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:51:25,671 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 19:51:25,809 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:51:25,833 INFO L192 MainTranslator]: Completed translation [2019-10-13 19:51:25,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:25 WrapperNode [2019-10-13 19:51:25,834 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 19:51:25,835 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 19:51:25,835 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 19:51:25,835 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 19:51:25,847 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:25" (1/1) ... [2019-10-13 19:51:25,847 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:25" (1/1) ... [2019-10-13 19:51:25,855 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:25" (1/1) ... [2019-10-13 19:51:25,856 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:25" (1/1) ... [2019-10-13 19:51:25,867 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:25" (1/1) ... [2019-10-13 19:51:25,881 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:25" (1/1) ... [2019-10-13 19:51:25,884 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:25" (1/1) ... [2019-10-13 19:51:25,888 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 19:51:25,889 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 19:51:25,889 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 19:51:25,889 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 19:51:25,890 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:25" (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-13 19:51:25,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 19:51:25,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 19:51:25,952 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-13 19:51:25,952 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-10-13 19:51:25,952 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-10-13 19:51:25,952 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-10-13 19:51:25,952 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-10-13 19:51:25,953 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-10-13 19:51:25,953 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-10-13 19:51:25,953 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-10-13 19:51:25,953 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-10-13 19:51:25,953 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-10-13 19:51:25,953 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-10-13 19:51:25,954 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-10-13 19:51:25,954 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-13 19:51:25,954 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-10-13 19:51:25,954 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-10-13 19:51:25,954 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-10-13 19:51:25,954 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-10-13 19:51:25,955 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-10-13 19:51:25,955 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-10-13 19:51:25,955 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-10-13 19:51:25,955 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-10-13 19:51:25,955 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-13 19:51:25,955 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 19:51:25,956 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 19:51:25,956 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-13 19:51:25,956 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-10-13 19:51:25,956 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-10-13 19:51:25,956 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-10-13 19:51:25,956 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-10-13 19:51:25,957 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-10-13 19:51:25,957 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 19:51:25,957 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-10-13 19:51:25,957 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-10-13 19:51:25,957 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-10-13 19:51:25,957 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-10-13 19:51:25,958 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-10-13 19:51:25,958 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-10-13 19:51:25,958 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-10-13 19:51:25,958 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-13 19:51:25,958 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-10-13 19:51:25,958 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-10-13 19:51:25,958 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-10-13 19:51:25,959 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-10-13 19:51:25,959 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-10-13 19:51:25,959 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-10-13 19:51:25,961 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-10-13 19:51:25,962 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-13 19:51:25,962 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 19:51:25,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 19:51:25,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 19:51:26,687 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 19:51:26,687 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-10-13 19:51:26,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:51:26 BoogieIcfgContainer [2019-10-13 19:51:26,689 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 19:51:26,691 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 19:51:26,691 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 19:51:26,694 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 19:51:26,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:51:25" (1/3) ... [2019-10-13 19:51:26,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e6490f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:51:26, skipping insertion in model container [2019-10-13 19:51:26,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:25" (2/3) ... [2019-10-13 19:51:26,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e6490f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:51:26, skipping insertion in model container [2019-10-13 19:51:26,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:51:26" (3/3) ... [2019-10-13 19:51:26,699 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.03.cil-2.c [2019-10-13 19:51:26,709 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 19:51:26,719 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 19:51:26,733 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 19:51:26,763 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 19:51:26,764 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 19:51:26,764 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 19:51:26,764 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 19:51:26,765 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 19:51:26,765 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 19:51:26,765 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 19:51:26,765 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 19:51:26,799 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states. [2019-10-13 19:51:26,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-13 19:51:26,814 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:26,815 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-13 19:51:26,817 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:26,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:26,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1386466573, now seen corresponding path program 1 times [2019-10-13 19:51:26,834 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:26,835 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378377837] [2019-10-13 19:51:26,835 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:26,835 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:26,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:26,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:27,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:27,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:27,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:27,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:27,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:27,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:27,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:27,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:27,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:27,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:27,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:27,557 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-13 19:51:27,558 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378377837] [2019-10-13 19:51:27,559 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:27,560 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 19:51:27,560 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094469007] [2019-10-13 19:51:27,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 19:51:27,566 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:27,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 19:51:27,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-13 19:51:27,587 INFO L87 Difference]: Start difference. First operand 204 states. Second operand 9 states. [2019-10-13 19:51:31,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:31,177 INFO L93 Difference]: Finished difference Result 757 states and 1195 transitions. [2019-10-13 19:51:31,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 19:51:31,179 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-10-13 19:51:31,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:31,203 INFO L225 Difference]: With dead ends: 757 [2019-10-13 19:51:31,203 INFO L226 Difference]: Without dead ends: 555 [2019-10-13 19:51:31,215 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-10-13 19:51:31,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-10-13 19:51:31,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 366. [2019-10-13 19:51:31,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-10-13 19:51:31,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 511 transitions. [2019-10-13 19:51:31,337 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 511 transitions. Word has length 105 [2019-10-13 19:51:31,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:31,338 INFO L462 AbstractCegarLoop]: Abstraction has 366 states and 511 transitions. [2019-10-13 19:51:31,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 19:51:31,339 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 511 transitions. [2019-10-13 19:51:31,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-13 19:51:31,343 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:31,343 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-13 19:51:31,344 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:31,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:31,344 INFO L82 PathProgramCache]: Analyzing trace with hash 881891251, now seen corresponding path program 1 times [2019-10-13 19:51:31,344 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:31,345 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440683359] [2019-10-13 19:51:31,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:31,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:31,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:31,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:31,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:31,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:31,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:31,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:31,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:31,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:31,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:31,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:31,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:31,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:31,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:31,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:31,679 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-13 19:51:31,680 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440683359] [2019-10-13 19:51:31,680 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:31,680 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:51:31,681 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004162681] [2019-10-13 19:51:31,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:51:31,687 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:31,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:51:31,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:51:31,687 INFO L87 Difference]: Start difference. First operand 366 states and 511 transitions. Second operand 10 states. [2019-10-13 19:51:33,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:33,638 INFO L93 Difference]: Finished difference Result 891 states and 1302 transitions. [2019-10-13 19:51:33,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 19:51:33,638 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2019-10-13 19:51:33,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:33,645 INFO L225 Difference]: With dead ends: 891 [2019-10-13 19:51:33,645 INFO L226 Difference]: Without dead ends: 546 [2019-10-13 19:51:33,649 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-13 19:51:33,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-10-13 19:51:33,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 366. [2019-10-13 19:51:33,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-10-13 19:51:33,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 504 transitions. [2019-10-13 19:51:33,706 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 504 transitions. Word has length 105 [2019-10-13 19:51:33,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:33,707 INFO L462 AbstractCegarLoop]: Abstraction has 366 states and 504 transitions. [2019-10-13 19:51:33,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:51:33,707 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 504 transitions. [2019-10-13 19:51:33,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-13 19:51:33,709 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:33,710 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-13 19:51:33,710 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:33,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:33,710 INFO L82 PathProgramCache]: Analyzing trace with hash -153314573, now seen corresponding path program 1 times [2019-10-13 19:51:33,711 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:33,711 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493870856] [2019-10-13 19:51:33,711 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:33,711 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:33,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:33,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:33,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:33,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:33,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:33,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:33,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:33,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:33,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:33,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:33,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:33,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:33,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:33,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:33,942 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-13 19:51:33,943 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493870856] [2019-10-13 19:51:33,943 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:33,943 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:51:33,944 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24913723] [2019-10-13 19:51:33,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:51:33,944 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:33,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:51:33,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:51:33,945 INFO L87 Difference]: Start difference. First operand 366 states and 504 transitions. Second operand 10 states. [2019-10-13 19:51:35,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:35,730 INFO L93 Difference]: Finished difference Result 887 states and 1280 transitions. [2019-10-13 19:51:35,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 19:51:35,731 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2019-10-13 19:51:35,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:35,739 INFO L225 Difference]: With dead ends: 887 [2019-10-13 19:51:35,740 INFO L226 Difference]: Without dead ends: 542 [2019-10-13 19:51:35,743 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-13 19:51:35,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2019-10-13 19:51:35,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 366. [2019-10-13 19:51:35,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-10-13 19:51:35,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 497 transitions. [2019-10-13 19:51:35,835 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 497 transitions. Word has length 105 [2019-10-13 19:51:35,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:35,836 INFO L462 AbstractCegarLoop]: Abstraction has 366 states and 497 transitions. [2019-10-13 19:51:35,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:51:35,837 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 497 transitions. [2019-10-13 19:51:35,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-13 19:51:35,846 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:35,847 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-13 19:51:35,847 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:35,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:35,848 INFO L82 PathProgramCache]: Analyzing trace with hash 90386355, now seen corresponding path program 1 times [2019-10-13 19:51:35,848 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:35,848 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102387155] [2019-10-13 19:51:35,849 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:35,849 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:35,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:35,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:35,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:35,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:35,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:35,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:36,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:36,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:36,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:36,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:36,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:36,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:36,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:36,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:36,079 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-13 19:51:36,080 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102387155] [2019-10-13 19:51:36,080 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:36,080 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:51:36,081 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004994238] [2019-10-13 19:51:36,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:51:36,082 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:36,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:51:36,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:51:36,082 INFO L87 Difference]: Start difference. First operand 366 states and 497 transitions. Second operand 10 states. [2019-10-13 19:51:38,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:38,688 INFO L93 Difference]: Finished difference Result 1074 states and 1604 transitions. [2019-10-13 19:51:38,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 19:51:38,689 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2019-10-13 19:51:38,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:38,698 INFO L225 Difference]: With dead ends: 1074 [2019-10-13 19:51:38,698 INFO L226 Difference]: Without dead ends: 729 [2019-10-13 19:51:38,701 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-13 19:51:38,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2019-10-13 19:51:38,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 458. [2019-10-13 19:51:38,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2019-10-13 19:51:38,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 602 transitions. [2019-10-13 19:51:38,798 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 602 transitions. Word has length 105 [2019-10-13 19:51:38,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:38,799 INFO L462 AbstractCegarLoop]: Abstraction has 458 states and 602 transitions. [2019-10-13 19:51:38,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:51:38,799 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 602 transitions. [2019-10-13 19:51:38,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-13 19:51:38,801 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:38,802 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-13 19:51:38,802 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:38,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:38,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1442319245, now seen corresponding path program 1 times [2019-10-13 19:51:38,803 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:38,803 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988358717] [2019-10-13 19:51:38,804 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:38,804 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:38,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:38,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:38,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:38,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:38,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:38,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:39,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:39,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:39,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:39,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:39,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:39,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:39,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:39,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:39,108 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-13 19:51:39,109 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988358717] [2019-10-13 19:51:39,109 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:39,109 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:51:39,109 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214995767] [2019-10-13 19:51:39,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:51:39,111 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:39,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:51:39,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:51:39,112 INFO L87 Difference]: Start difference. First operand 458 states and 602 transitions. Second operand 10 states. [2019-10-13 19:51:41,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:41,737 INFO L93 Difference]: Finished difference Result 1284 states and 1852 transitions. [2019-10-13 19:51:41,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-13 19:51:41,738 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2019-10-13 19:51:41,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:41,745 INFO L225 Difference]: With dead ends: 1284 [2019-10-13 19:51:41,745 INFO L226 Difference]: Without dead ends: 847 [2019-10-13 19:51:41,748 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2019-10-13 19:51:41,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2019-10-13 19:51:41,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 550. [2019-10-13 19:51:41,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2019-10-13 19:51:41,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 703 transitions. [2019-10-13 19:51:41,821 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 703 transitions. Word has length 105 [2019-10-13 19:51:41,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:41,822 INFO L462 AbstractCegarLoop]: Abstraction has 550 states and 703 transitions. [2019-10-13 19:51:41,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:51:41,823 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 703 transitions. [2019-10-13 19:51:41,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-13 19:51:41,825 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:41,825 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-13 19:51:41,826 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:41,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:41,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1353214029, now seen corresponding path program 1 times [2019-10-13 19:51:41,826 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:41,827 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546022538] [2019-10-13 19:51:41,827 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:41,827 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:41,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:41,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:41,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:41,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:41,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:41,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:41,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:42,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:42,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:42,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:42,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:42,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:42,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:42,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:42,042 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-13 19:51:42,043 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546022538] [2019-10-13 19:51:42,045 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:42,045 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:51:42,045 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651567343] [2019-10-13 19:51:42,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:51:42,046 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:42,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:51:42,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:51:42,047 INFO L87 Difference]: Start difference. First operand 550 states and 703 transitions. Second operand 10 states. [2019-10-13 19:51:44,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:44,623 INFO L93 Difference]: Finished difference Result 1494 states and 2090 transitions. [2019-10-13 19:51:44,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 19:51:44,623 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2019-10-13 19:51:44,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:44,630 INFO L225 Difference]: With dead ends: 1494 [2019-10-13 19:51:44,630 INFO L226 Difference]: Without dead ends: 965 [2019-10-13 19:51:44,632 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-13 19:51:44,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2019-10-13 19:51:44,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 642. [2019-10-13 19:51:44,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-10-13 19:51:44,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 800 transitions. [2019-10-13 19:51:44,694 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 800 transitions. Word has length 105 [2019-10-13 19:51:44,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:44,694 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 800 transitions. [2019-10-13 19:51:44,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:51:44,695 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 800 transitions. [2019-10-13 19:51:44,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-13 19:51:44,696 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:44,696 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-13 19:51:44,696 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:44,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:44,697 INFO L82 PathProgramCache]: Analyzing trace with hash 864416369, now seen corresponding path program 1 times [2019-10-13 19:51:44,697 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:44,697 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772780344] [2019-10-13 19:51:44,697 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:44,698 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:44,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:44,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:44,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:44,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:44,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:44,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:44,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:44,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:44,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:44,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:44,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:44,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:44,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:44,883 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-13 19:51:44,884 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772780344] [2019-10-13 19:51:44,884 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:44,884 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:51:44,884 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853634211] [2019-10-13 19:51:44,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:51:44,885 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:44,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:51:44,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:51:44,886 INFO L87 Difference]: Start difference. First operand 642 states and 800 transitions. Second operand 10 states. [2019-10-13 19:51:47,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:47,320 INFO L93 Difference]: Finished difference Result 1694 states and 2308 transitions. [2019-10-13 19:51:47,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 19:51:47,321 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2019-10-13 19:51:47,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:47,329 INFO L225 Difference]: With dead ends: 1694 [2019-10-13 19:51:47,329 INFO L226 Difference]: Without dead ends: 1073 [2019-10-13 19:51:47,333 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-13 19:51:47,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2019-10-13 19:51:47,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 728. [2019-10-13 19:51:47,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 728 states. [2019-10-13 19:51:47,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 887 transitions. [2019-10-13 19:51:47,409 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 887 transitions. Word has length 105 [2019-10-13 19:51:47,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:47,410 INFO L462 AbstractCegarLoop]: Abstraction has 728 states and 887 transitions. [2019-10-13 19:51:47,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:51:47,410 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 887 transitions. [2019-10-13 19:51:47,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-13 19:51:47,411 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:47,411 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-13 19:51:47,412 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:47,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:47,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1830459983, now seen corresponding path program 1 times [2019-10-13 19:51:47,412 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:47,413 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605772430] [2019-10-13 19:51:47,413 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:47,413 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:47,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:47,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:47,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:47,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:47,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:47,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:47,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:47,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:47,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:47,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:47,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:47,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:47,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:47,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:47,674 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-13 19:51:47,675 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605772430] [2019-10-13 19:51:47,675 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:47,675 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:51:47,675 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79766811] [2019-10-13 19:51:47,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:51:47,676 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:47,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:51:47,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:51:47,677 INFO L87 Difference]: Start difference. First operand 728 states and 887 transitions. Second operand 10 states. [2019-10-13 19:51:50,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:50,241 INFO L93 Difference]: Finished difference Result 1712 states and 2193 transitions. [2019-10-13 19:51:50,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 19:51:50,242 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2019-10-13 19:51:50,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:50,250 INFO L225 Difference]: With dead ends: 1712 [2019-10-13 19:51:50,250 INFO L226 Difference]: Without dead ends: 1006 [2019-10-13 19:51:50,255 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-10-13 19:51:50,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2019-10-13 19:51:50,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 738. [2019-10-13 19:51:50,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-10-13 19:51:50,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 889 transitions. [2019-10-13 19:51:50,375 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 889 transitions. Word has length 105 [2019-10-13 19:51:50,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:50,375 INFO L462 AbstractCegarLoop]: Abstraction has 738 states and 889 transitions. [2019-10-13 19:51:50,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:51:50,376 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 889 transitions. [2019-10-13 19:51:50,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-13 19:51:50,379 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:50,379 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-13 19:51:50,379 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:50,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:50,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1151187729, now seen corresponding path program 1 times [2019-10-13 19:51:50,380 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:50,380 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79022816] [2019-10-13 19:51:50,380 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:50,380 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:50,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:50,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:50,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:50,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:50,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:50,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:50,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:50,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:50,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:50,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:50,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:50,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:50,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:50,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:50,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:51:50,711 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79022816] [2019-10-13 19:51:50,713 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:50,714 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:51:50,714 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356522381] [2019-10-13 19:51:50,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:51:50,715 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:50,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:51:50,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:51:50,716 INFO L87 Difference]: Start difference. First operand 738 states and 889 transitions. Second operand 10 states. [2019-10-13 19:51:53,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:53,192 INFO L93 Difference]: Finished difference Result 1708 states and 2157 transitions. [2019-10-13 19:51:53,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 19:51:53,192 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2019-10-13 19:51:53,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:53,202 INFO L225 Difference]: With dead ends: 1708 [2019-10-13 19:51:53,202 INFO L226 Difference]: Without dead ends: 992 [2019-10-13 19:51:53,206 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-10-13 19:51:53,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2019-10-13 19:51:53,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 748. [2019-10-13 19:51:53,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2019-10-13 19:51:53,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 891 transitions. [2019-10-13 19:51:53,289 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 891 transitions. Word has length 105 [2019-10-13 19:51:53,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:53,290 INFO L462 AbstractCegarLoop]: Abstraction has 748 states and 891 transitions. [2019-10-13 19:51:53,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:51:53,290 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 891 transitions. [2019-10-13 19:51:53,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-13 19:51:53,291 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:53,292 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-13 19:51:53,292 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:53,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:53,293 INFO L82 PathProgramCache]: Analyzing trace with hash -707287055, now seen corresponding path program 1 times [2019-10-13 19:51:53,293 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:53,293 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849922190] [2019-10-13 19:51:53,293 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:53,293 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:53,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:53,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:53,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:53,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:53,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:53,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:53,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:53,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:53,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:53,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:53,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:53,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:53,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:53,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:51:53,556 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849922190] [2019-10-13 19:51:53,557 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:53,557 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:51:53,558 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670324134] [2019-10-13 19:51:53,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:51:53,559 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:53,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:51:53,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:51:53,559 INFO L87 Difference]: Start difference. First operand 748 states and 891 transitions. Second operand 10 states. [2019-10-13 19:51:56,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:56,259 INFO L93 Difference]: Finished difference Result 1710 states and 2129 transitions. [2019-10-13 19:51:56,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 19:51:56,260 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2019-10-13 19:51:56,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:56,267 INFO L225 Difference]: With dead ends: 1710 [2019-10-13 19:51:56,267 INFO L226 Difference]: Without dead ends: 984 [2019-10-13 19:51:56,270 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-10-13 19:51:56,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2019-10-13 19:51:56,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 758. [2019-10-13 19:51:56,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 758 states. [2019-10-13 19:51:56,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 893 transitions. [2019-10-13 19:51:56,372 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 893 transitions. Word has length 105 [2019-10-13 19:51:56,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:56,373 INFO L462 AbstractCegarLoop]: Abstraction has 758 states and 893 transitions. [2019-10-13 19:51:56,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:51:56,373 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 893 transitions. [2019-10-13 19:51:56,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-13 19:51:56,374 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:56,374 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-13 19:51:56,374 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:56,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:56,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1538292399, now seen corresponding path program 1 times [2019-10-13 19:51:56,375 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:56,375 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65878158] [2019-10-13 19:51:56,375 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:56,376 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:56,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:56,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:56,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:56,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:56,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:56,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:56,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:56,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:56,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:56,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:56,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:56,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:56,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:56,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:56,611 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-13 19:51:56,611 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65878158] [2019-10-13 19:51:56,612 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:56,612 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:51:56,612 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616815407] [2019-10-13 19:51:56,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:51:56,613 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:56,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:51:56,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:51:56,613 INFO L87 Difference]: Start difference. First operand 758 states and 893 transitions. Second operand 10 states. [2019-10-13 19:51:58,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:58,839 INFO L93 Difference]: Finished difference Result 1722 states and 2117 transitions. [2019-10-13 19:51:58,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 19:51:58,840 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2019-10-13 19:51:58,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:58,846 INFO L225 Difference]: With dead ends: 1722 [2019-10-13 19:51:58,846 INFO L226 Difference]: Without dead ends: 986 [2019-10-13 19:51:58,848 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-10-13 19:51:58,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2019-10-13 19:51:58,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 768. [2019-10-13 19:51:58,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 768 states. [2019-10-13 19:51:58,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 895 transitions. [2019-10-13 19:51:58,931 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 895 transitions. Word has length 105 [2019-10-13 19:51:58,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:58,932 INFO L462 AbstractCegarLoop]: Abstraction has 768 states and 895 transitions. [2019-10-13 19:51:58,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:51:58,932 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 895 transitions. [2019-10-13 19:51:58,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-13 19:51:58,933 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:58,933 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-13 19:51:58,934 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:58,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:58,934 INFO L82 PathProgramCache]: Analyzing trace with hash 694286897, now seen corresponding path program 1 times [2019-10-13 19:51:58,934 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:58,935 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520461205] [2019-10-13 19:51:58,935 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:58,935 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:58,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:58,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:59,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:59,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:59,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:59,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:59,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:59,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:59,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:59,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:59,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:59,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:59,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:59,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:59,117 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-13 19:51:59,117 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520461205] [2019-10-13 19:51:59,118 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:59,118 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:51:59,118 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539341666] [2019-10-13 19:51:59,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:51:59,119 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:59,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:51:59,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:51:59,119 INFO L87 Difference]: Start difference. First operand 768 states and 895 transitions. Second operand 10 states. [2019-10-13 19:52:00,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:52:00,721 INFO L93 Difference]: Finished difference Result 1707 states and 2041 transitions. [2019-10-13 19:52:00,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 19:52:00,722 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2019-10-13 19:52:00,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:52:00,727 INFO L225 Difference]: With dead ends: 1707 [2019-10-13 19:52:00,727 INFO L226 Difference]: Without dead ends: 960 [2019-10-13 19:52:00,729 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-13 19:52:00,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2019-10-13 19:52:00,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 768. [2019-10-13 19:52:00,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 768 states. [2019-10-13 19:52:00,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 886 transitions. [2019-10-13 19:52:00,809 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 886 transitions. Word has length 105 [2019-10-13 19:52:00,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:52:00,809 INFO L462 AbstractCegarLoop]: Abstraction has 768 states and 886 transitions. [2019-10-13 19:52:00,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:52:00,810 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 886 transitions. [2019-10-13 19:52:00,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-13 19:52:00,811 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:52:00,811 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-13 19:52:00,811 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:52:00,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:52:00,811 INFO L82 PathProgramCache]: Analyzing trace with hash 184813807, now seen corresponding path program 1 times [2019-10-13 19:52:00,812 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:52:00,812 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842650477] [2019-10-13 19:52:00,812 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:52:00,812 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:52:00,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:52:00,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:52:00,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:52:00,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:52:00,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:52:00,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:52:00,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:52:00,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:52:00,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:52:00,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:52:00,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:52:00,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:52:00,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:52:00,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:52:01,018 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-13 19:52:01,018 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842650477] [2019-10-13 19:52:01,019 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:52:01,019 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 19:52:01,019 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040932401] [2019-10-13 19:52:01,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 19:52:01,020 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:52:01,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 19:52:01,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-13 19:52:01,021 INFO L87 Difference]: Start difference. First operand 768 states and 886 transitions. Second operand 7 states.