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-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 19:51:23,015 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 19:51:23,017 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 19:51:23,035 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 19:51:23,036 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 19:51:23,038 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 19:51:23,040 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 19:51:23,052 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 19:51:23,053 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 19:51:23,054 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 19:51:23,055 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 19:51:23,056 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 19:51:23,056 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 19:51:23,057 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 19:51:23,058 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 19:51:23,059 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 19:51:23,060 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 19:51:23,061 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 19:51:23,063 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 19:51:23,065 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 19:51:23,066 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 19:51:23,067 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 19:51:23,068 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 19:51:23,069 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 19:51:23,071 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 19:51:23,071 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 19:51:23,071 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 19:51:23,072 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 19:51:23,073 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 19:51:23,074 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 19:51:23,074 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 19:51:23,074 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 19:51:23,075 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 19:51:23,076 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 19:51:23,077 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 19:51:23,077 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 19:51:23,078 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 19:51:23,078 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 19:51:23,078 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 19:51:23,079 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 19:51:23,080 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 19:51:23,080 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:23,094 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 19:51:23,095 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 19:51:23,096 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 19:51:23,096 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 19:51:23,096 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 19:51:23,097 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 19:51:23,097 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 19:51:23,097 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 19:51:23,097 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 19:51:23,097 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 19:51:23,098 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 19:51:23,098 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 19:51:23,098 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 19:51:23,098 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 19:51:23,098 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 19:51:23,099 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 19:51:23,099 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 19:51:23,099 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 19:51:23,099 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 19:51:23,099 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 19:51:23,100 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 19:51:23,100 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:51:23,100 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 19:51:23,100 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 19:51:23,100 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 19:51:23,101 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 19:51:23,101 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 19:51:23,101 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 19:51:23,101 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 19:51:23,376 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 19:51:23,396 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 19:51:23,400 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 19:51:23,402 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 19:51:23,403 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 19:51:23,403 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.03.cil-1.c [2019-10-13 19:51:23,482 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0488b491f/2d3d4dac26e04e21ae8acea702d888e2/FLAGd6c767add [2019-10-13 19:51:23,995 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 19:51:23,996 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.03.cil-1.c [2019-10-13 19:51:24,005 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0488b491f/2d3d4dac26e04e21ae8acea702d888e2/FLAGd6c767add [2019-10-13 19:51:24,357 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0488b491f/2d3d4dac26e04e21ae8acea702d888e2 [2019-10-13 19:51:24,367 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 19:51:24,369 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 19:51:24,370 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 19:51:24,370 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 19:51:24,374 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 19:51:24,375 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:51:24" (1/1) ... [2019-10-13 19:51:24,378 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52ea27ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:24, skipping insertion in model container [2019-10-13 19:51:24,378 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:51:24" (1/1) ... [2019-10-13 19:51:24,386 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 19:51:24,420 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 19:51:24,693 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:51:24,699 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 19:51:24,873 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:51:24,894 INFO L192 MainTranslator]: Completed translation [2019-10-13 19:51:24,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:24 WrapperNode [2019-10-13 19:51:24,895 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 19:51:24,896 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 19:51:24,896 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 19:51:24,896 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 19:51:24,909 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:24" (1/1) ... [2019-10-13 19:51:24,909 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:24" (1/1) ... [2019-10-13 19:51:24,917 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:24" (1/1) ... [2019-10-13 19:51:24,918 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:24" (1/1) ... [2019-10-13 19:51:24,939 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:24" (1/1) ... [2019-10-13 19:51:24,950 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:24" (1/1) ... [2019-10-13 19:51:24,953 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:24" (1/1) ... [2019-10-13 19:51:24,957 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 19:51:24,958 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 19:51:24,958 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 19:51:24,958 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 19:51:24,959 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:24" (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,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 19:51:25,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 19:51:25,027 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-13 19:51:25,027 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-10-13 19:51:25,028 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-10-13 19:51:25,028 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-10-13 19:51:25,029 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-10-13 19:51:25,029 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-10-13 19:51:25,029 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-10-13 19:51:25,029 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-10-13 19:51:25,029 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-10-13 19:51:25,030 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-10-13 19:51:25,030 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-10-13 19:51:25,030 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-10-13 19:51:25,031 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-13 19:51:25,031 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-10-13 19:51:25,034 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-10-13 19:51:25,034 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-10-13 19:51:25,034 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-10-13 19:51:25,035 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-10-13 19:51:25,035 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-10-13 19:51:25,035 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-10-13 19:51:25,035 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-10-13 19:51:25,035 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-13 19:51:25,035 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 19:51:25,035 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 19:51:25,036 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-13 19:51:25,036 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-10-13 19:51:25,036 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-10-13 19:51:25,036 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-10-13 19:51:25,036 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-10-13 19:51:25,037 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-10-13 19:51:25,037 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 19:51:25,037 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-10-13 19:51:25,037 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-10-13 19:51:25,037 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-10-13 19:51:25,037 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-10-13 19:51:25,038 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-10-13 19:51:25,038 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-10-13 19:51:25,038 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-10-13 19:51:25,038 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-13 19:51:25,038 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-10-13 19:51:25,039 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-10-13 19:51:25,039 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-10-13 19:51:25,039 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-10-13 19:51:25,039 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-10-13 19:51:25,039 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-10-13 19:51:25,039 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-10-13 19:51:25,040 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-13 19:51:25,040 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 19:51:25,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 19:51:25,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 19:51:25,846 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 19:51:25,847 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-10-13 19:51:25,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:51:25 BoogieIcfgContainer [2019-10-13 19:51:25,849 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 19:51:25,850 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 19:51:25,850 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 19:51:25,854 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 19:51:25,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:51:24" (1/3) ... [2019-10-13 19:51:25,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2564ed54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:51:25, skipping insertion in model container [2019-10-13 19:51:25,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:24" (2/3) ... [2019-10-13 19:51:25,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2564ed54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:51:25, skipping insertion in model container [2019-10-13 19:51:25,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:51:25" (3/3) ... [2019-10-13 19:51:25,858 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.03.cil-1.c [2019-10-13 19:51:25,868 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 19:51:25,878 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 19:51:25,889 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 19:51:25,919 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 19:51:25,919 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 19:51:25,919 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 19:51:25,920 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 19:51:25,920 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 19:51:25,920 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 19:51:25,920 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 19:51:25,921 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 19:51:25,947 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states. [2019-10-13 19:51:25,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 19:51:25,960 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:25,962 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:25,963 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:25,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:25,968 INFO L82 PathProgramCache]: Analyzing trace with hash -604727244, now seen corresponding path program 1 times [2019-10-13 19:51:25,976 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:25,977 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280119694] [2019-10-13 19:51:25,977 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:25,977 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:25,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:26,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:26,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:26,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:26,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:26,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:26,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:26,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:26,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:26,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:26,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:26,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:26,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:26,805 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:26,806 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280119694] [2019-10-13 19:51:26,807 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:26,807 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 19:51:26,808 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980018079] [2019-10-13 19:51:26,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 19:51:26,816 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:26,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 19:51:26,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-13 19:51:26,833 INFO L87 Difference]: Start difference. First operand 211 states. Second operand 9 states. [2019-10-13 19:51:30,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:30,479 INFO L93 Difference]: Finished difference Result 778 states and 1234 transitions. [2019-10-13 19:51:30,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 19:51:30,481 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 106 [2019-10-13 19:51:30,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:30,504 INFO L225 Difference]: With dead ends: 778 [2019-10-13 19:51:30,505 INFO L226 Difference]: Without dead ends: 569 [2019-10-13 19:51:30,512 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:30,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2019-10-13 19:51:30,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 379. [2019-10-13 19:51:30,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2019-10-13 19:51:30,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 534 transitions. [2019-10-13 19:51:30,670 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 534 transitions. Word has length 106 [2019-10-13 19:51:30,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:30,672 INFO L462 AbstractCegarLoop]: Abstraction has 379 states and 534 transitions. [2019-10-13 19:51:30,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 19:51:30,672 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 534 transitions. [2019-10-13 19:51:30,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 19:51:30,684 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:30,685 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:30,686 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:30,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:30,687 INFO L82 PathProgramCache]: Analyzing trace with hash 994888564, now seen corresponding path program 1 times [2019-10-13 19:51:30,688 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:30,688 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913671739] [2019-10-13 19:51:30,688 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:30,689 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:30,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:30,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:30,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:30,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:30,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:30,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:30,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:30,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:31,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:31,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:31,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:31,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:31,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:31,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:31,035 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,036 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913671739] [2019-10-13 19:51:31,036 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:31,036 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:51:31,037 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834785141] [2019-10-13 19:51:31,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:51:31,040 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:31,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:51:31,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:51:31,041 INFO L87 Difference]: Start difference. First operand 379 states and 534 transitions. Second operand 10 states. [2019-10-13 19:51:32,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:32,997 INFO L93 Difference]: Finished difference Result 917 states and 1348 transitions. [2019-10-13 19:51:32,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 19:51:32,999 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 106 [2019-10-13 19:51:32,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:33,006 INFO L225 Difference]: With dead ends: 917 [2019-10-13 19:51:33,007 INFO L226 Difference]: Without dead ends: 559 [2019-10-13 19:51:33,014 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,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-10-13 19:51:33,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 379. [2019-10-13 19:51:33,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2019-10-13 19:51:33,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 527 transitions. [2019-10-13 19:51:33,103 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 527 transitions. Word has length 106 [2019-10-13 19:51:33,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:33,106 INFO L462 AbstractCegarLoop]: Abstraction has 379 states and 527 transitions. [2019-10-13 19:51:33,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:51:33,106 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 527 transitions. [2019-10-13 19:51:33,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 19:51:33,110 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:33,111 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:33,111 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:33,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:33,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1031720908, now seen corresponding path program 1 times [2019-10-13 19:51:33,112 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:33,112 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511924680] [2019-10-13 19:51:33,112 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:33,113 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:33,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:33,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:33,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:33,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:33,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:33,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:33,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:33,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:33,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:33,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:33,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:33,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:33,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:33,372 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,373 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511924680] [2019-10-13 19:51:33,373 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:33,373 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:51:33,373 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041804737] [2019-10-13 19:51:33,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:51:33,374 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:33,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:51:33,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:51:33,375 INFO L87 Difference]: Start difference. First operand 379 states and 527 transitions. Second operand 10 states. [2019-10-13 19:51:35,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:35,280 INFO L93 Difference]: Finished difference Result 913 states and 1326 transitions. [2019-10-13 19:51:35,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 19:51:35,281 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 106 [2019-10-13 19:51:35,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:35,285 INFO L225 Difference]: With dead ends: 913 [2019-10-13 19:51:35,286 INFO L226 Difference]: Without dead ends: 555 [2019-10-13 19:51:35,288 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:35,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-10-13 19:51:35,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 379. [2019-10-13 19:51:35,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2019-10-13 19:51:35,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 520 transitions. [2019-10-13 19:51:35,331 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 520 transitions. Word has length 106 [2019-10-13 19:51:35,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:35,331 INFO L462 AbstractCegarLoop]: Abstraction has 379 states and 520 transitions. [2019-10-13 19:51:35,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:51:35,331 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 520 transitions. [2019-10-13 19:51:35,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 19:51:35,333 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:35,333 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:35,334 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:35,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:35,334 INFO L82 PathProgramCache]: Analyzing trace with hash -2066926732, now seen corresponding path program 1 times [2019-10-13 19:51:35,334 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:35,335 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931440032] [2019-10-13 19:51:35,335 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:35,335 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:35,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:35,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:35,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:35,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:35,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:35,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:35,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:35,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:35,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:35,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:35,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:35,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:35,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:35,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:35,581 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:35,581 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931440032] [2019-10-13 19:51:35,582 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:35,582 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:51:35,582 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219619898] [2019-10-13 19:51:35,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:51:35,583 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:35,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:51:35,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:51:35,584 INFO L87 Difference]: Start difference. First operand 379 states and 520 transitions. Second operand 10 states. [2019-10-13 19:51:38,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:38,183 INFO L93 Difference]: Finished difference Result 1100 states and 1650 transitions. [2019-10-13 19:51:38,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 19:51:38,184 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 106 [2019-10-13 19:51:38,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:38,189 INFO L225 Difference]: With dead ends: 1100 [2019-10-13 19:51:38,190 INFO L226 Difference]: Without dead ends: 742 [2019-10-13 19:51:38,193 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,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2019-10-13 19:51:38,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 471. [2019-10-13 19:51:38,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2019-10-13 19:51:38,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 625 transitions. [2019-10-13 19:51:38,255 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 625 transitions. Word has length 106 [2019-10-13 19:51:38,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:38,255 INFO L462 AbstractCegarLoop]: Abstraction has 471 states and 625 transitions. [2019-10-13 19:51:38,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:51:38,256 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 625 transitions. [2019-10-13 19:51:38,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 19:51:38,257 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:38,257 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:38,257 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:38,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:38,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1958807220, now seen corresponding path program 1 times [2019-10-13 19:51:38,258 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:38,258 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903433087] [2019-10-13 19:51:38,258 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:38,259 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:38,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:38,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:38,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:38,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:38,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:38,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:38,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:38,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:38,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:38,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:38,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:38,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:38,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:38,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:38,516 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:38,517 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903433087] [2019-10-13 19:51:38,518 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:38,518 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:51:38,518 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53119285] [2019-10-13 19:51:38,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:51:38,519 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:38,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:51:38,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:51:38,520 INFO L87 Difference]: Start difference. First operand 471 states and 625 transitions. Second operand 10 states. [2019-10-13 19:51:40,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:40,777 INFO L93 Difference]: Finished difference Result 1310 states and 1898 transitions. [2019-10-13 19:51:40,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-13 19:51:40,778 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 106 [2019-10-13 19:51:40,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:40,785 INFO L225 Difference]: With dead ends: 1310 [2019-10-13 19:51:40,785 INFO L226 Difference]: Without dead ends: 860 [2019-10-13 19:51:40,787 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2019-10-13 19:51:40,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2019-10-13 19:51:40,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 563. [2019-10-13 19:51:40,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-10-13 19:51:40,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 726 transitions. [2019-10-13 19:51:40,857 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 726 transitions. Word has length 106 [2019-10-13 19:51:40,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:40,857 INFO L462 AbstractCegarLoop]: Abstraction has 563 states and 726 transitions. [2019-10-13 19:51:40,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:51:40,857 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 726 transitions. [2019-10-13 19:51:40,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 19:51:40,859 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:40,859 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:40,859 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:40,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:40,860 INFO L82 PathProgramCache]: Analyzing trace with hash 426101620, now seen corresponding path program 1 times [2019-10-13 19:51:40,860 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:40,860 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516855359] [2019-10-13 19:51:40,860 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:40,860 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:40,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:40,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:40,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:40,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:40,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:41,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:41,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:41,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:41,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:41,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:41,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:41,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:41,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:41,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:41,080 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:41,081 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516855359] [2019-10-13 19:51:41,081 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:41,081 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:51:41,081 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594959344] [2019-10-13 19:51:41,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:51:41,082 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:41,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:51:41,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:51:41,083 INFO L87 Difference]: Start difference. First operand 563 states and 726 transitions. Second operand 10 states. [2019-10-13 19:51:43,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:43,435 INFO L93 Difference]: Finished difference Result 1520 states and 2136 transitions. [2019-10-13 19:51:43,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 19:51:43,440 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 106 [2019-10-13 19:51:43,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:43,446 INFO L225 Difference]: With dead ends: 1520 [2019-10-13 19:51:43,447 INFO L226 Difference]: Without dead ends: 978 [2019-10-13 19:51:43,449 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:43,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2019-10-13 19:51:43,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 655. [2019-10-13 19:51:43,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-10-13 19:51:43,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 823 transitions. [2019-10-13 19:51:43,509 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 823 transitions. Word has length 106 [2019-10-13 19:51:43,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:43,509 INFO L462 AbstractCegarLoop]: Abstraction has 655 states and 823 transitions. [2019-10-13 19:51:43,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:51:43,509 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 823 transitions. [2019-10-13 19:51:43,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 19:51:43,511 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:43,511 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:43,511 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:43,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:43,512 INFO L82 PathProgramCache]: Analyzing trace with hash 453167222, now seen corresponding path program 1 times [2019-10-13 19:51:43,512 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:43,512 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551382340] [2019-10-13 19:51:43,512 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:43,512 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:43,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:43,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:43,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:43,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:43,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:43,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:43,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:43,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:43,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:43,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:43,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:43,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:43,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:43,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:43,740 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:43,741 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551382340] [2019-10-13 19:51:43,741 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:43,741 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:51:43,741 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457325892] [2019-10-13 19:51:43,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:51:43,742 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:43,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:51:43,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:51:43,743 INFO L87 Difference]: Start difference. First operand 655 states and 823 transitions. Second operand 10 states. [2019-10-13 19:51:46,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:46,176 INFO L93 Difference]: Finished difference Result 1720 states and 2354 transitions. [2019-10-13 19:51:46,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 19:51:46,177 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 106 [2019-10-13 19:51:46,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:46,184 INFO L225 Difference]: With dead ends: 1720 [2019-10-13 19:51:46,184 INFO L226 Difference]: Without dead ends: 1086 [2019-10-13 19:51:46,187 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:46,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1086 states. [2019-10-13 19:51:46,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1086 to 741. [2019-10-13 19:51:46,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2019-10-13 19:51:46,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 910 transitions. [2019-10-13 19:51:46,259 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 910 transitions. Word has length 106 [2019-10-13 19:51:46,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:46,260 INFO L462 AbstractCegarLoop]: Abstraction has 741 states and 910 transitions. [2019-10-13 19:51:46,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:51:46,260 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 910 transitions. [2019-10-13 19:51:46,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 19:51:46,261 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:46,261 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:46,262 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:46,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:46,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1483621066, now seen corresponding path program 1 times [2019-10-13 19:51:46,262 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:46,263 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036772003] [2019-10-13 19:51:46,263 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:46,263 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:46,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:46,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:46,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:46,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:46,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:46,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:46,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:46,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:46,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:46,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:46,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:46,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:46,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:46,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:46,505 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:46,505 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036772003] [2019-10-13 19:51:46,506 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:46,506 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:51:46,506 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879271279] [2019-10-13 19:51:46,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:51:46,507 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:46,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:51:46,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:51:46,508 INFO L87 Difference]: Start difference. First operand 741 states and 910 transitions. Second operand 10 states. [2019-10-13 19:51:48,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:48,734 INFO L93 Difference]: Finished difference Result 1738 states and 2239 transitions. [2019-10-13 19:51:48,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 19:51:48,735 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 106 [2019-10-13 19:51:48,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:48,740 INFO L225 Difference]: With dead ends: 1738 [2019-10-13 19:51:48,741 INFO L226 Difference]: Without dead ends: 1019 [2019-10-13 19:51:48,744 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-10-13 19:51:48,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2019-10-13 19:51:48,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 751. [2019-10-13 19:51:48,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 751 states. [2019-10-13 19:51:48,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 912 transitions. [2019-10-13 19:51:48,853 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 912 transitions. Word has length 106 [2019-10-13 19:51:48,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:48,854 INFO L462 AbstractCegarLoop]: Abstraction has 751 states and 912 transitions. [2019-10-13 19:51:48,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:51:48,854 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 912 transitions. [2019-10-13 19:51:48,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 19:51:48,858 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:48,858 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:48,858 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:48,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:48,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1901017672, now seen corresponding path program 1 times [2019-10-13 19:51:48,859 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:48,859 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068884864] [2019-10-13 19:51:48,860 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:48,860 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:48,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:48,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:48,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:48,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:48,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:49,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:49,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:49,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:49,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:49,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:49,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:49,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:49,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:49,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:49,131 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:49,132 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068884864] [2019-10-13 19:51:49,133 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:49,133 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:51:49,134 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421046504] [2019-10-13 19:51:49,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:51:49,134 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:49,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:51:49,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:51:49,135 INFO L87 Difference]: Start difference. First operand 751 states and 912 transitions. Second operand 10 states. [2019-10-13 19:51:51,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:51,639 INFO L93 Difference]: Finished difference Result 1734 states and 2203 transitions. [2019-10-13 19:51:51,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 19:51:51,639 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 106 [2019-10-13 19:51:51,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:51,648 INFO L225 Difference]: With dead ends: 1734 [2019-10-13 19:51:51,648 INFO L226 Difference]: Without dead ends: 1005 [2019-10-13 19:51:51,651 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:51,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2019-10-13 19:51:51,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 761. [2019-10-13 19:51:51,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-10-13 19:51:51,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 914 transitions. [2019-10-13 19:51:51,733 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 914 transitions. Word has length 106 [2019-10-13 19:51:51,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:51,734 INFO L462 AbstractCegarLoop]: Abstraction has 761 states and 914 transitions. [2019-10-13 19:51:51,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:51:51,735 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 914 transitions. [2019-10-13 19:51:51,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 19:51:51,736 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:51,736 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:51,736 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:51,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:51,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1024998666, now seen corresponding path program 1 times [2019-10-13 19:51:51,737 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:51,737 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010704627] [2019-10-13 19:51:51,737 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:51,738 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:51,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:51,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:51,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:51,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:51,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:51,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:51,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:51,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:51,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:51,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:51,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:51,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:51,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:51,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:52,009 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:52,010 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010704627] [2019-10-13 19:51:52,011 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:52,011 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:51:52,012 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127827903] [2019-10-13 19:51:52,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:51:52,013 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:52,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:51:52,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:51:52,014 INFO L87 Difference]: Start difference. First operand 761 states and 914 transitions. Second operand 10 states. [2019-10-13 19:51:54,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:54,282 INFO L93 Difference]: Finished difference Result 1736 states and 2175 transitions. [2019-10-13 19:51:54,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 19:51:54,283 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 106 [2019-10-13 19:51:54,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:54,288 INFO L225 Difference]: With dead ends: 1736 [2019-10-13 19:51:54,289 INFO L226 Difference]: Without dead ends: 997 [2019-10-13 19:51:54,291 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:54,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-10-13 19:51:54,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 771. [2019-10-13 19:51:54,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2019-10-13 19:51:54,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 916 transitions. [2019-10-13 19:51:54,397 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 916 transitions. Word has length 106 [2019-10-13 19:51:54,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:54,397 INFO L462 AbstractCegarLoop]: Abstraction has 771 states and 916 transitions. [2019-10-13 19:51:54,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:51:54,398 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 916 transitions. [2019-10-13 19:51:54,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 19:51:54,400 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:54,400 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:54,400 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:54,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:54,401 INFO L82 PathProgramCache]: Analyzing trace with hash -131512328, now seen corresponding path program 1 times [2019-10-13 19:51:54,401 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:54,401 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495325002] [2019-10-13 19:51:54,401 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:54,401 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:54,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:54,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:54,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:54,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:54,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:54,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:54,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:54,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:54,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:54,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:54,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:54,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:54,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:54,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:54,613 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:54,614 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495325002] [2019-10-13 19:51:54,614 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:54,614 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:51:54,614 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371339158] [2019-10-13 19:51:54,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:51:54,615 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:54,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:51:54,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:51:54,616 INFO L87 Difference]: Start difference. First operand 771 states and 916 transitions. Second operand 10 states. [2019-10-13 19:51:56,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:56,952 INFO L93 Difference]: Finished difference Result 1748 states and 2163 transitions. [2019-10-13 19:51:56,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 19:51:56,953 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 106 [2019-10-13 19:51:56,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:56,958 INFO L225 Difference]: With dead ends: 1748 [2019-10-13 19:51:56,958 INFO L226 Difference]: Without dead ends: 999 [2019-10-13 19:51:56,960 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,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2019-10-13 19:51:57,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 781. [2019-10-13 19:51:57,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2019-10-13 19:51:57,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 918 transitions. [2019-10-13 19:51:57,034 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 918 transitions. Word has length 106 [2019-10-13 19:51:57,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:57,034 INFO L462 AbstractCegarLoop]: Abstraction has 781 states and 918 transitions. [2019-10-13 19:51:57,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:51:57,035 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 918 transitions. [2019-10-13 19:51:57,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 19:51:57,036 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:57,036 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:57,036 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:57,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:57,037 INFO L82 PathProgramCache]: Analyzing trace with hash -525879114, now seen corresponding path program 1 times [2019-10-13 19:51:57,037 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:57,037 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587226015] [2019-10-13 19:51:57,037 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:57,037 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:57,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:57,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:57,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:57,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:57,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:57,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:57,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:57,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:57,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:57,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:57,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:57,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:57,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:57,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:57,269 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:57,269 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587226015] [2019-10-13 19:51:57,270 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:57,270 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:51:57,270 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633426991] [2019-10-13 19:51:57,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:51:57,271 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:57,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:51:57,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:51:57,271 INFO L87 Difference]: Start difference. First operand 781 states and 918 transitions. Second operand 10 states. [2019-10-13 19:51:59,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:59,008 INFO L93 Difference]: Finished difference Result 1733 states and 2087 transitions. [2019-10-13 19:51:59,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 19:51:59,009 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 106 [2019-10-13 19:51:59,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:59,016 INFO L225 Difference]: With dead ends: 1733 [2019-10-13 19:51:59,016 INFO L226 Difference]: Without dead ends: 973 [2019-10-13 19:51:59,018 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:59,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2019-10-13 19:51:59,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 781. [2019-10-13 19:51:59,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2019-10-13 19:51:59,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 909 transitions. [2019-10-13 19:51:59,157 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 909 transitions. Word has length 106 [2019-10-13 19:51:59,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:59,158 INFO L462 AbstractCegarLoop]: Abstraction has 781 states and 909 transitions. [2019-10-13 19:51:59,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:51:59,158 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 909 transitions. [2019-10-13 19:51:59,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 19:51:59,160 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:59,160 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:59,161 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:59,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:59,161 INFO L82 PathProgramCache]: Analyzing trace with hash 860324280, now seen corresponding path program 1 times [2019-10-13 19:51:59,161 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:59,162 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313070858] [2019-10-13 19:51:59,162 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:59,162 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:59,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:59,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:59,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:59,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:59,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:59,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:59,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:59,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:59,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:59,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:59,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:59,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:59,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:59,423 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,424 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313070858] [2019-10-13 19:51:59,424 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:59,424 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 19:51:59,424 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047484626] [2019-10-13 19:51:59,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 19:51:59,425 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:59,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 19:51:59,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-13 19:51:59,426 INFO L87 Difference]: Start difference. First operand 781 states and 909 transitions. Second operand 7 states.