/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe031_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 00:49:15,013 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 00:49:15,015 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 00:49:15,044 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 00:49:15,045 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 00:49:15,046 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 00:49:15,047 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 00:49:15,049 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 00:49:15,050 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 00:49:15,051 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 00:49:15,052 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 00:49:15,053 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 00:49:15,053 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 00:49:15,054 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 00:49:15,055 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 00:49:15,056 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 00:49:15,057 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 00:49:15,057 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 00:49:15,059 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 00:49:15,061 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 00:49:15,062 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 00:49:15,063 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 00:49:15,064 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 00:49:15,078 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 00:49:15,080 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 00:49:15,080 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 00:49:15,081 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 00:49:15,081 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 00:49:15,082 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 00:49:15,085 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 00:49:15,085 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 00:49:15,086 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 00:49:15,086 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 00:49:15,087 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 00:49:15,088 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 00:49:15,088 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 00:49:15,089 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 00:49:15,089 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 00:49:15,089 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 00:49:15,090 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 00:49:15,090 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 00:49:15,093 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2021-03-26 00:49:15,123 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 00:49:15,123 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 00:49:15,126 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 00:49:15,127 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 00:49:15,127 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 00:49:15,127 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 00:49:15,127 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 00:49:15,127 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 00:49:15,128 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 00:49:15,128 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 00:49:15,128 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 00:49:15,129 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 00:49:15,129 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 00:49:15,129 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 00:49:15,129 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 00:49:15,129 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 00:49:15,129 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 00:49:15,130 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 00:49:15,130 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 00:49:15,130 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 00:49:15,130 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 00:49:15,130 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:49:15,130 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 00:49:15,130 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 00:49:15,131 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 00:49:15,131 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 00:49:15,131 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 00:49:15,131 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-26 00:49:15,131 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 00:49:15,131 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 00:49:15,131 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 00:49:15,468 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 00:49:15,494 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 00:49:15,497 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 00:49:15,498 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 00:49:15,498 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 00:49:15,499 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_rmo.opt.i [2021-03-26 00:49:15,557 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7b1db0e3/18906bfba00941a096daa595b1c2bb09/FLAG6e230a922 [2021-03-26 00:49:16,091 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 00:49:16,092 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_rmo.opt.i [2021-03-26 00:49:16,103 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7b1db0e3/18906bfba00941a096daa595b1c2bb09/FLAG6e230a922 [2021-03-26 00:49:16,391 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7b1db0e3/18906bfba00941a096daa595b1c2bb09 [2021-03-26 00:49:16,393 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 00:49:16,395 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 00:49:16,396 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 00:49:16,396 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 00:49:16,399 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 00:49:16,399 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:49:16" (1/1) ... [2021-03-26 00:49:16,400 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ba6bbcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:49:16, skipping insertion in model container [2021-03-26 00:49:16,400 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:49:16" (1/1) ... [2021-03-26 00:49:16,417 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 00:49:16,466 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 00:49:16,570 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_rmo.opt.i[949,962] [2021-03-26 00:49:16,775 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:49:16,782 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 00:49:16,792 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_rmo.opt.i[949,962] [2021-03-26 00:49:16,834 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:49:16,891 INFO L208 MainTranslator]: Completed translation [2021-03-26 00:49:16,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:49:16 WrapperNode [2021-03-26 00:49:16,892 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 00:49:16,893 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 00:49:16,893 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 00:49:16,893 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 00:49:16,899 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:49:16" (1/1) ... [2021-03-26 00:49:16,913 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:49:16" (1/1) ... [2021-03-26 00:49:16,943 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 00:49:16,944 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 00:49:16,944 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 00:49:16,944 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 00:49:16,952 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:49:16" (1/1) ... [2021-03-26 00:49:16,952 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:49:16" (1/1) ... [2021-03-26 00:49:16,956 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:49:16" (1/1) ... [2021-03-26 00:49:16,956 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:49:16" (1/1) ... [2021-03-26 00:49:16,963 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:49:16" (1/1) ... [2021-03-26 00:49:16,966 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:49:16" (1/1) ... [2021-03-26 00:49:16,969 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:49:16" (1/1) ... [2021-03-26 00:49:16,973 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 00:49:16,974 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 00:49:16,974 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 00:49:16,974 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 00:49:16,975 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:49:16" (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 [2021-03-26 00:49:17,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 00:49:17,053 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 00:49:17,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 00:49:17,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 00:49:17,054 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 00:49:17,054 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 00:49:17,054 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 00:49:17,054 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 00:49:17,054 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 00:49:17,054 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 00:49:17,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 00:49:17,054 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 00:49:17,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 00:49:17,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 00:49:17,056 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 00:49:18,810 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 00:49:18,810 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 00:49:18,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:49:18 BoogieIcfgContainer [2021-03-26 00:49:18,813 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 00:49:18,814 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 00:49:18,814 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 00:49:18,816 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 00:49:18,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 12:49:16" (1/3) ... [2021-03-26 00:49:18,817 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a7bc79f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:49:18, skipping insertion in model container [2021-03-26 00:49:18,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:49:16" (2/3) ... [2021-03-26 00:49:18,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a7bc79f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:49:18, skipping insertion in model container [2021-03-26 00:49:18,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:49:18" (3/3) ... [2021-03-26 00:49:18,819 INFO L111 eAbstractionObserver]: Analyzing ICFG safe031_rmo.opt.i [2021-03-26 00:49:18,823 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 00:49:18,827 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 00:49:18,828 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 00:49:18,853 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,854 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,854 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,854 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,854 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,854 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,854 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,854 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,855 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,855 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,855 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,855 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,855 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,855 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,855 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,855 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,856 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,856 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,856 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,856 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,856 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,856 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,856 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,856 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,857 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,857 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,857 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,857 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,857 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,857 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,858 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,858 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,858 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,858 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,858 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,858 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,859 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,859 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,859 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,859 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,859 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,859 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,860 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,860 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,860 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,860 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,860 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,861 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,862 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,862 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,862 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,862 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,862 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,862 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,862 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,862 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,863 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,863 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,863 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,863 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,863 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,865 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,865 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,865 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,865 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,867 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,867 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,867 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,868 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,868 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,868 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,868 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,868 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,868 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,868 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,869 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,869 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,870 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,870 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,870 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,870 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,870 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,870 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,870 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,870 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,871 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,871 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:49:18,872 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 00:49:18,888 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-26 00:49:18,905 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 00:49:18,905 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 00:49:18,905 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 00:49:18,905 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 00:49:18,905 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 00:49:18,905 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 00:49:18,905 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 00:49:18,905 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 00:49:18,914 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 104 places, 96 transitions, 207 flow [2021-03-26 00:49:18,943 INFO L129 PetriNetUnfolder]: 2/93 cut-off events. [2021-03-26 00:49:18,944 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:49:18,947 INFO L84 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2021-03-26 00:49:18,947 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 96 transitions, 207 flow [2021-03-26 00:49:18,951 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 93 transitions, 195 flow [2021-03-26 00:49:18,952 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:49:18,963 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 93 transitions, 195 flow [2021-03-26 00:49:18,966 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 93 transitions, 195 flow [2021-03-26 00:49:18,967 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 101 places, 93 transitions, 195 flow [2021-03-26 00:49:18,983 INFO L129 PetriNetUnfolder]: 2/93 cut-off events. [2021-03-26 00:49:18,983 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:49:18,984 INFO L84 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2021-03-26 00:49:18,986 INFO L142 LiptonReduction]: Number of co-enabled transitions 1578 [2021-03-26 00:49:20,283 WARN L205 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 00:49:20,649 WARN L205 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 00:49:20,754 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-26 00:49:21,444 WARN L205 SmtUtils]: Spent 687.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2021-03-26 00:49:21,747 WARN L205 SmtUtils]: Spent 301.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2021-03-26 00:49:23,128 WARN L205 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 310 DAG size of output: 265 [2021-03-26 00:49:23,716 WARN L205 SmtUtils]: Spent 586.00 ms on a formula simplification that was a NOOP. DAG size: 262 [2021-03-26 00:49:25,261 WARN L205 SmtUtils]: Spent 583.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 185 [2021-03-26 00:49:25,589 WARN L205 SmtUtils]: Spent 322.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-03-26 00:49:26,225 WARN L205 SmtUtils]: Spent 633.00 ms on a formula simplification that was a NOOP. DAG size: 264 [2021-03-26 00:49:26,874 WARN L205 SmtUtils]: Spent 633.00 ms on a formula simplification that was a NOOP. DAG size: 264 [2021-03-26 00:49:27,126 INFO L154 LiptonReduction]: Checked pairs total: 2611 [2021-03-26 00:49:27,126 INFO L156 LiptonReduction]: Total number of compositions: 66 [2021-03-26 00:49:27,129 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8178 [2021-03-26 00:49:27,142 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-03-26 00:49:27,142 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:49:27,142 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:49:27,143 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:49:27,143 INFO L428 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:49:27,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:49:27,149 INFO L82 PathProgramCache]: Analyzing trace with hash -2045016767, now seen corresponding path program 1 times [2021-03-26 00:49:27,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:49:27,157 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063595087] [2021-03-26 00:49:27,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:49:27,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:49:27,429 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:27,429 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:49:27,430 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:27,431 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:49:27,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:49:27,437 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063595087] [2021-03-26 00:49:27,437 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:49:27,438 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:49:27,438 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137286834] [2021-03-26 00:49:27,445 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:49:27,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:49:27,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:49:27,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:49:27,457 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 162 [2021-03-26 00:49:27,460 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:27,460 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:49:27,460 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 162 [2021-03-26 00:49:27,461 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:49:27,527 INFO L129 PetriNetUnfolder]: 23/92 cut-off events. [2021-03-26 00:49:27,527 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:49:27,528 INFO L84 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 92 events. 23/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 307 event pairs, 9 based on Foata normal form. 6/91 useless extension candidates. Maximal degree in co-relation 131. Up to 37 conditions per place. [2021-03-26 00:49:27,529 INFO L132 encePairwiseOnDemand]: 158/162 looper letters, 7 selfloop transitions, 2 changer transitions 4/38 dead transitions. [2021-03-26 00:49:27,529 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 38 transitions, 107 flow [2021-03-26 00:49:27,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:49:27,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:49:27,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 431 transitions. [2021-03-26 00:49:27,549 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8868312757201646 [2021-03-26 00:49:27,550 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 431 transitions. [2021-03-26 00:49:27,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 431 transitions. [2021-03-26 00:49:27,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:49:27,556 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 431 transitions. [2021-03-26 00:49:27,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:27,573 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:27,574 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:27,575 INFO L185 Difference]: Start difference. First operand has 46 places, 37 transitions, 83 flow. Second operand 3 states and 431 transitions. [2021-03-26 00:49:27,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 38 transitions, 107 flow [2021-03-26 00:49:27,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 38 transitions, 104 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-26 00:49:27,580 INFO L241 Difference]: Finished difference. Result has 43 places, 31 transitions, 72 flow [2021-03-26 00:49:27,581 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2021-03-26 00:49:27,582 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -3 predicate places. [2021-03-26 00:49:27,582 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:49:27,582 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 31 transitions, 72 flow [2021-03-26 00:49:27,583 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 31 transitions, 72 flow [2021-03-26 00:49:27,584 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 31 transitions, 72 flow [2021-03-26 00:49:27,595 INFO L129 PetriNetUnfolder]: 0/31 cut-off events. [2021-03-26 00:49:27,595 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:49:27,596 INFO L84 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 31 events. 0/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 26 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 00:49:27,598 INFO L142 LiptonReduction]: Number of co-enabled transitions 230 [2021-03-26 00:49:27,965 WARN L205 SmtUtils]: Spent 310.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-26 00:49:28,280 WARN L205 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-26 00:49:28,900 WARN L205 SmtUtils]: Spent 616.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-26 00:49:29,520 WARN L205 SmtUtils]: Spent 618.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-26 00:49:30,406 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2021-03-26 00:49:30,562 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2021-03-26 00:49:30,622 INFO L154 LiptonReduction]: Checked pairs total: 1024 [2021-03-26 00:49:30,622 INFO L156 LiptonReduction]: Total number of compositions: 9 [2021-03-26 00:49:30,623 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3041 [2021-03-26 00:49:30,624 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 54 flow [2021-03-26 00:49:30,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:30,625 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:49:30,625 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:49:30,625 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 00:49:30,625 INFO L428 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:49:30,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:49:30,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1019057741, now seen corresponding path program 1 times [2021-03-26 00:49:30,626 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:49:30,626 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528407333] [2021-03-26 00:49:30,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:49:30,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:49:30,731 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:30,732 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:49:30,733 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:30,733 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:49:30,742 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 00:49:30,743 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:49:30,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:49:30,746 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528407333] [2021-03-26 00:49:30,747 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:49:30,747 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:49:30,747 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338871467] [2021-03-26 00:49:30,748 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:49:30,748 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:49:30,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:49:30,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:49:30,750 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 171 [2021-03-26 00:49:30,750 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:30,750 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:49:30,751 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 171 [2021-03-26 00:49:30,751 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:49:30,766 INFO L129 PetriNetUnfolder]: 3/32 cut-off events. [2021-03-26 00:49:30,767 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-26 00:49:30,767 INFO L84 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 32 events. 3/32 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 60 event pairs, 1 based on Foata normal form. 1/31 useless extension candidates. Maximal degree in co-relation 43. Up to 10 conditions per place. [2021-03-26 00:49:30,767 INFO L132 encePairwiseOnDemand]: 167/171 looper letters, 3 selfloop transitions, 3 changer transitions 0/24 dead transitions. [2021-03-26 00:49:30,767 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 24 transitions, 70 flow [2021-03-26 00:49:30,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:49:30,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:49:30,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 439 transitions. [2021-03-26 00:49:30,769 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8557504873294347 [2021-03-26 00:49:30,769 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 439 transitions. [2021-03-26 00:49:30,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 439 transitions. [2021-03-26 00:49:30,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:49:30,770 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 439 transitions. [2021-03-26 00:49:30,771 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:30,772 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:30,772 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:30,773 INFO L185 Difference]: Start difference. First operand has 31 places, 22 transitions, 54 flow. Second operand 3 states and 439 transitions. [2021-03-26 00:49:30,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 24 transitions, 70 flow [2021-03-26 00:49:30,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 24 transitions, 66 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:49:30,774 INFO L241 Difference]: Finished difference. Result has 32 places, 24 transitions, 69 flow [2021-03-26 00:49:30,774 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2021-03-26 00:49:30,774 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -14 predicate places. [2021-03-26 00:49:30,774 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:49:30,775 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 24 transitions, 69 flow [2021-03-26 00:49:30,775 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 24 transitions, 69 flow [2021-03-26 00:49:30,775 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 32 places, 24 transitions, 69 flow [2021-03-26 00:49:30,779 INFO L129 PetriNetUnfolder]: 3/30 cut-off events. [2021-03-26 00:49:30,780 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-26 00:49:30,780 INFO L84 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 30 events. 3/30 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 55 event pairs, 1 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 42. Up to 10 conditions per place. [2021-03-26 00:49:30,780 INFO L142 LiptonReduction]: Number of co-enabled transitions 230 [2021-03-26 00:49:31,129 WARN L205 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-03-26 00:49:31,257 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-26 00:49:31,539 WARN L205 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-03-26 00:49:31,667 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-26 00:49:31,670 INFO L154 LiptonReduction]: Checked pairs total: 460 [2021-03-26 00:49:31,670 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:49:31,670 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 896 [2021-03-26 00:49:31,672 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 67 flow [2021-03-26 00:49:31,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:31,672 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:49:31,672 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:49:31,672 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 00:49:31,672 INFO L428 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:49:31,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:49:31,673 INFO L82 PathProgramCache]: Analyzing trace with hash -2077256385, now seen corresponding path program 1 times [2021-03-26 00:49:31,673 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:49:31,673 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257795014] [2021-03-26 00:49:31,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:49:31,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:49:31,765 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:31,765 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:49:31,768 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:31,768 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:49:31,775 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:31,775 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:49:31,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:49:31,782 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257795014] [2021-03-26 00:49:31,782 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:49:31,783 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:49:31,783 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353331373] [2021-03-26 00:49:31,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:49:31,783 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:49:31,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:49:31,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:49:31,785 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 172 [2021-03-26 00:49:31,785 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 23 transitions, 67 flow. Second operand has 5 states, 5 states have (on average 133.8) internal successors, (669), 5 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:31,786 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:49:31,786 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 172 [2021-03-26 00:49:31,786 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:49:31,845 INFO L129 PetriNetUnfolder]: 61/138 cut-off events. [2021-03-26 00:49:31,845 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2021-03-26 00:49:31,846 INFO L84 FinitePrefix]: Finished finitePrefix Result has 292 conditions, 138 events. 61/138 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 505 event pairs, 28 based on Foata normal form. 1/135 useless extension candidates. Maximal degree in co-relation 282. Up to 85 conditions per place. [2021-03-26 00:49:31,847 INFO L132 encePairwiseOnDemand]: 166/172 looper letters, 7 selfloop transitions, 7 changer transitions 0/30 dead transitions. [2021-03-26 00:49:31,847 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 30 transitions, 111 flow [2021-03-26 00:49:31,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:49:31,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:49:31,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 547 transitions. [2021-03-26 00:49:31,849 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7950581395348837 [2021-03-26 00:49:31,849 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 547 transitions. [2021-03-26 00:49:31,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 547 transitions. [2021-03-26 00:49:31,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:49:31,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 547 transitions. [2021-03-26 00:49:31,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 136.75) internal successors, (547), 4 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:31,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:31,853 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:31,853 INFO L185 Difference]: Start difference. First operand has 31 places, 23 transitions, 67 flow. Second operand 4 states and 547 transitions. [2021-03-26 00:49:31,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 30 transitions, 111 flow [2021-03-26 00:49:31,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 30 transitions, 108 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:49:31,854 INFO L241 Difference]: Finished difference. Result has 35 places, 29 transitions, 112 flow [2021-03-26 00:49:31,854 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=35, PETRI_TRANSITIONS=29} [2021-03-26 00:49:31,854 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -11 predicate places. [2021-03-26 00:49:31,854 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:49:31,854 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 29 transitions, 112 flow [2021-03-26 00:49:31,855 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 29 transitions, 112 flow [2021-03-26 00:49:31,855 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 29 transitions, 112 flow [2021-03-26 00:49:31,865 INFO L129 PetriNetUnfolder]: 22/85 cut-off events. [2021-03-26 00:49:31,865 INFO L130 PetriNetUnfolder]: For 36/39 co-relation queries the response was YES. [2021-03-26 00:49:31,866 INFO L84 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 85 events. 22/85 cut-off events. For 36/39 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 321 event pairs, 2 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 175. Up to 29 conditions per place. [2021-03-26 00:49:31,867 INFO L142 LiptonReduction]: Number of co-enabled transitions 292 [2021-03-26 00:49:31,976 INFO L154 LiptonReduction]: Checked pairs total: 135 [2021-03-26 00:49:31,976 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:49:31,976 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 122 [2021-03-26 00:49:31,979 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 29 transitions, 112 flow [2021-03-26 00:49:31,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 133.8) internal successors, (669), 5 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:31,980 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:49:31,980 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:49:31,980 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 00:49:31,981 INFO L428 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:49:31,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:49:31,982 INFO L82 PathProgramCache]: Analyzing trace with hash 461669018, now seen corresponding path program 1 times [2021-03-26 00:49:31,983 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:49:31,983 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687619478] [2021-03-26 00:49:31,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:49:32,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:49:32,088 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.8 percent of original size [2021-03-26 00:49:32,090 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-26 00:49:32,122 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.4 percent of original size [2021-03-26 00:49:32,123 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-26 00:49:32,141 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.4 percent of original size [2021-03-26 00:49:32,142 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-26 00:49:32,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:49:32,160 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687619478] [2021-03-26 00:49:32,160 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:49:32,160 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:49:32,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916605861] [2021-03-26 00:49:32,161 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:49:32,161 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:49:32,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:49:32,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:49:32,162 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 172 [2021-03-26 00:49:32,163 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 124.8) internal successors, (624), 5 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:32,163 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:49:32,163 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 172 [2021-03-26 00:49:32,163 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:49:32,269 INFO L129 PetriNetUnfolder]: 50/130 cut-off events. [2021-03-26 00:49:32,269 INFO L130 PetriNetUnfolder]: For 96/99 co-relation queries the response was YES. [2021-03-26 00:49:32,272 INFO L84 FinitePrefix]: Finished finitePrefix Result has 348 conditions, 130 events. 50/130 cut-off events. For 96/99 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 480 event pairs, 27 based on Foata normal form. 7/135 useless extension candidates. Maximal degree in co-relation 335. Up to 74 conditions per place. [2021-03-26 00:49:32,274 INFO L132 encePairwiseOnDemand]: 167/172 looper letters, 8 selfloop transitions, 7 changer transitions 0/31 dead transitions. [2021-03-26 00:49:32,274 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 31 transitions, 147 flow [2021-03-26 00:49:32,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:49:32,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:49:32,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 510 transitions. [2021-03-26 00:49:32,277 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7412790697674418 [2021-03-26 00:49:32,277 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 510 transitions. [2021-03-26 00:49:32,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 510 transitions. [2021-03-26 00:49:32,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:49:32,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 510 transitions. [2021-03-26 00:49:32,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.5) internal successors, (510), 4 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:32,281 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:32,281 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:32,281 INFO L185 Difference]: Start difference. First operand has 35 places, 29 transitions, 112 flow. Second operand 4 states and 510 transitions. [2021-03-26 00:49:32,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 31 transitions, 147 flow [2021-03-26 00:49:32,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 31 transitions, 147 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-26 00:49:32,283 INFO L241 Difference]: Finished difference. Result has 39 places, 30 transitions, 138 flow [2021-03-26 00:49:32,284 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2021-03-26 00:49:32,284 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -7 predicate places. [2021-03-26 00:49:32,284 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:49:32,284 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 30 transitions, 138 flow [2021-03-26 00:49:32,284 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 30 transitions, 138 flow [2021-03-26 00:49:32,285 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 30 transitions, 138 flow [2021-03-26 00:49:32,294 INFO L129 PetriNetUnfolder]: 17/70 cut-off events. [2021-03-26 00:49:32,294 INFO L130 PetriNetUnfolder]: For 45/45 co-relation queries the response was YES. [2021-03-26 00:49:32,295 INFO L84 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 70 events. 17/70 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 230 event pairs, 7 based on Foata normal form. 0/66 useless extension candidates. Maximal degree in co-relation 167. Up to 23 conditions per place. [2021-03-26 00:49:32,298 INFO L142 LiptonReduction]: Number of co-enabled transitions 294 [2021-03-26 00:49:32,404 INFO L154 LiptonReduction]: Checked pairs total: 185 [2021-03-26 00:49:32,404 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:49:32,404 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 120 [2021-03-26 00:49:32,409 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 138 flow [2021-03-26 00:49:32,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 124.8) internal successors, (624), 5 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:32,410 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:49:32,410 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:49:32,410 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 00:49:32,410 INFO L428 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:49:32,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:49:32,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1418558499, now seen corresponding path program 1 times [2021-03-26 00:49:32,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:49:32,411 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261524759] [2021-03-26 00:49:32,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:49:32,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:49:32,466 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-03-26 00:49:32,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-26 00:49:32,491 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.7 percent of original size [2021-03-26 00:49:32,492 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-26 00:49:32,520 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:32,520 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:49:32,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:49:32,529 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261524759] [2021-03-26 00:49:32,529 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:49:32,529 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:49:32,529 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063728902] [2021-03-26 00:49:32,529 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:49:32,529 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:49:32,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:49:32,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:49:32,531 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 172 [2021-03-26 00:49:32,531 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 138 flow. Second operand has 5 states, 5 states have (on average 128.8) internal successors, (644), 5 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:32,531 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:49:32,532 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 172 [2021-03-26 00:49:32,532 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:49:32,619 INFO L129 PetriNetUnfolder]: 49/123 cut-off events. [2021-03-26 00:49:32,620 INFO L130 PetriNetUnfolder]: For 159/162 co-relation queries the response was YES. [2021-03-26 00:49:32,620 INFO L84 FinitePrefix]: Finished finitePrefix Result has 385 conditions, 123 events. 49/123 cut-off events. For 159/162 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 448 event pairs, 6 based on Foata normal form. 5/126 useless extension candidates. Maximal degree in co-relation 369. Up to 66 conditions per place. [2021-03-26 00:49:32,621 INFO L132 encePairwiseOnDemand]: 168/172 looper letters, 13 selfloop transitions, 4 changer transitions 0/33 dead transitions. [2021-03-26 00:49:32,621 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 33 transitions, 182 flow [2021-03-26 00:49:32,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:49:32,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:49:32,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 525 transitions. [2021-03-26 00:49:32,624 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7630813953488372 [2021-03-26 00:49:32,624 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 525 transitions. [2021-03-26 00:49:32,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 525 transitions. [2021-03-26 00:49:32,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:49:32,625 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 525 transitions. [2021-03-26 00:49:32,626 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 131.25) internal successors, (525), 4 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:32,628 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:32,628 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:32,628 INFO L185 Difference]: Start difference. First operand has 39 places, 30 transitions, 138 flow. Second operand 4 states and 525 transitions. [2021-03-26 00:49:32,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 33 transitions, 182 flow [2021-03-26 00:49:32,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 33 transitions, 173 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:49:32,631 INFO L241 Difference]: Finished difference. Result has 41 places, 30 transitions, 141 flow [2021-03-26 00:49:32,631 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=141, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2021-03-26 00:49:32,631 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -5 predicate places. [2021-03-26 00:49:32,631 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:49:32,632 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 30 transitions, 141 flow [2021-03-26 00:49:32,632 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 30 transitions, 141 flow [2021-03-26 00:49:32,632 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 30 transitions, 141 flow [2021-03-26 00:49:32,643 INFO L129 PetriNetUnfolder]: 17/70 cut-off events. [2021-03-26 00:49:32,643 INFO L130 PetriNetUnfolder]: For 78/79 co-relation queries the response was YES. [2021-03-26 00:49:32,643 INFO L84 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 70 events. 17/70 cut-off events. For 78/79 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 222 event pairs, 5 based on Foata normal form. 1/67 useless extension candidates. Maximal degree in co-relation 168. Up to 22 conditions per place. [2021-03-26 00:49:32,644 INFO L142 LiptonReduction]: Number of co-enabled transitions 294 [2021-03-26 00:49:32,714 INFO L154 LiptonReduction]: Checked pairs total: 196 [2021-03-26 00:49:32,715 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:49:32,715 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 84 [2021-03-26 00:49:32,718 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 141 flow [2021-03-26 00:49:32,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 128.8) internal successors, (644), 5 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:32,719 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:49:32,719 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:49:32,719 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 00:49:32,719 INFO L428 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:49:32,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:49:32,728 INFO L82 PathProgramCache]: Analyzing trace with hash -101886039, now seen corresponding path program 1 times [2021-03-26 00:49:32,728 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:49:32,728 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057439837] [2021-03-26 00:49:32,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:49:32,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:49:32,788 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:32,788 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:49:32,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:32,790 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:49:32,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:49:32,794 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057439837] [2021-03-26 00:49:32,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:49:32,796 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:49:32,797 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205873299] [2021-03-26 00:49:32,797 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:49:32,797 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:49:32,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:49:32,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:49:32,798 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 172 [2021-03-26 00:49:32,799 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 141 flow. Second operand has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:32,800 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:49:32,800 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 172 [2021-03-26 00:49:32,800 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:49:32,825 INFO L129 PetriNetUnfolder]: 18/77 cut-off events. [2021-03-26 00:49:32,825 INFO L130 PetriNetUnfolder]: For 201/229 co-relation queries the response was YES. [2021-03-26 00:49:32,825 INFO L84 FinitePrefix]: Finished finitePrefix Result has 225 conditions, 77 events. 18/77 cut-off events. For 201/229 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 293 event pairs, 5 based on Foata normal form. 9/80 useless extension candidates. Maximal degree in co-relation 208. Up to 29 conditions per place. [2021-03-26 00:49:32,826 INFO L132 encePairwiseOnDemand]: 169/172 looper letters, 3 selfloop transitions, 3 changer transitions 0/30 dead transitions. [2021-03-26 00:49:32,826 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 30 transitions, 153 flow [2021-03-26 00:49:32,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:49:32,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:49:32,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 450 transitions. [2021-03-26 00:49:32,828 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.872093023255814 [2021-03-26 00:49:32,829 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 450 transitions. [2021-03-26 00:49:32,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 450 transitions. [2021-03-26 00:49:32,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:49:32,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 450 transitions. [2021-03-26 00:49:32,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:32,833 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:32,833 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:32,834 INFO L185 Difference]: Start difference. First operand has 41 places, 30 transitions, 141 flow. Second operand 3 states and 450 transitions. [2021-03-26 00:49:32,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 30 transitions, 153 flow [2021-03-26 00:49:32,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 30 transitions, 145 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 00:49:32,840 INFO L241 Difference]: Finished difference. Result has 42 places, 30 transitions, 144 flow [2021-03-26 00:49:32,840 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2021-03-26 00:49:32,841 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -4 predicate places. [2021-03-26 00:49:32,841 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:49:32,841 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 30 transitions, 144 flow [2021-03-26 00:49:32,841 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 30 transitions, 144 flow [2021-03-26 00:49:32,842 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 30 transitions, 144 flow [2021-03-26 00:49:32,855 INFO L129 PetriNetUnfolder]: 15/75 cut-off events. [2021-03-26 00:49:32,855 INFO L130 PetriNetUnfolder]: For 85/91 co-relation queries the response was YES. [2021-03-26 00:49:32,856 INFO L84 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 75 events. 15/75 cut-off events. For 85/91 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 272 event pairs, 2 based on Foata normal form. 3/76 useless extension candidates. Maximal degree in co-relation 182. Up to 26 conditions per place. [2021-03-26 00:49:32,857 INFO L142 LiptonReduction]: Number of co-enabled transitions 294 [2021-03-26 00:49:32,988 INFO L154 LiptonReduction]: Checked pairs total: 242 [2021-03-26 00:49:32,988 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:49:32,988 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 147 [2021-03-26 00:49:32,989 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 144 flow [2021-03-26 00:49:32,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:32,990 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:49:32,990 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:49:32,990 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 00:49:32,990 INFO L428 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:49:32,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:49:32,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1121860493, now seen corresponding path program 1 times [2021-03-26 00:49:32,991 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:49:32,991 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740372216] [2021-03-26 00:49:32,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:49:33,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:49:33,038 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:33,039 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:49:33,048 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.2 percent of original size [2021-03-26 00:49:33,049 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-26 00:49:33,066 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-03-26 00:49:33,068 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-26 00:49:33,088 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.7 percent of original size [2021-03-26 00:49:33,090 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-26 00:49:33,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:49:33,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740372216] [2021-03-26 00:49:33,114 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:49:33,114 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:49:33,114 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870997073] [2021-03-26 00:49:33,115 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:49:33,115 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:49:33,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:49:33,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:49:33,116 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 172 [2021-03-26 00:49:33,117 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 144 flow. Second operand has 6 states, 6 states have (on average 129.83333333333334) internal successors, (779), 6 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:33,117 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:49:33,117 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 172 [2021-03-26 00:49:33,117 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:49:33,197 INFO L129 PetriNetUnfolder]: 39/141 cut-off events. [2021-03-26 00:49:33,197 INFO L130 PetriNetUnfolder]: For 272/289 co-relation queries the response was YES. [2021-03-26 00:49:33,197 INFO L84 FinitePrefix]: Finished finitePrefix Result has 426 conditions, 141 events. 39/141 cut-off events. For 272/289 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 672 event pairs, 4 based on Foata normal form. 8/144 useless extension candidates. Maximal degree in co-relation 409. Up to 64 conditions per place. [2021-03-26 00:49:33,198 INFO L132 encePairwiseOnDemand]: 165/172 looper letters, 10 selfloop transitions, 9 changer transitions 0/35 dead transitions. [2021-03-26 00:49:33,198 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 35 transitions, 200 flow [2021-03-26 00:49:33,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:49:33,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:49:33,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 659 transitions. [2021-03-26 00:49:33,201 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7662790697674419 [2021-03-26 00:49:33,201 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 659 transitions. [2021-03-26 00:49:33,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 659 transitions. [2021-03-26 00:49:33,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:49:33,201 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 659 transitions. [2021-03-26 00:49:33,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:33,204 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:33,204 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:33,205 INFO L185 Difference]: Start difference. First operand has 42 places, 30 transitions, 144 flow. Second operand 5 states and 659 transitions. [2021-03-26 00:49:33,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 35 transitions, 200 flow [2021-03-26 00:49:33,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 35 transitions, 195 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-26 00:49:33,207 INFO L241 Difference]: Finished difference. Result has 46 places, 33 transitions, 183 flow [2021-03-26 00:49:33,207 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=183, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2021-03-26 00:49:33,207 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, 0 predicate places. [2021-03-26 00:49:33,207 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:49:33,208 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 33 transitions, 183 flow [2021-03-26 00:49:33,208 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 33 transitions, 183 flow [2021-03-26 00:49:33,208 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 33 transitions, 183 flow [2021-03-26 00:49:33,224 INFO L129 PetriNetUnfolder]: 43/128 cut-off events. [2021-03-26 00:49:33,224 INFO L130 PetriNetUnfolder]: For 318/345 co-relation queries the response was YES. [2021-03-26 00:49:33,225 INFO L84 FinitePrefix]: Finished finitePrefix Result has 423 conditions, 128 events. 43/128 cut-off events. For 318/345 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 572 event pairs, 6 based on Foata normal form. 5/119 useless extension candidates. Maximal degree in co-relation 406. Up to 64 conditions per place. [2021-03-26 00:49:33,226 INFO L142 LiptonReduction]: Number of co-enabled transitions 328 [2021-03-26 00:49:33,236 INFO L154 LiptonReduction]: Checked pairs total: 215 [2021-03-26 00:49:33,237 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:49:33,237 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 30 [2021-03-26 00:49:33,237 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 183 flow [2021-03-26 00:49:33,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 129.83333333333334) internal successors, (779), 6 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:33,238 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:49:33,238 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:49:33,238 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 00:49:33,238 INFO L428 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:49:33,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:49:33,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1121455943, now seen corresponding path program 2 times [2021-03-26 00:49:33,239 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:49:33,239 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049087767] [2021-03-26 00:49:33,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:49:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:49:33,318 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:33,318 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:49:33,325 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.1 percent of original size [2021-03-26 00:49:33,327 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-26 00:49:33,348 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.3 percent of original size [2021-03-26 00:49:33,352 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-26 00:49:33,379 INFO L142 QuantifierPusher]: treesize reduction 11, result has 86.4 percent of original size [2021-03-26 00:49:33,381 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 70 [2021-03-26 00:49:33,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:49:33,411 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049087767] [2021-03-26 00:49:33,411 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:49:33,412 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:49:33,412 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061435469] [2021-03-26 00:49:33,412 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:49:33,412 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:49:33,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:49:33,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:49:33,413 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 172 [2021-03-26 00:49:33,414 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 183 flow. Second operand has 6 states, 6 states have (on average 129.83333333333334) internal successors, (779), 6 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:33,414 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:49:33,414 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 172 [2021-03-26 00:49:33,414 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:49:33,502 INFO L129 PetriNetUnfolder]: 42/150 cut-off events. [2021-03-26 00:49:33,502 INFO L130 PetriNetUnfolder]: For 429/441 co-relation queries the response was YES. [2021-03-26 00:49:33,502 INFO L84 FinitePrefix]: Finished finitePrefix Result has 529 conditions, 150 events. 42/150 cut-off events. For 429/441 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 741 event pairs, 2 based on Foata normal form. 7/153 useless extension candidates. Maximal degree in co-relation 510. Up to 74 conditions per place. [2021-03-26 00:49:33,503 INFO L132 encePairwiseOnDemand]: 165/172 looper letters, 16 selfloop transitions, 9 changer transitions 0/41 dead transitions. [2021-03-26 00:49:33,503 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 41 transitions, 277 flow [2021-03-26 00:49:33,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:49:33,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:49:33,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 662 transitions. [2021-03-26 00:49:33,506 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7697674418604651 [2021-03-26 00:49:33,506 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 662 transitions. [2021-03-26 00:49:33,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 662 transitions. [2021-03-26 00:49:33,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:49:33,507 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 662 transitions. [2021-03-26 00:49:33,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.4) internal successors, (662), 5 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:33,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:33,510 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:33,510 INFO L185 Difference]: Start difference. First operand has 46 places, 33 transitions, 183 flow. Second operand 5 states and 662 transitions. [2021-03-26 00:49:33,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 41 transitions, 277 flow [2021-03-26 00:49:33,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 41 transitions, 266 flow, removed 3 selfloop flow, removed 2 redundant places. [2021-03-26 00:49:33,512 INFO L241 Difference]: Finished difference. Result has 50 places, 38 transitions, 235 flow [2021-03-26 00:49:33,512 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=235, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2021-03-26 00:49:33,513 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, 4 predicate places. [2021-03-26 00:49:33,513 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:49:33,513 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 38 transitions, 235 flow [2021-03-26 00:49:33,513 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 38 transitions, 235 flow [2021-03-26 00:49:33,513 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 38 transitions, 235 flow [2021-03-26 00:49:33,531 INFO L129 PetriNetUnfolder]: 42/136 cut-off events. [2021-03-26 00:49:33,531 INFO L130 PetriNetUnfolder]: For 339/354 co-relation queries the response was YES. [2021-03-26 00:49:33,531 INFO L84 FinitePrefix]: Finished finitePrefix Result has 481 conditions, 136 events. 42/136 cut-off events. For 339/354 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 628 event pairs, 7 based on Foata normal form. 4/132 useless extension candidates. Maximal degree in co-relation 462. Up to 61 conditions per place. [2021-03-26 00:49:33,533 INFO L142 LiptonReduction]: Number of co-enabled transitions 378 [2021-03-26 00:49:33,539 INFO L154 LiptonReduction]: Checked pairs total: 285 [2021-03-26 00:49:33,539 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:49:33,539 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 26 [2021-03-26 00:49:33,540 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 235 flow [2021-03-26 00:49:33,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 129.83333333333334) internal successors, (779), 6 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:33,540 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:49:33,540 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:49:33,540 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 00:49:33,540 INFO L428 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:49:33,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:49:33,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1475590649, now seen corresponding path program 3 times [2021-03-26 00:49:33,542 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:49:33,542 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500437919] [2021-03-26 00:49:33,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:49:33,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:49:33,618 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.7 percent of original size [2021-03-26 00:49:33,621 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-26 00:49:33,651 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.8 percent of original size [2021-03-26 00:49:33,653 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-26 00:49:33,691 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.3 percent of original size [2021-03-26 00:49:33,693 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-26 00:49:33,720 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.6 percent of original size [2021-03-26 00:49:33,722 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-26 00:49:33,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:49:33,755 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500437919] [2021-03-26 00:49:33,755 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:49:33,755 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:49:33,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801697579] [2021-03-26 00:49:33,755 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:49:33,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:49:33,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:49:33,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:49:33,756 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 172 [2021-03-26 00:49:33,757 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 235 flow. Second operand has 6 states, 6 states have (on average 124.83333333333333) internal successors, (749), 6 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:33,757 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:49:33,757 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 172 [2021-03-26 00:49:33,757 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:49:33,843 INFO L129 PetriNetUnfolder]: 46/148 cut-off events. [2021-03-26 00:49:33,844 INFO L130 PetriNetUnfolder]: For 586/619 co-relation queries the response was YES. [2021-03-26 00:49:33,844 INFO L84 FinitePrefix]: Finished finitePrefix Result has 614 conditions, 148 events. 46/148 cut-off events. For 586/619 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 696 event pairs, 2 based on Foata normal form. 17/158 useless extension candidates. Maximal degree in co-relation 593. Up to 80 conditions per place. [2021-03-26 00:49:33,845 INFO L132 encePairwiseOnDemand]: 165/172 looper letters, 17 selfloop transitions, 13 changer transitions 0/46 dead transitions. [2021-03-26 00:49:33,845 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 46 transitions, 362 flow [2021-03-26 00:49:33,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:49:33,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:49:33,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 636 transitions. [2021-03-26 00:49:33,848 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7395348837209302 [2021-03-26 00:49:33,848 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 636 transitions. [2021-03-26 00:49:33,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 636 transitions. [2021-03-26 00:49:33,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:49:33,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 636 transitions. [2021-03-26 00:49:33,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.2) internal successors, (636), 5 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:33,851 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:33,851 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:33,851 INFO L185 Difference]: Start difference. First operand has 50 places, 38 transitions, 235 flow. Second operand 5 states and 636 transitions. [2021-03-26 00:49:33,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 46 transitions, 362 flow [2021-03-26 00:49:33,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 46 transitions, 344 flow, removed 5 selfloop flow, removed 1 redundant places. [2021-03-26 00:49:33,856 INFO L241 Difference]: Finished difference. Result has 54 places, 45 transitions, 321 flow [2021-03-26 00:49:33,856 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=321, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2021-03-26 00:49:33,856 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, 8 predicate places. [2021-03-26 00:49:33,857 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:49:33,857 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 45 transitions, 321 flow [2021-03-26 00:49:33,857 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 45 transitions, 321 flow [2021-03-26 00:49:33,857 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 45 transitions, 321 flow [2021-03-26 00:49:33,881 INFO L129 PetriNetUnfolder]: 46/147 cut-off events. [2021-03-26 00:49:33,881 INFO L130 PetriNetUnfolder]: For 548/572 co-relation queries the response was YES. [2021-03-26 00:49:33,882 INFO L84 FinitePrefix]: Finished finitePrefix Result has 569 conditions, 147 events. 46/147 cut-off events. For 548/572 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 699 event pairs, 2 based on Foata normal form. 6/147 useless extension candidates. Maximal degree in co-relation 548. Up to 64 conditions per place. [2021-03-26 00:49:33,883 INFO L142 LiptonReduction]: Number of co-enabled transitions 436 [2021-03-26 00:49:33,892 INFO L154 LiptonReduction]: Checked pairs total: 430 [2021-03-26 00:49:33,892 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:49:33,892 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 35 [2021-03-26 00:49:33,893 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 321 flow [2021-03-26 00:49:33,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 124.83333333333333) internal successors, (749), 6 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:33,893 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:49:33,893 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:49:33,894 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 00:49:33,894 INFO L428 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:49:33,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:49:33,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1676146253, now seen corresponding path program 4 times [2021-03-26 00:49:33,894 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:49:33,894 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907911127] [2021-03-26 00:49:33,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:49:33,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:49:33,962 INFO L142 QuantifierPusher]: treesize reduction 30, result has 25.0 percent of original size [2021-03-26 00:49:33,963 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:49:33,972 INFO L142 QuantifierPusher]: treesize reduction 31, result has 55.7 percent of original size [2021-03-26 00:49:33,973 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-26 00:49:34,003 INFO L142 QuantifierPusher]: treesize reduction 31, result has 57.5 percent of original size [2021-03-26 00:49:34,003 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-26 00:49:34,037 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.3 percent of original size [2021-03-26 00:49:34,039 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-26 00:49:34,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:49:34,073 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907911127] [2021-03-26 00:49:34,073 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:49:34,073 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:49:34,073 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332053505] [2021-03-26 00:49:34,074 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:49:34,074 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:49:34,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:49:34,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:49:34,075 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 172 [2021-03-26 00:49:34,075 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 321 flow. Second operand has 6 states, 6 states have (on average 125.83333333333333) internal successors, (755), 6 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:34,075 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:49:34,075 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 172 [2021-03-26 00:49:34,075 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:49:34,215 INFO L129 PetriNetUnfolder]: 45/156 cut-off events. [2021-03-26 00:49:34,215 INFO L130 PetriNetUnfolder]: For 872/917 co-relation queries the response was YES. [2021-03-26 00:49:34,216 INFO L84 FinitePrefix]: Finished finitePrefix Result has 670 conditions, 156 events. 45/156 cut-off events. For 872/917 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 777 event pairs, 1 based on Foata normal form. 24/174 useless extension candidates. Maximal degree in co-relation 647. Up to 64 conditions per place. [2021-03-26 00:49:34,217 INFO L132 encePairwiseOnDemand]: 166/172 looper letters, 15 selfloop transitions, 19 changer transitions 0/50 dead transitions. [2021-03-26 00:49:34,217 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 50 transitions, 441 flow [2021-03-26 00:49:34,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:49:34,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:49:34,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 766 transitions. [2021-03-26 00:49:34,220 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7422480620155039 [2021-03-26 00:49:34,220 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 766 transitions. [2021-03-26 00:49:34,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 766 transitions. [2021-03-26 00:49:34,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:49:34,220 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 766 transitions. [2021-03-26 00:49:34,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 127.66666666666667) internal successors, (766), 6 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:34,226 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 172.0) internal successors, (1204), 7 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:34,226 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 172.0) internal successors, (1204), 7 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:34,226 INFO L185 Difference]: Start difference. First operand has 54 places, 45 transitions, 321 flow. Second operand 6 states and 766 transitions. [2021-03-26 00:49:34,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 50 transitions, 441 flow [2021-03-26 00:49:34,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 50 transitions, 415 flow, removed 13 selfloop flow, removed 0 redundant places. [2021-03-26 00:49:34,230 INFO L241 Difference]: Finished difference. Result has 60 places, 47 transitions, 377 flow [2021-03-26 00:49:34,231 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=377, PETRI_PLACES=60, PETRI_TRANSITIONS=47} [2021-03-26 00:49:34,231 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, 14 predicate places. [2021-03-26 00:49:34,231 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:49:34,232 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 47 transitions, 377 flow [2021-03-26 00:49:34,232 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 47 transitions, 377 flow [2021-03-26 00:49:34,232 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 60 places, 47 transitions, 377 flow [2021-03-26 00:49:34,251 INFO L129 PetriNetUnfolder]: 44/155 cut-off events. [2021-03-26 00:49:34,251 INFO L130 PetriNetUnfolder]: For 678/689 co-relation queries the response was YES. [2021-03-26 00:49:34,252 INFO L84 FinitePrefix]: Finished finitePrefix Result has 650 conditions, 155 events. 44/155 cut-off events. For 678/689 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 772 event pairs, 2 based on Foata normal form. 7/155 useless extension candidates. Maximal degree in co-relation 626. Up to 52 conditions per place. [2021-03-26 00:49:34,254 INFO L142 LiptonReduction]: Number of co-enabled transitions 456 [2021-03-26 00:49:34,314 INFO L154 LiptonReduction]: Checked pairs total: 495 [2021-03-26 00:49:34,315 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:49:34,315 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 84 [2021-03-26 00:49:34,317 INFO L480 AbstractCegarLoop]: Abstraction has has 60 places, 47 transitions, 377 flow [2021-03-26 00:49:34,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 125.83333333333333) internal successors, (755), 6 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:34,318 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:49:34,318 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:49:34,318 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 00:49:34,318 INFO L428 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:49:34,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:49:34,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1280999195, now seen corresponding path program 1 times [2021-03-26 00:49:34,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:49:34,318 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109581215] [2021-03-26 00:49:34,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:49:34,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:49:34,392 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:34,393 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:49:34,395 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:34,396 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:49:34,400 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:34,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:49:34,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:49:34,401 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109581215] [2021-03-26 00:49:34,401 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:49:34,401 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:49:34,401 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827495368] [2021-03-26 00:49:34,401 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:49:34,401 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:49:34,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:49:34,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:49:34,402 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 172 [2021-03-26 00:49:34,403 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 47 transitions, 377 flow. Second operand has 4 states, 4 states have (on average 139.75) internal successors, (559), 4 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:34,403 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:49:34,403 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 172 [2021-03-26 00:49:34,403 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:49:34,487 INFO L129 PetriNetUnfolder]: 203/434 cut-off events. [2021-03-26 00:49:34,487 INFO L130 PetriNetUnfolder]: For 1663/1814 co-relation queries the response was YES. [2021-03-26 00:49:34,489 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1565 conditions, 434 events. 203/434 cut-off events. For 1663/1814 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 2678 event pairs, 68 based on Foata normal form. 79/437 useless extension candidates. Maximal degree in co-relation 1539. Up to 257 conditions per place. [2021-03-26 00:49:34,491 INFO L132 encePairwiseOnDemand]: 166/172 looper letters, 14 selfloop transitions, 8 changer transitions 2/58 dead transitions. [2021-03-26 00:49:34,491 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 58 transitions, 443 flow [2021-03-26 00:49:34,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:49:34,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:49:34,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 715 transitions. [2021-03-26 00:49:34,494 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8313953488372093 [2021-03-26 00:49:34,494 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 715 transitions. [2021-03-26 00:49:34,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 715 transitions. [2021-03-26 00:49:34,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:49:34,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 715 transitions. [2021-03-26 00:49:34,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.0) internal successors, (715), 5 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:34,498 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:34,498 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:34,498 INFO L185 Difference]: Start difference. First operand has 60 places, 47 transitions, 377 flow. Second operand 5 states and 715 transitions. [2021-03-26 00:49:34,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 58 transitions, 443 flow [2021-03-26 00:49:34,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 58 transitions, 411 flow, removed 7 selfloop flow, removed 4 redundant places. [2021-03-26 00:49:34,504 INFO L241 Difference]: Finished difference. Result has 63 places, 52 transitions, 405 flow [2021-03-26 00:49:34,504 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=405, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2021-03-26 00:49:34,504 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, 17 predicate places. [2021-03-26 00:49:34,504 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:49:34,504 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 52 transitions, 405 flow [2021-03-26 00:49:34,504 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 52 transitions, 405 flow [2021-03-26 00:49:34,505 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 63 places, 52 transitions, 405 flow [2021-03-26 00:49:34,545 INFO L129 PetriNetUnfolder]: 158/361 cut-off events. [2021-03-26 00:49:34,546 INFO L130 PetriNetUnfolder]: For 1414/1492 co-relation queries the response was YES. [2021-03-26 00:49:34,547 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1522 conditions, 361 events. 158/361 cut-off events. For 1414/1492 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 2201 event pairs, 31 based on Foata normal form. 18/347 useless extension candidates. Maximal degree in co-relation 1495. Up to 193 conditions per place. [2021-03-26 00:49:34,551 INFO L142 LiptonReduction]: Number of co-enabled transitions 498 [2021-03-26 00:49:34,559 INFO L154 LiptonReduction]: Checked pairs total: 202 [2021-03-26 00:49:34,559 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:49:34,559 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 55 [2021-03-26 00:49:34,561 INFO L480 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 405 flow [2021-03-26 00:49:34,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 139.75) internal successors, (559), 4 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:34,561 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:49:34,561 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:49:34,561 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 00:49:34,561 INFO L428 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:49:34,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:49:34,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1219389063, now seen corresponding path program 1 times [2021-03-26 00:49:34,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:49:34,562 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730546940] [2021-03-26 00:49:34,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:49:34,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:49:34,606 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:34,607 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:49:34,609 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:34,610 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:49:34,613 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:34,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:49:34,617 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:34,617 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:49:34,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:49:34,618 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730546940] [2021-03-26 00:49:34,618 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:49:34,618 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:49:34,618 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068394412] [2021-03-26 00:49:34,619 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:49:34,619 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:49:34,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:49:34,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:49:34,621 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 172 [2021-03-26 00:49:34,621 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 405 flow. Second operand has 5 states, 5 states have (on average 139.8) internal successors, (699), 5 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:34,621 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:49:34,621 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 172 [2021-03-26 00:49:34,621 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:49:34,700 INFO L129 PetriNetUnfolder]: 124/311 cut-off events. [2021-03-26 00:49:34,701 INFO L130 PetriNetUnfolder]: For 1769/2305 co-relation queries the response was YES. [2021-03-26 00:49:34,702 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1309 conditions, 311 events. 124/311 cut-off events. For 1769/2305 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 1788 event pairs, 7 based on Foata normal form. 155/429 useless extension candidates. Maximal degree in co-relation 1280. Up to 185 conditions per place. [2021-03-26 00:49:34,703 INFO L132 encePairwiseOnDemand]: 166/172 looper letters, 9 selfloop transitions, 15 changer transitions 3/55 dead transitions. [2021-03-26 00:49:34,703 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 55 transitions, 439 flow [2021-03-26 00:49:34,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:49:34,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:49:34,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1001 transitions. [2021-03-26 00:49:34,706 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8313953488372093 [2021-03-26 00:49:34,706 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1001 transitions. [2021-03-26 00:49:34,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1001 transitions. [2021-03-26 00:49:34,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:49:34,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1001 transitions. [2021-03-26 00:49:34,708 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 143.0) internal successors, (1001), 7 states have internal predecessors, (1001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:34,710 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 172.0) internal successors, (1376), 8 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:34,710 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 172.0) internal successors, (1376), 8 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:34,710 INFO L185 Difference]: Start difference. First operand has 63 places, 52 transitions, 405 flow. Second operand 7 states and 1001 transitions. [2021-03-26 00:49:34,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 55 transitions, 439 flow [2021-03-26 00:49:34,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 55 transitions, 416 flow, removed 1 selfloop flow, removed 6 redundant places. [2021-03-26 00:49:34,715 INFO L241 Difference]: Finished difference. Result has 66 places, 50 transitions, 403 flow [2021-03-26 00:49:34,715 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=403, PETRI_PLACES=66, PETRI_TRANSITIONS=50} [2021-03-26 00:49:34,715 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, 20 predicate places. [2021-03-26 00:49:34,715 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:49:34,716 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 50 transitions, 403 flow [2021-03-26 00:49:34,716 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 50 transitions, 403 flow [2021-03-26 00:49:34,716 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 66 places, 50 transitions, 403 flow [2021-03-26 00:49:34,741 INFO L129 PetriNetUnfolder]: 74/232 cut-off events. [2021-03-26 00:49:34,741 INFO L130 PetriNetUnfolder]: For 1320/1475 co-relation queries the response was YES. [2021-03-26 00:49:34,743 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1126 conditions, 232 events. 74/232 cut-off events. For 1320/1475 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 1386 event pairs, 4 based on Foata normal form. 18/233 useless extension candidates. Maximal degree in co-relation 1097. Up to 131 conditions per place. [2021-03-26 00:49:34,745 INFO L142 LiptonReduction]: Number of co-enabled transitions 530 [2021-03-26 00:49:34,966 WARN L205 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-26 00:49:35,350 WARN L205 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 83 [2021-03-26 00:49:35,475 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-03-26 00:49:35,485 INFO L154 LiptonReduction]: Checked pairs total: 515 [2021-03-26 00:49:35,485 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:49:35,485 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 770 [2021-03-26 00:49:35,486 INFO L480 AbstractCegarLoop]: Abstraction has has 66 places, 50 transitions, 408 flow [2021-03-26 00:49:35,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 139.8) internal successors, (699), 5 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:35,487 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:49:35,487 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:49:35,487 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 00:49:35,487 INFO L428 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:49:35,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:49:35,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1217348294, now seen corresponding path program 1 times [2021-03-26 00:49:35,487 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:49:35,487 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21401002] [2021-03-26 00:49:35,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:49:35,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:49:35,525 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:35,526 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:49:35,529 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:35,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:49:35,533 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:35,534 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:49:35,539 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:35,539 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:49:35,544 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:35,544 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:49:35,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:49:35,545 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21401002] [2021-03-26 00:49:35,545 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:49:35,545 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:49:35,545 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166894645] [2021-03-26 00:49:35,545 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:49:35,545 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:49:35,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:49:35,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:49:35,546 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 173 [2021-03-26 00:49:35,547 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 50 transitions, 408 flow. Second operand has 6 states, 6 states have (on average 140.83333333333334) internal successors, (845), 6 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:35,547 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:49:35,547 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 173 [2021-03-26 00:49:35,547 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:49:35,645 INFO L129 PetriNetUnfolder]: 95/252 cut-off events. [2021-03-26 00:49:35,646 INFO L130 PetriNetUnfolder]: For 2144/3065 co-relation queries the response was YES. [2021-03-26 00:49:35,647 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1216 conditions, 252 events. 95/252 cut-off events. For 2144/3065 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 1468 event pairs, 0 based on Foata normal form. 150/371 useless extension candidates. Maximal degree in co-relation 1185. Up to 166 conditions per place. [2021-03-26 00:49:35,648 INFO L132 encePairwiseOnDemand]: 167/173 looper letters, 5 selfloop transitions, 19 changer transitions 4/55 dead transitions. [2021-03-26 00:49:35,649 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 55 transitions, 475 flow [2021-03-26 00:49:35,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-26 00:49:35,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-26 00:49:35,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1290 transitions. [2021-03-26 00:49:35,652 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8285163776493256 [2021-03-26 00:49:35,652 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1290 transitions. [2021-03-26 00:49:35,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1290 transitions. [2021-03-26 00:49:35,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:49:35,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1290 transitions. [2021-03-26 00:49:35,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 143.33333333333334) internal successors, (1290), 9 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:35,658 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 173.0) internal successors, (1730), 10 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:35,658 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 173.0) internal successors, (1730), 10 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:35,658 INFO L185 Difference]: Start difference. First operand has 66 places, 50 transitions, 408 flow. Second operand 9 states and 1290 transitions. [2021-03-26 00:49:35,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 55 transitions, 475 flow [2021-03-26 00:49:35,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 55 transitions, 411 flow, removed 24 selfloop flow, removed 4 redundant places. [2021-03-26 00:49:35,665 INFO L241 Difference]: Finished difference. Result has 73 places, 49 transitions, 380 flow [2021-03-26 00:49:35,665 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=380, PETRI_PLACES=73, PETRI_TRANSITIONS=49} [2021-03-26 00:49:35,665 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, 27 predicate places. [2021-03-26 00:49:35,665 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:49:35,665 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 49 transitions, 380 flow [2021-03-26 00:49:35,666 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 49 transitions, 380 flow [2021-03-26 00:49:35,666 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 72 places, 49 transitions, 380 flow [2021-03-26 00:49:35,683 INFO L129 PetriNetUnfolder]: 49/178 cut-off events. [2021-03-26 00:49:35,683 INFO L130 PetriNetUnfolder]: For 731/789 co-relation queries the response was YES. [2021-03-26 00:49:35,684 INFO L84 FinitePrefix]: Finished finitePrefix Result has 756 conditions, 178 events. 49/178 cut-off events. For 731/789 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 1077 event pairs, 0 based on Foata normal form. 12/178 useless extension candidates. Maximal degree in co-relation 725. Up to 60 conditions per place. [2021-03-26 00:49:35,685 INFO L142 LiptonReduction]: Number of co-enabled transitions 510 [2021-03-26 00:49:35,997 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 00:49:36,157 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 00:49:36,797 WARN L205 SmtUtils]: Spent 633.00 ms on a formula simplification. DAG size of input: 246 DAG size of output: 192 [2021-03-26 00:49:37,065 WARN L205 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-26 00:49:39,147 WARN L205 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 346 DAG size of output: 272 [2021-03-26 00:49:39,778 WARN L205 SmtUtils]: Spent 627.00 ms on a formula simplification that was a NOOP. DAG size: 252 [2021-03-26 00:49:39,785 INFO L154 LiptonReduction]: Checked pairs total: 652 [2021-03-26 00:49:39,785 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-26 00:49:39,785 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4120 [2021-03-26 00:49:39,785 INFO L480 AbstractCegarLoop]: Abstraction has has 70 places, 44 transitions, 350 flow [2021-03-26 00:49:39,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 140.83333333333334) internal successors, (845), 6 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:39,786 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:49:39,786 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:49:39,786 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 00:49:39,786 INFO L428 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:49:39,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:49:39,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1189931083, now seen corresponding path program 1 times [2021-03-26 00:49:39,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:49:39,787 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472220634] [2021-03-26 00:49:39,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:49:39,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:49:39,841 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:39,841 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:49:39,842 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:39,843 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:49:39,846 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:49:39,847 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:49:39,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:49:39,850 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472220634] [2021-03-26 00:49:39,850 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:49:39,850 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:49:39,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412256775] [2021-03-26 00:49:39,851 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:49:39,851 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:49:39,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:49:39,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:49:39,852 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 175 [2021-03-26 00:49:39,852 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 44 transitions, 350 flow. Second operand has 4 states, 4 states have (on average 149.0) internal successors, (596), 4 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:39,852 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:49:39,852 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 175 [2021-03-26 00:49:39,852 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:49:39,889 INFO L129 PetriNetUnfolder]: 47/153 cut-off events. [2021-03-26 00:49:39,889 INFO L130 PetriNetUnfolder]: For 1426/1462 co-relation queries the response was YES. [2021-03-26 00:49:39,890 INFO L84 FinitePrefix]: Finished finitePrefix Result has 654 conditions, 153 events. 47/153 cut-off events. For 1426/1462 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 777 event pairs, 0 based on Foata normal form. 18/162 useless extension candidates. Maximal degree in co-relation 621. Up to 59 conditions per place. [2021-03-26 00:49:39,891 INFO L132 encePairwiseOnDemand]: 172/175 looper letters, 3 selfloop transitions, 1 changer transitions 10/39 dead transitions. [2021-03-26 00:49:39,891 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 39 transitions, 305 flow [2021-03-26 00:49:39,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:49:39,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:49:39,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 598 transitions. [2021-03-26 00:49:39,893 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8542857142857143 [2021-03-26 00:49:39,893 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 598 transitions. [2021-03-26 00:49:39,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 598 transitions. [2021-03-26 00:49:39,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:49:39,893 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 598 transitions. [2021-03-26 00:49:39,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 149.5) internal successors, (598), 4 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:39,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:39,896 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:39,896 INFO L185 Difference]: Start difference. First operand has 70 places, 44 transitions, 350 flow. Second operand 4 states and 598 transitions. [2021-03-26 00:49:39,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 39 transitions, 305 flow [2021-03-26 00:49:39,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 39 transitions, 257 flow, removed 15 selfloop flow, removed 10 redundant places. [2021-03-26 00:49:39,899 INFO L241 Difference]: Finished difference. Result has 58 places, 29 transitions, 188 flow [2021-03-26 00:49:39,899 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=188, PETRI_PLACES=58, PETRI_TRANSITIONS=29} [2021-03-26 00:49:39,899 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, 12 predicate places. [2021-03-26 00:49:39,899 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:49:39,900 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 29 transitions, 188 flow [2021-03-26 00:49:39,900 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 29 transitions, 188 flow [2021-03-26 00:49:39,900 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 29 transitions, 188 flow [2021-03-26 00:49:39,906 INFO L129 PetriNetUnfolder]: 12/52 cut-off events. [2021-03-26 00:49:39,906 INFO L130 PetriNetUnfolder]: For 157/165 co-relation queries the response was YES. [2021-03-26 00:49:39,906 INFO L84 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 52 events. 12/52 cut-off events. For 157/165 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 132 event pairs, 0 based on Foata normal form. 4/55 useless extension candidates. Maximal degree in co-relation 172. Up to 14 conditions per place. [2021-03-26 00:49:39,907 INFO L142 LiptonReduction]: Number of co-enabled transitions 132 [2021-03-26 00:49:40,128 INFO L154 LiptonReduction]: Checked pairs total: 62 [2021-03-26 00:49:40,129 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-26 00:49:40,129 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 230 [2021-03-26 00:49:40,130 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 26 transitions, 185 flow [2021-03-26 00:49:40,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 149.0) internal successors, (596), 4 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:49:40,130 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:49:40,130 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:49:40,130 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-26 00:49:40,130 INFO L428 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:49:40,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:49:40,130 INFO L82 PathProgramCache]: Analyzing trace with hash -906196656, now seen corresponding path program 1 times [2021-03-26 00:49:40,131 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:49:40,131 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799147410] [2021-03-26 00:49:40,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:49:40,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:49:40,153 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:49:40,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:49:40,173 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:49:40,211 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 00:49:40,211 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 00:49:40,211 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-26 00:49:40,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 12:49:40 BasicIcfg [2021-03-26 00:49:40,304 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 00:49:40,305 INFO L168 Benchmark]: Toolchain (without parser) took 23910.39 ms. Allocated memory was 255.9 MB in the beginning and 648.0 MB in the end (delta: 392.2 MB). Free memory was 234.3 MB in the beginning and 280.3 MB in the end (delta: -45.9 MB). Peak memory consumption was 345.0 MB. Max. memory is 16.0 GB. [2021-03-26 00:49:40,305 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 255.9 MB. Free memory was 237.8 MB in the beginning and 237.7 MB in the end (delta: 168.3 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:49:40,306 INFO L168 Benchmark]: CACSL2BoogieTranslator took 496.31 ms. Allocated memory was 255.9 MB in the beginning and 362.8 MB in the end (delta: 107.0 MB). Free memory was 233.8 MB in the beginning and 322.9 MB in the end (delta: -89.1 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. [2021-03-26 00:49:40,306 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.73 ms. Allocated memory is still 362.8 MB. Free memory was 322.9 MB in the beginning and 320.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-26 00:49:40,306 INFO L168 Benchmark]: Boogie Preprocessor took 28.90 ms. Allocated memory is still 362.8 MB. Free memory was 320.0 MB in the beginning and 317.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:49:40,306 INFO L168 Benchmark]: RCFGBuilder took 1839.09 ms. Allocated memory is still 362.8 MB. Free memory was 317.9 MB in the beginning and 320.6 MB in the end (delta: -2.7 MB). Peak memory consumption was 63.4 MB. Max. memory is 16.0 GB. [2021-03-26 00:49:40,306 INFO L168 Benchmark]: TraceAbstraction took 21490.51 ms. Allocated memory was 362.8 MB in the beginning and 648.0 MB in the end (delta: 285.2 MB). Free memory was 319.6 MB in the beginning and 280.3 MB in the end (delta: 39.3 MB). Peak memory consumption was 324.6 MB. Max. memory is 16.0 GB. [2021-03-26 00:49:40,307 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.47 ms. Allocated memory is still 255.9 MB. Free memory was 237.8 MB in the beginning and 237.7 MB in the end (delta: 168.3 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 496.31 ms. Allocated memory was 255.9 MB in the beginning and 362.8 MB in the end (delta: 107.0 MB). Free memory was 233.8 MB in the beginning and 322.9 MB in the end (delta: -89.1 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 50.73 ms. Allocated memory is still 362.8 MB. Free memory was 322.9 MB in the beginning and 320.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 28.90 ms. Allocated memory is still 362.8 MB. Free memory was 320.0 MB in the beginning and 317.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1839.09 ms. Allocated memory is still 362.8 MB. Free memory was 317.9 MB in the beginning and 320.6 MB in the end (delta: -2.7 MB). Peak memory consumption was 63.4 MB. Max. memory is 16.0 GB. * TraceAbstraction took 21490.51 ms. Allocated memory was 362.8 MB in the beginning and 648.0 MB in the end (delta: 285.2 MB). Free memory was 319.6 MB in the beginning and 280.3 MB in the end (delta: 39.3 MB). Peak memory consumption was 324.6 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8160.6ms, 101 PlacesBefore, 46 PlacesAfterwards, 93 TransitionsBefore, 37 TransitionsAfterwards, 1578 CoEnabledTransitionPairs, 5 FixpointIterations, 26 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 66 TotalNumberOfCompositions, 2611 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1403, positive: 1332, positive conditional: 1332, positive unconditional: 0, negative: 71, negative conditional: 71, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1101, positive: 1062, positive conditional: 0, positive unconditional: 1062, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1101, positive: 1062, positive conditional: 0, positive unconditional: 1062, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1101, positive: 1059, positive conditional: 0, positive unconditional: 1059, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 42, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 772, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 763, negative conditional: 0, negative unconditional: 763, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1403, positive: 270, positive conditional: 270, positive unconditional: 0, negative: 32, negative conditional: 32, negative unconditional: 0, unknown: 1101, unknown conditional: 1101, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 71, Positive cache size: 48, Positive conditional cache size: 48, Positive unconditional cache size: 0, Negative cache size: 23, Negative conditional cache size: 23, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3039.0ms, 43 PlacesBefore, 31 PlacesAfterwards, 31 TransitionsBefore, 22 TransitionsAfterwards, 230 CoEnabledTransitionPairs, 4 FixpointIterations, 8 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, 1024 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 317, positive: 238, positive conditional: 238, positive unconditional: 0, negative: 79, negative conditional: 79, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 51, positive: 40, positive conditional: 5, positive unconditional: 35, negative: 11, negative conditional: 1, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 51, positive: 40, positive conditional: 5, positive unconditional: 35, negative: 11, negative conditional: 1, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 51, positive: 38, positive conditional: 0, positive unconditional: 38, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 11, negative conditional: 1, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 231, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 224, negative conditional: 17, negative unconditional: 207, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 317, positive: 198, positive conditional: 198, positive unconditional: 0, negative: 68, negative conditional: 68, negative unconditional: 0, unknown: 51, unknown conditional: 51, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 98, Positive cache size: 74, Positive conditional cache size: 74, Positive unconditional cache size: 0, Negative cache size: 24, Negative conditional cache size: 24, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 895.4ms, 32 PlacesBefore, 31 PlacesAfterwards, 24 TransitionsBefore, 23 TransitionsAfterwards, 230 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 460 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 106, positive: 72, positive conditional: 72, positive unconditional: 0, negative: 34, negative conditional: 34, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 49, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 106, positive: 68, positive conditional: 68, positive unconditional: 0, negative: 32, negative conditional: 32, negative unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 78, Positive conditional cache size: 78, Positive unconditional cache size: 0, Negative cache size: 26, Negative conditional cache size: 26, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 121.5ms, 35 PlacesBefore, 35 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 292 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 135 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 28, positive: 20, positive conditional: 20, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, positive: 8, positive conditional: 4, positive unconditional: 4, negative: 3, negative conditional: 1, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, positive: 8, positive conditional: 4, positive unconditional: 4, negative: 3, negative conditional: 1, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 1, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 106, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 106, negative conditional: 34, negative unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 28, positive: 12, positive conditional: 12, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 11, unknown conditional: 11, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 115, Positive cache size: 86, Positive conditional cache size: 86, Positive unconditional cache size: 0, Negative cache size: 29, Negative conditional cache size: 29, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 119.8ms, 39 PlacesBefore, 39 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 294 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 185 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 38, positive: 27, positive conditional: 27, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 6, positive conditional: 2, positive unconditional: 4, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 6, positive conditional: 2, positive unconditional: 4, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 104, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 104, negative conditional: 0, negative unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 38, positive: 21, positive conditional: 21, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 124, Positive cache size: 92, Positive conditional cache size: 92, Positive unconditional cache size: 0, Negative cache size: 32, Negative conditional cache size: 32, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 82.9ms, 41 PlacesBefore, 41 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 294 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 196 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 52, positive: 40, positive conditional: 40, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, positive: 12, positive conditional: 5, positive unconditional: 7, negative: 3, negative conditional: 2, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, positive: 12, positive conditional: 5, positive unconditional: 7, negative: 3, negative conditional: 2, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 2, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 67, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 67, negative conditional: 40, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 52, positive: 28, positive conditional: 28, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 139, Positive cache size: 104, Positive conditional cache size: 104, Positive unconditional cache size: 0, Negative cache size: 35, Negative conditional cache size: 35, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 147.0ms, 42 PlacesBefore, 42 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 294 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 242 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 43, positive: 29, positive conditional: 29, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, positive: 6, positive conditional: 2, positive unconditional: 4, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 6, positive conditional: 2, positive unconditional: 4, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 127, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 127, negative conditional: 0, negative unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 43, positive: 23, positive conditional: 23, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 149, Positive cache size: 110, Positive conditional cache size: 110, Positive unconditional cache size: 0, Negative cache size: 39, Negative conditional cache size: 39, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 28.8ms, 46 PlacesBefore, 46 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 328 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 215 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 75, positive: 64, positive conditional: 64, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, positive: 19, positive conditional: 9, positive unconditional: 10, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, positive: 19, positive conditional: 9, positive unconditional: 10, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 20, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 75, positive: 45, positive conditional: 45, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 20, unknown conditional: 20, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 169, Positive cache size: 129, Positive conditional cache size: 129, Positive unconditional cache size: 0, Negative cache size: 40, Negative conditional cache size: 40, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 26.0ms, 50 PlacesBefore, 50 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 378 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 285 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 97, positive: 84, positive conditional: 84, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, positive: 25, positive conditional: 17, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 25, positive: 25, positive conditional: 17, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 25, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 97, positive: 59, positive conditional: 59, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 25, unknown conditional: 25, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 194, Positive cache size: 154, Positive conditional cache size: 154, Positive unconditional cache size: 0, Negative cache size: 40, Negative conditional cache size: 40, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 35.3ms, 54 PlacesBefore, 54 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 436 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 430 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 128, positive: 108, positive conditional: 108, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30, positive: 30, positive conditional: 24, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 30, positive: 30, positive conditional: 24, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 30, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 128, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 30, unknown conditional: 30, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 224, Positive cache size: 184, Positive conditional cache size: 184, Positive unconditional cache size: 0, Negative cache size: 40, Negative conditional cache size: 40, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 82.7ms, 60 PlacesBefore, 60 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 456 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 495 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 80, positive: 57, positive conditional: 57, positive unconditional: 0, negative: 23, negative conditional: 23, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 52, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 52, negative conditional: 0, negative unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 80, positive: 55, positive conditional: 55, positive unconditional: 0, negative: 21, negative conditional: 21, negative unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 228, Positive cache size: 186, Positive conditional cache size: 186, Positive unconditional cache size: 0, Negative cache size: 42, Negative conditional cache size: 42, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 54.6ms, 63 PlacesBefore, 63 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 498 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 202 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 80, positive: 73, positive conditional: 73, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, positive: 20, positive conditional: 13, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, positive: 20, positive conditional: 13, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 20, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 80, positive: 53, positive conditional: 53, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 20, unknown conditional: 20, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 248, Positive cache size: 206, Positive conditional cache size: 206, Positive unconditional cache size: 0, Negative cache size: 42, Negative conditional cache size: 42, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 769.5ms, 66 PlacesBefore, 66 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 530 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 515 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 210, positive: 193, positive conditional: 193, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 31, positive: 31, positive conditional: 27, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 31, positive: 31, positive conditional: 27, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 31, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 210, positive: 162, positive conditional: 162, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 31, unknown conditional: 31, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 225, Positive cache size: 198, Positive conditional cache size: 198, Positive unconditional cache size: 0, Negative cache size: 27, Negative conditional cache size: 27, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4119.1ms, 73 PlacesBefore, 70 PlacesAfterwards, 49 TransitionsBefore, 44 TransitionsAfterwards, 510 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 652 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 384, positive: 360, positive conditional: 360, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 73, positive: 73, positive conditional: 73, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 73, positive: 73, positive conditional: 73, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 73, positive: 73, positive conditional: 0, positive unconditional: 73, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 384, positive: 287, positive conditional: 287, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 73, unknown conditional: 73, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 175, Positive cache size: 168, Positive conditional cache size: 168, Positive unconditional cache size: 0, Negative cache size: 7, Negative conditional cache size: 7, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 229.0ms, 58 PlacesBefore, 51 PlacesAfterwards, 29 TransitionsBefore, 26 TransitionsAfterwards, 132 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 62 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 51, positive: 48, positive conditional: 48, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 36, positive: 34, positive conditional: 31, positive unconditional: 3, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 36, positive: 34, positive conditional: 31, positive unconditional: 3, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 36, positive: 34, positive conditional: 0, positive unconditional: 34, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 25, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 25, negative conditional: 25, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 51, positive: 14, positive conditional: 14, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 36, unknown conditional: 36, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 19, Positive cache size: 14, Positive conditional cache size: 14, Positive unconditional cache size: 0, Negative cache size: 5, Negative conditional cache size: 5, Negative unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L815] 0 pthread_t t2528; [L816] FCALL, FORK 0 pthread_create(&t2528, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 0 pthread_t t2529; [L818] FCALL, FORK 0 pthread_create(&t2529, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L819] 0 pthread_t t2530; [L820] FCALL, FORK 0 pthread_create(&t2530, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L778] 3 y$w_buff1 = y$w_buff0 [L779] 3 y$w_buff0 = 2 [L780] 3 y$w_buff1_used = y$w_buff0_used [L781] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L783] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L784] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L785] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L786] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L787] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L741] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L758] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L761] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L793] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L794] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L795] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L796] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L796] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L797] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L797] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L764] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L764] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L765] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L765] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L766] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L767] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L767] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L768] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L800] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 3 return 0; [L822] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L826] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L826] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L827] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L828] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L829] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L829] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L830] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L830] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L833] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 0 y$flush_delayed = weak$$choice2 [L836] 0 y$mem_tmp = y [L837] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L837] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L838] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L838] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L838] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L838] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L839] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L839] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L839] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L839] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L840] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L840] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L840] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L840] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L841] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L841] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L842] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L842] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L842] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L843] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L843] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) [L845] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L845] 0 y = y$flush_delayed ? y$mem_tmp : y [L846] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 95 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 5.3ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 21310.7ms, OverallIterations: 15, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1309.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8231.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 55 SDtfs, 31 SDslu, 24 SDs, 0 SdLazy, 324 SolverSat, 82 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 430.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 647.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=408occurred in iteration=12, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 40.6ms SsaConstructionTime, 437.1ms SatisfiabilityAnalysisTime, 1192.7ms InterpolantComputationTime, 213 NumberOfCodeBlocks, 213 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 181 ConstructedInterpolants, 0 QuantifiedInterpolants, 1603 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...