/usr/bin/java -Xmx8000000000 -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-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix030_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-?-0612a5f-m [2022-09-20 20:35:00,086 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-20 20:35:00,088 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-20 20:35:00,130 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-20 20:35:00,130 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-20 20:35:00,133 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-20 20:35:00,135 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-20 20:35:00,138 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-20 20:35:00,139 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-20 20:35:00,143 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-20 20:35:00,144 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-20 20:35:00,145 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-20 20:35:00,146 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-20 20:35:00,147 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-20 20:35:00,149 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-20 20:35:00,151 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-20 20:35:00,152 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-20 20:35:00,153 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-20 20:35:00,154 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-20 20:35:00,159 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-20 20:35:00,161 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-20 20:35:00,162 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-20 20:35:00,163 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-20 20:35:00,164 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-20 20:35:00,171 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-20 20:35:00,171 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-20 20:35:00,171 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-20 20:35:00,173 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-20 20:35:00,173 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-20 20:35:00,174 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-20 20:35:00,174 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-20 20:35:00,175 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-20 20:35:00,176 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-20 20:35:00,177 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-20 20:35:00,178 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-20 20:35:00,178 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-20 20:35:00,178 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-20 20:35:00,179 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-20 20:35:00,179 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-20 20:35:00,179 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-20 20:35:00,180 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-20 20:35:00,181 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-NoLbe.epf [2022-09-20 20:35:00,210 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-20 20:35:00,211 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-20 20:35:00,212 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-20 20:35:00,212 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-20 20:35:00,212 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-20 20:35:00,213 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-20 20:35:00,213 INFO L138 SettingsManager]: * Use SBE=true [2022-09-20 20:35:00,213 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-20 20:35:00,213 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-20 20:35:00,213 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-20 20:35:00,214 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-20 20:35:00,214 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-20 20:35:00,214 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-20 20:35:00,214 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-20 20:35:00,214 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-20 20:35:00,214 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-20 20:35:00,214 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-20 20:35:00,215 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-20 20:35:00,215 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-20 20:35:00,215 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-20 20:35:00,215 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-20 20:35:00,215 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-20 20:35:00,215 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-20 20:35:00,215 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 20:35:00,215 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-20 20:35:00,216 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-20 20:35:00,217 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-20 20:35:00,217 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-20 20:35:00,217 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-20 20:35:00,217 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-20 20:35:00,217 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-09-20 20:35:00,217 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-09-20 20:35:00,465 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-20 20:35:00,489 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-20 20:35:00,491 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-20 20:35:00,492 INFO L271 PluginConnector]: Initializing CDTParser... [2022-09-20 20:35:00,493 INFO L275 PluginConnector]: CDTParser initialized [2022-09-20 20:35:00,494 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix030_power.opt_pso.opt_rmo.opt.i [2022-09-20 20:35:00,551 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a928383d/2ffb25cad50f46199b4e9f3b8d5ffbc4/FLAG23a419275 [2022-09-20 20:35:01,090 INFO L306 CDTParser]: Found 1 translation units. [2022-09-20 20:35:01,091 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix030_power.opt_pso.opt_rmo.opt.i [2022-09-20 20:35:01,112 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a928383d/2ffb25cad50f46199b4e9f3b8d5ffbc4/FLAG23a419275 [2022-09-20 20:35:01,369 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a928383d/2ffb25cad50f46199b4e9f3b8d5ffbc4 [2022-09-20 20:35:01,371 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-20 20:35:01,372 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-09-20 20:35:01,375 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-09-20 20:35:01,375 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-09-20 20:35:01,377 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-09-20 20:35:01,378 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 08:35:01" (1/1) ... [2022-09-20 20:35:01,379 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61daa954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:35:01, skipping insertion in model container [2022-09-20 20:35:01,379 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 08:35:01" (1/1) ... [2022-09-20 20:35:01,384 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-09-20 20:35:01,419 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-09-20 20:35:01,566 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix030_power.opt_pso.opt_rmo.opt.i[966,979] [2022-09-20 20:35:01,712 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 20:35:01,719 INFO L203 MainTranslator]: Completed pre-run [2022-09-20 20:35:01,729 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix030_power.opt_pso.opt_rmo.opt.i[966,979] [2022-09-20 20:35:01,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 20:35:01,812 INFO L208 MainTranslator]: Completed translation [2022-09-20 20:35:01,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:35:01 WrapperNode [2022-09-20 20:35:01,813 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-09-20 20:35:01,814 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-20 20:35:01,814 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-20 20:35:01,814 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-20 20:35:01,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:35:01" (1/1) ... [2022-09-20 20:35:01,863 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:35:01" (1/1) ... [2022-09-20 20:35:01,898 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 290 [2022-09-20 20:35:01,899 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-20 20:35:01,899 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-20 20:35:01,899 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-20 20:35:01,900 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-20 20:35:01,906 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:35:01" (1/1) ... [2022-09-20 20:35:01,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:35:01" (1/1) ... [2022-09-20 20:35:01,919 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:35:01" (1/1) ... [2022-09-20 20:35:01,920 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:35:01" (1/1) ... [2022-09-20 20:35:01,927 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:35:01" (1/1) ... [2022-09-20 20:35:01,930 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:35:01" (1/1) ... [2022-09-20 20:35:01,949 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:35:01" (1/1) ... [2022-09-20 20:35:01,952 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-20 20:35:01,953 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-20 20:35:01,953 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-20 20:35:01,953 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-20 20:35:01,961 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:35:01" (1/1) ... [2022-09-20 20:35:01,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 20:35:01,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 20:35:01,987 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-09-20 20:35:02,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-09-20 20:35:02,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-09-20 20:35:02,030 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-09-20 20:35:02,030 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-09-20 20:35:02,030 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-09-20 20:35:02,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-09-20 20:35:02,031 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-09-20 20:35:02,031 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-09-20 20:35:02,031 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-09-20 20:35:02,031 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-09-20 20:35:02,031 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-09-20 20:35:02,033 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-09-20 20:35:02,033 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-09-20 20:35:02,033 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-09-20 20:35:02,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-09-20 20:35:02,034 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-09-20 20:35:02,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-20 20:35:02,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-20 20:35:02,036 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-09-20 20:35:02,206 INFO L234 CfgBuilder]: Building ICFG [2022-09-20 20:35:02,207 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-20 20:35:02,745 INFO L275 CfgBuilder]: Performing block encoding [2022-09-20 20:35:03,029 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-20 20:35:03,029 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-09-20 20:35:03,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 08:35:03 BoogieIcfgContainer [2022-09-20 20:35:03,031 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-20 20:35:03,033 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-20 20:35:03,033 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-20 20:35:03,036 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-20 20:35:03,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 08:35:01" (1/3) ... [2022-09-20 20:35:03,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@409cb7e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 08:35:03, skipping insertion in model container [2022-09-20 20:35:03,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:35:01" (2/3) ... [2022-09-20 20:35:03,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@409cb7e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 08:35:03, skipping insertion in model container [2022-09-20 20:35:03,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 08:35:03" (3/3) ... [2022-09-20 20:35:03,071 INFO L112 eAbstractionObserver]: Analyzing ICFG mix030_power.opt_pso.opt_rmo.opt.i [2022-09-20 20:35:03,086 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-20 20:35:03,086 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-09-20 20:35:03,086 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-20 20:35:03,130 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-09-20 20:35:03,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 135 transitions, 290 flow [2022-09-20 20:35:03,201 INFO L130 PetriNetUnfolder]: 2/131 cut-off events. [2022-09-20 20:35:03,202 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-09-20 20:35:03,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 131 events. 2/131 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2022-09-20 20:35:03,205 INFO L82 GeneralOperation]: Start removeDead. Operand has 146 places, 135 transitions, 290 flow [2022-09-20 20:35:03,209 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 142 places, 131 transitions, 274 flow [2022-09-20 20:35:03,217 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-09-20 20:35:03,222 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6dc5daf7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-20 20:35:03,223 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-09-20 20:35:03,238 INFO L130 PetriNetUnfolder]: 0/76 cut-off events. [2022-09-20 20:35:03,239 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-09-20 20:35:03,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:35:03,239 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:35:03,240 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:35:03,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:35:03,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1442612500, now seen corresponding path program 1 times [2022-09-20 20:35:03,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:35:03,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136919002] [2022-09-20 20:35:03,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:35:03,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:35:03,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:35:03,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:35:03,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:35:03,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136919002] [2022-09-20 20:35:03,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136919002] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:35:03,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:35:03,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-20 20:35:03,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216878526] [2022-09-20 20:35:03,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:35:03,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-20 20:35:03,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:35:03,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-20 20:35:03,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-20 20:35:03,576 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 135 [2022-09-20 20:35:03,579 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 131 transitions, 274 flow. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 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) [2022-09-20 20:35:03,579 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:35:03,579 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 135 [2022-09-20 20:35:03,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:35:03,750 INFO L130 PetriNetUnfolder]: 57/349 cut-off events. [2022-09-20 20:35:03,750 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-09-20 20:35:03,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 478 conditions, 349 events. 57/349 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1368 event pairs, 11 based on Foata normal form. 14/344 useless extension candidates. Maximal degree in co-relation 422. Up to 75 conditions per place. [2022-09-20 20:35:03,757 INFO L137 encePairwiseOnDemand]: 130/135 looper letters, 14 selfloop transitions, 2 changer transitions 0/132 dead transitions. [2022-09-20 20:35:03,757 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 132 transitions, 311 flow [2022-09-20 20:35:03,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-20 20:35:03,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-09-20 20:35:03,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 381 transitions. [2022-09-20 20:35:03,774 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9407407407407408 [2022-09-20 20:35:03,775 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 381 transitions. [2022-09-20 20:35:03,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 381 transitions. [2022-09-20 20:35:03,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:35:03,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 381 transitions. [2022-09-20 20:35:03,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 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) [2022-09-20 20:35:03,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 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) [2022-09-20 20:35:03,792 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 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) [2022-09-20 20:35:03,793 INFO L175 Difference]: Start difference. First operand has 142 places, 131 transitions, 274 flow. Second operand 3 states and 381 transitions. [2022-09-20 20:35:03,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 132 transitions, 311 flow [2022-09-20 20:35:03,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 132 transitions, 306 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-09-20 20:35:03,799 INFO L231 Difference]: Finished difference. Result has 138 places, 127 transitions, 266 flow [2022-09-20 20:35:03,801 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=266, PETRI_PLACES=138, PETRI_TRANSITIONS=127} [2022-09-20 20:35:03,806 INFO L287 CegarLoopForPetriNet]: 142 programPoint places, -4 predicate places. [2022-09-20 20:35:03,806 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 127 transitions, 266 flow [2022-09-20 20:35:03,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 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) [2022-09-20 20:35:03,806 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:35:03,807 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:35:03,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-20 20:35:03,807 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:35:03,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:35:03,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1620607474, now seen corresponding path program 1 times [2022-09-20 20:35:03,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:35:03,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490292764] [2022-09-20 20:35:03,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:35:03,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:35:03,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:35:04,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:35:04,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:35:04,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490292764] [2022-09-20 20:35:04,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490292764] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:35:04,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:35:04,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 20:35:04,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144594771] [2022-09-20 20:35:04,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:35:04,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 20:35:04,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:35:04,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 20:35:04,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 20:35:04,126 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 135 [2022-09-20 20:35:04,127 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 127 transitions, 266 flow. Second operand has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 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) [2022-09-20 20:35:04,128 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:35:04,129 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 135 [2022-09-20 20:35:04,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:35:04,749 INFO L130 PetriNetUnfolder]: 724/2188 cut-off events. [2022-09-20 20:35:04,750 INFO L131 PetriNetUnfolder]: For 94/94 co-relation queries the response was YES. [2022-09-20 20:35:04,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3439 conditions, 2188 events. 724/2188 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 17057 event pairs, 222 based on Foata normal form. 0/2123 useless extension candidates. Maximal degree in co-relation 3384. Up to 652 conditions per place. [2022-09-20 20:35:04,771 INFO L137 encePairwiseOnDemand]: 128/135 looper letters, 22 selfloop transitions, 3 changer transitions 56/175 dead transitions. [2022-09-20 20:35:04,771 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 175 transitions, 514 flow [2022-09-20 20:35:04,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-09-20 20:35:04,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-09-20 20:35:04,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1069 transitions. [2022-09-20 20:35:04,779 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8798353909465021 [2022-09-20 20:35:04,780 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1069 transitions. [2022-09-20 20:35:04,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1069 transitions. [2022-09-20 20:35:04,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:35:04,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1069 transitions. [2022-09-20 20:35:04,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 118.77777777777777) internal successors, (1069), 9 states have internal predecessors, (1069), 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) [2022-09-20 20:35:04,816 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 135.0) internal successors, (1350), 10 states have internal predecessors, (1350), 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) [2022-09-20 20:35:04,816 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 135.0) internal successors, (1350), 10 states have internal predecessors, (1350), 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) [2022-09-20 20:35:04,817 INFO L175 Difference]: Start difference. First operand has 138 places, 127 transitions, 266 flow. Second operand 9 states and 1069 transitions. [2022-09-20 20:35:04,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 175 transitions, 514 flow [2022-09-20 20:35:04,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 175 transitions, 496 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-09-20 20:35:04,819 INFO L231 Difference]: Finished difference. Result has 151 places, 115 transitions, 277 flow [2022-09-20 20:35:04,820 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=277, PETRI_PLACES=151, PETRI_TRANSITIONS=115} [2022-09-20 20:35:04,820 INFO L287 CegarLoopForPetriNet]: 142 programPoint places, 9 predicate places. [2022-09-20 20:35:04,820 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 115 transitions, 277 flow [2022-09-20 20:35:04,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 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) [2022-09-20 20:35:04,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:35:04,821 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:35:04,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-09-20 20:35:04,821 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:35:04,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:35:04,821 INFO L85 PathProgramCache]: Analyzing trace with hash -256106927, now seen corresponding path program 1 times [2022-09-20 20:35:04,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:35:04,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171841651] [2022-09-20 20:35:04,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:35:04,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:35:04,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:35:05,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:35:05,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:35:05,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171841651] [2022-09-20 20:35:05,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171841651] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:35:05,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:35:05,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 20:35:05,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751091069] [2022-09-20 20:35:05,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:35:05,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 20:35:05,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:35:05,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 20:35:05,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 20:35:05,031 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 135 [2022-09-20 20:35:05,032 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 115 transitions, 277 flow. Second operand has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 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) [2022-09-20 20:35:05,032 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:35:05,032 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 135 [2022-09-20 20:35:05,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:35:05,357 INFO L130 PetriNetUnfolder]: 390/898 cut-off events. [2022-09-20 20:35:05,357 INFO L131 PetriNetUnfolder]: For 556/558 co-relation queries the response was YES. [2022-09-20 20:35:05,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1972 conditions, 898 events. 390/898 cut-off events. For 556/558 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5188 event pairs, 77 based on Foata normal form. 28/896 useless extension candidates. Maximal degree in co-relation 1910. Up to 281 conditions per place. [2022-09-20 20:35:05,366 INFO L137 encePairwiseOnDemand]: 129/135 looper letters, 19 selfloop transitions, 2 changer transitions 31/150 dead transitions. [2022-09-20 20:35:05,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 150 transitions, 469 flow [2022-09-20 20:35:05,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-09-20 20:35:05,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-09-20 20:35:05,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1071 transitions. [2022-09-20 20:35:05,369 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8814814814814815 [2022-09-20 20:35:05,369 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1071 transitions. [2022-09-20 20:35:05,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1071 transitions. [2022-09-20 20:35:05,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:35:05,371 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1071 transitions. [2022-09-20 20:35:05,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 119.0) internal successors, (1071), 9 states have internal predecessors, (1071), 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) [2022-09-20 20:35:05,376 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 135.0) internal successors, (1350), 10 states have internal predecessors, (1350), 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) [2022-09-20 20:35:05,377 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 135.0) internal successors, (1350), 10 states have internal predecessors, (1350), 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) [2022-09-20 20:35:05,377 INFO L175 Difference]: Start difference. First operand has 151 places, 115 transitions, 277 flow. Second operand 9 states and 1071 transitions. [2022-09-20 20:35:05,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 150 transitions, 469 flow [2022-09-20 20:35:05,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 150 transitions, 450 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-09-20 20:35:05,387 INFO L231 Difference]: Finished difference. Result has 142 places, 115 transitions, 286 flow [2022-09-20 20:35:05,387 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=286, PETRI_PLACES=142, PETRI_TRANSITIONS=115} [2022-09-20 20:35:05,389 INFO L287 CegarLoopForPetriNet]: 142 programPoint places, 0 predicate places. [2022-09-20 20:35:05,390 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 115 transitions, 286 flow [2022-09-20 20:35:05,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 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) [2022-09-20 20:35:05,390 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:35:05,391 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:35:05,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-09-20 20:35:05,391 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:35:05,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:35:05,392 INFO L85 PathProgramCache]: Analyzing trace with hash -999767165, now seen corresponding path program 1 times [2022-09-20 20:35:05,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:35:05,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765907647] [2022-09-20 20:35:05,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:35:05,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:35:05,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:35:05,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:35:05,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:35:05,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765907647] [2022-09-20 20:35:05,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765907647] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:35:05,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:35:05,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 20:35:05,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157089323] [2022-09-20 20:35:05,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:35:05,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 20:35:05,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:35:05,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 20:35:05,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 20:35:05,607 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 135 [2022-09-20 20:35:05,608 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 115 transitions, 286 flow. Second operand has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 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) [2022-09-20 20:35:05,608 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:35:05,608 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 135 [2022-09-20 20:35:05,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:35:06,161 INFO L130 PetriNetUnfolder]: 1054/2153 cut-off events. [2022-09-20 20:35:06,162 INFO L131 PetriNetUnfolder]: For 1735/1735 co-relation queries the response was YES. [2022-09-20 20:35:06,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4861 conditions, 2153 events. 1054/2153 cut-off events. For 1735/1735 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 13998 event pairs, 443 based on Foata normal form. 48/2118 useless extension candidates. Maximal degree in co-relation 4794. Up to 875 conditions per place. [2022-09-20 20:35:06,185 INFO L137 encePairwiseOnDemand]: 128/135 looper letters, 24 selfloop transitions, 3 changer transitions 40/164 dead transitions. [2022-09-20 20:35:06,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 164 transitions, 552 flow [2022-09-20 20:35:06,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-09-20 20:35:06,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-09-20 20:35:06,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1077 transitions. [2022-09-20 20:35:06,189 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8864197530864197 [2022-09-20 20:35:06,189 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1077 transitions. [2022-09-20 20:35:06,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1077 transitions. [2022-09-20 20:35:06,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:35:06,190 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1077 transitions. [2022-09-20 20:35:06,193 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 119.66666666666667) internal successors, (1077), 9 states have internal predecessors, (1077), 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) [2022-09-20 20:35:06,195 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 135.0) internal successors, (1350), 10 states have internal predecessors, (1350), 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) [2022-09-20 20:35:06,197 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 135.0) internal successors, (1350), 10 states have internal predecessors, (1350), 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) [2022-09-20 20:35:06,197 INFO L175 Difference]: Start difference. First operand has 142 places, 115 transitions, 286 flow. Second operand 9 states and 1077 transitions. [2022-09-20 20:35:06,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 164 transitions, 552 flow [2022-09-20 20:35:06,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 164 transitions, 516 flow, removed 16 selfloop flow, removed 8 redundant places. [2022-09-20 20:35:06,220 INFO L231 Difference]: Finished difference. Result has 143 places, 117 transitions, 309 flow [2022-09-20 20:35:06,220 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=309, PETRI_PLACES=143, PETRI_TRANSITIONS=117} [2022-09-20 20:35:06,222 INFO L287 CegarLoopForPetriNet]: 142 programPoint places, 1 predicate places. [2022-09-20 20:35:06,224 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 117 transitions, 309 flow [2022-09-20 20:35:06,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 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) [2022-09-20 20:35:06,226 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:35:06,226 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:35:06,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-09-20 20:35:06,226 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:35:06,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:35:06,227 INFO L85 PathProgramCache]: Analyzing trace with hash 151472760, now seen corresponding path program 1 times [2022-09-20 20:35:06,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:35:06,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351956978] [2022-09-20 20:35:06,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:35:06,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:35:06,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:35:06,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:35:06,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:35:06,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351956978] [2022-09-20 20:35:06,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351956978] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:35:06,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:35:06,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-09-20 20:35:06,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849246208] [2022-09-20 20:35:06,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:35:06,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-09-20 20:35:06,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:35:06,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-09-20 20:35:06,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-09-20 20:35:06,448 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 135 [2022-09-20 20:35:06,450 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 117 transitions, 309 flow. Second operand has 9 states, 9 states have (on average 112.55555555555556) internal successors, (1013), 9 states have internal predecessors, (1013), 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) [2022-09-20 20:35:06,450 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:35:06,450 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 135 [2022-09-20 20:35:06,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:35:07,017 INFO L130 PetriNetUnfolder]: 1041/2152 cut-off events. [2022-09-20 20:35:07,018 INFO L131 PetriNetUnfolder]: For 3405/3435 co-relation queries the response was YES. [2022-09-20 20:35:07,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5683 conditions, 2152 events. 1041/2152 cut-off events. For 3405/3435 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 14106 event pairs, 413 based on Foata normal form. 56/2061 useless extension candidates. Maximal degree in co-relation 5613. Up to 857 conditions per place. [2022-09-20 20:35:07,045 INFO L137 encePairwiseOnDemand]: 123/135 looper letters, 20 selfloop transitions, 11 changer transitions 43/172 dead transitions. [2022-09-20 20:35:07,045 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 172 transitions, 621 flow [2022-09-20 20:35:07,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-09-20 20:35:07,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-09-20 20:35:07,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1631 transitions. [2022-09-20 20:35:07,049 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8629629629629629 [2022-09-20 20:35:07,050 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1631 transitions. [2022-09-20 20:35:07,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1631 transitions. [2022-09-20 20:35:07,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:35:07,051 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1631 transitions. [2022-09-20 20:35:07,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 116.5) internal successors, (1631), 14 states have internal predecessors, (1631), 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) [2022-09-20 20:35:07,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 135.0) internal successors, (2025), 15 states have internal predecessors, (2025), 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) [2022-09-20 20:35:07,058 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 135.0) internal successors, (2025), 15 states have internal predecessors, (2025), 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) [2022-09-20 20:35:07,058 INFO L175 Difference]: Start difference. First operand has 143 places, 117 transitions, 309 flow. Second operand 14 states and 1631 transitions. [2022-09-20 20:35:07,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 172 transitions, 621 flow [2022-09-20 20:35:07,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 172 transitions, 600 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-09-20 20:35:07,069 INFO L231 Difference]: Finished difference. Result has 157 places, 125 transitions, 400 flow [2022-09-20 20:35:07,069 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=400, PETRI_PLACES=157, PETRI_TRANSITIONS=125} [2022-09-20 20:35:07,071 INFO L287 CegarLoopForPetriNet]: 142 programPoint places, 15 predicate places. [2022-09-20 20:35:07,072 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 125 transitions, 400 flow [2022-09-20 20:35:07,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 112.55555555555556) internal successors, (1013), 9 states have internal predecessors, (1013), 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) [2022-09-20 20:35:07,072 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:35:07,072 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:35:07,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-09-20 20:35:07,073 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:35:07,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:35:07,073 INFO L85 PathProgramCache]: Analyzing trace with hash 623009225, now seen corresponding path program 1 times [2022-09-20 20:35:07,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:35:07,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120971313] [2022-09-20 20:35:07,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:35:07,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:35:07,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:35:07,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:35:07,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:35:07,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120971313] [2022-09-20 20:35:07,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120971313] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:35:07,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:35:07,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-09-20 20:35:07,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109987878] [2022-09-20 20:35:07,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:35:07,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-09-20 20:35:07,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:35:07,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-09-20 20:35:07,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-09-20 20:35:07,310 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 135 [2022-09-20 20:35:07,319 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 125 transitions, 400 flow. Second operand has 10 states, 10 states have (on average 111.6) internal successors, (1116), 10 states have internal predecessors, (1116), 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) [2022-09-20 20:35:07,319 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:35:07,319 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 135 [2022-09-20 20:35:07,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:35:07,941 INFO L130 PetriNetUnfolder]: 903/1925 cut-off events. [2022-09-20 20:35:07,941 INFO L131 PetriNetUnfolder]: For 7473/7575 co-relation queries the response was YES. [2022-09-20 20:35:07,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6898 conditions, 1925 events. 903/1925 cut-off events. For 7473/7575 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 12399 event pairs, 218 based on Foata normal form. 35/1852 useless extension candidates. Maximal degree in co-relation 6815. Up to 709 conditions per place. [2022-09-20 20:35:07,970 INFO L137 encePairwiseOnDemand]: 124/135 looper letters, 38 selfloop transitions, 10 changer transitions 37/182 dead transitions. [2022-09-20 20:35:07,970 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 182 transitions, 938 flow [2022-09-20 20:35:07,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-09-20 20:35:07,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-09-20 20:35:07,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1730 transitions. [2022-09-20 20:35:07,975 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.854320987654321 [2022-09-20 20:35:07,975 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1730 transitions. [2022-09-20 20:35:07,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1730 transitions. [2022-09-20 20:35:07,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:35:07,976 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1730 transitions. [2022-09-20 20:35:07,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 115.33333333333333) internal successors, (1730), 15 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) [2022-09-20 20:35:07,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 135.0) internal successors, (2160), 16 states have internal predecessors, (2160), 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) [2022-09-20 20:35:07,985 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 135.0) internal successors, (2160), 16 states have internal predecessors, (2160), 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) [2022-09-20 20:35:07,985 INFO L175 Difference]: Start difference. First operand has 157 places, 125 transitions, 400 flow. Second operand 15 states and 1730 transitions. [2022-09-20 20:35:07,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 182 transitions, 938 flow [2022-09-20 20:35:07,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 182 transitions, 906 flow, removed 15 selfloop flow, removed 4 redundant places. [2022-09-20 20:35:07,996 INFO L231 Difference]: Finished difference. Result has 169 places, 129 transitions, 482 flow [2022-09-20 20:35:07,996 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=482, PETRI_PLACES=169, PETRI_TRANSITIONS=129} [2022-09-20 20:35:07,999 INFO L287 CegarLoopForPetriNet]: 142 programPoint places, 27 predicate places. [2022-09-20 20:35:07,999 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 129 transitions, 482 flow [2022-09-20 20:35:08,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 111.6) internal successors, (1116), 10 states have internal predecessors, (1116), 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) [2022-09-20 20:35:08,000 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:35:08,000 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:35:08,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-09-20 20:35:08,002 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:35:08,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:35:08,002 INFO L85 PathProgramCache]: Analyzing trace with hash -780525375, now seen corresponding path program 1 times [2022-09-20 20:35:08,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:35:08,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398203158] [2022-09-20 20:35:08,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:35:08,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:35:08,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:35:08,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:35:08,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:35:08,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398203158] [2022-09-20 20:35:08,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398203158] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:35:08,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:35:08,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-09-20 20:35:08,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626870735] [2022-09-20 20:35:08,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:35:08,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-09-20 20:35:08,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:35:08,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-09-20 20:35:08,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-09-20 20:35:08,297 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 135 [2022-09-20 20:35:08,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 129 transitions, 482 flow. Second operand has 12 states, 12 states have (on average 110.5) internal successors, (1326), 12 states have internal predecessors, (1326), 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) [2022-09-20 20:35:08,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:35:08,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 135 [2022-09-20 20:35:08,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:35:08,944 INFO L130 PetriNetUnfolder]: 768/1714 cut-off events. [2022-09-20 20:35:08,944 INFO L131 PetriNetUnfolder]: For 12107/12238 co-relation queries the response was YES. [2022-09-20 20:35:08,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7917 conditions, 1714 events. 768/1714 cut-off events. For 12107/12238 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 10778 event pairs, 198 based on Foata normal form. 28/1641 useless extension candidates. Maximal degree in co-relation 7822. Up to 689 conditions per place. [2022-09-20 20:35:08,976 INFO L137 encePairwiseOnDemand]: 125/135 looper letters, 40 selfloop transitions, 10 changer transitions 25/171 dead transitions. [2022-09-20 20:35:08,977 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 171 transitions, 1084 flow [2022-09-20 20:35:08,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-09-20 20:35:08,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-09-20 20:35:08,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1484 transitions. [2022-09-20 20:35:08,981 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8455840455840455 [2022-09-20 20:35:08,981 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1484 transitions. [2022-09-20 20:35:08,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1484 transitions. [2022-09-20 20:35:08,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:35:08,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1484 transitions. [2022-09-20 20:35:08,984 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 114.15384615384616) internal successors, (1484), 13 states have internal predecessors, (1484), 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) [2022-09-20 20:35:08,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 135.0) internal successors, (1890), 14 states have internal predecessors, (1890), 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) [2022-09-20 20:35:08,988 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 135.0) internal successors, (1890), 14 states have internal predecessors, (1890), 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) [2022-09-20 20:35:08,988 INFO L175 Difference]: Start difference. First operand has 169 places, 129 transitions, 482 flow. Second operand 13 states and 1484 transitions. [2022-09-20 20:35:08,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 171 transitions, 1084 flow [2022-09-20 20:35:09,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 171 transitions, 1016 flow, removed 28 selfloop flow, removed 9 redundant places. [2022-09-20 20:35:09,004 INFO L231 Difference]: Finished difference. Result has 170 places, 130 transitions, 508 flow [2022-09-20 20:35:09,004 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=508, PETRI_PLACES=170, PETRI_TRANSITIONS=130} [2022-09-20 20:35:09,005 INFO L287 CegarLoopForPetriNet]: 142 programPoint places, 28 predicate places. [2022-09-20 20:35:09,005 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 130 transitions, 508 flow [2022-09-20 20:35:09,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 110.5) internal successors, (1326), 12 states have internal predecessors, (1326), 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) [2022-09-20 20:35:09,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:35:09,006 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:35:09,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-09-20 20:35:09,006 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:35:09,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:35:09,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1077850938, now seen corresponding path program 1 times [2022-09-20 20:35:09,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:35:09,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351218356] [2022-09-20 20:35:09,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:35:09,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:35:09,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:35:09,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:35:09,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:35:09,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351218356] [2022-09-20 20:35:09,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351218356] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:35:09,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:35:09,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-09-20 20:35:09,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657414127] [2022-09-20 20:35:09,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:35:09,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-09-20 20:35:09,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:35:09,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-09-20 20:35:09,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-09-20 20:35:09,177 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 135 [2022-09-20 20:35:09,178 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 130 transitions, 508 flow. Second operand has 9 states, 9 states have (on average 111.77777777777777) internal successors, (1006), 9 states have internal predecessors, (1006), 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) [2022-09-20 20:35:09,178 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:35:09,178 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 135 [2022-09-20 20:35:09,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:35:09,720 INFO L130 PetriNetUnfolder]: 851/1837 cut-off events. [2022-09-20 20:35:09,720 INFO L131 PetriNetUnfolder]: For 14488/14684 co-relation queries the response was YES. [2022-09-20 20:35:09,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8675 conditions, 1837 events. 851/1837 cut-off events. For 14488/14684 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 12176 event pairs, 181 based on Foata normal form. 71/1807 useless extension candidates. Maximal degree in co-relation 8578. Up to 625 conditions per place. [2022-09-20 20:35:09,747 INFO L137 encePairwiseOnDemand]: 123/135 looper letters, 26 selfloop transitions, 14 changer transitions 48/185 dead transitions. [2022-09-20 20:35:09,747 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 185 transitions, 1241 flow [2022-09-20 20:35:09,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-09-20 20:35:09,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-09-20 20:35:09,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1835 transitions. [2022-09-20 20:35:09,752 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8495370370370371 [2022-09-20 20:35:09,752 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1835 transitions. [2022-09-20 20:35:09,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1835 transitions. [2022-09-20 20:35:09,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:35:09,753 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1835 transitions. [2022-09-20 20:35:09,756 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 114.6875) internal successors, (1835), 16 states have internal predecessors, (1835), 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) [2022-09-20 20:35:09,760 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 135.0) internal successors, (2295), 17 states have internal predecessors, (2295), 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) [2022-09-20 20:35:09,760 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 135.0) internal successors, (2295), 17 states have internal predecessors, (2295), 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) [2022-09-20 20:35:09,760 INFO L175 Difference]: Start difference. First operand has 170 places, 130 transitions, 508 flow. Second operand 16 states and 1835 transitions. [2022-09-20 20:35:09,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 185 transitions, 1241 flow [2022-09-20 20:35:09,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 185 transitions, 1153 flow, removed 34 selfloop flow, removed 10 redundant places. [2022-09-20 20:35:09,780 INFO L231 Difference]: Finished difference. Result has 180 places, 132 transitions, 581 flow [2022-09-20 20:35:09,781 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=581, PETRI_PLACES=180, PETRI_TRANSITIONS=132} [2022-09-20 20:35:09,782 INFO L287 CegarLoopForPetriNet]: 142 programPoint places, 38 predicate places. [2022-09-20 20:35:09,782 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 132 transitions, 581 flow [2022-09-20 20:35:09,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 111.77777777777777) internal successors, (1006), 9 states have internal predecessors, (1006), 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) [2022-09-20 20:35:09,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:35:09,783 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:35:09,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-09-20 20:35:09,784 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:35:09,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:35:09,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1061301541, now seen corresponding path program 1 times [2022-09-20 20:35:09,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:35:09,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663938842] [2022-09-20 20:35:09,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:35:09,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:35:09,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:35:09,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:35:09,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:35:09,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663938842] [2022-09-20 20:35:09,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663938842] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:35:09,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:35:09,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-09-20 20:35:09,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995393765] [2022-09-20 20:35:09,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:35:09,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-09-20 20:35:09,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:35:09,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-09-20 20:35:09,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-09-20 20:35:09,977 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 135 [2022-09-20 20:35:09,978 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 132 transitions, 581 flow. Second operand has 10 states, 10 states have (on average 110.8) internal successors, (1108), 10 states have internal predecessors, (1108), 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) [2022-09-20 20:35:09,978 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:35:09,978 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 135 [2022-09-20 20:35:09,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:35:10,436 INFO L130 PetriNetUnfolder]: 683/1635 cut-off events. [2022-09-20 20:35:10,436 INFO L131 PetriNetUnfolder]: For 18478/18602 co-relation queries the response was YES. [2022-09-20 20:35:10,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8734 conditions, 1635 events. 683/1635 cut-off events. For 18478/18602 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 10392 event pairs, 152 based on Foata normal form. 30/1582 useless extension candidates. Maximal degree in co-relation 8630. Up to 604 conditions per place. [2022-09-20 20:35:10,468 INFO L137 encePairwiseOnDemand]: 122/135 looper letters, 34 selfloop transitions, 17 changer transitions 13/160 dead transitions. [2022-09-20 20:35:10,468 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 160 transitions, 1039 flow [2022-09-20 20:35:10,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-09-20 20:35:10,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-09-20 20:35:10,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1141 transitions. [2022-09-20 20:35:10,471 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8451851851851852 [2022-09-20 20:35:10,471 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1141 transitions. [2022-09-20 20:35:10,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1141 transitions. [2022-09-20 20:35:10,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:35:10,472 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1141 transitions. [2022-09-20 20:35:10,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 114.1) internal successors, (1141), 10 states have internal predecessors, (1141), 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) [2022-09-20 20:35:10,477 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 135.0) internal successors, (1485), 11 states have internal predecessors, (1485), 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) [2022-09-20 20:35:10,478 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 135.0) internal successors, (1485), 11 states have internal predecessors, (1485), 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) [2022-09-20 20:35:10,478 INFO L175 Difference]: Start difference. First operand has 180 places, 132 transitions, 581 flow. Second operand 10 states and 1141 transitions. [2022-09-20 20:35:10,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 160 transitions, 1039 flow [2022-09-20 20:35:10,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 160 transitions, 957 flow, removed 31 selfloop flow, removed 14 redundant places. [2022-09-20 20:35:10,496 INFO L231 Difference]: Finished difference. Result has 171 places, 140 transitions, 656 flow [2022-09-20 20:35:10,496 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=656, PETRI_PLACES=171, PETRI_TRANSITIONS=140} [2022-09-20 20:35:10,497 INFO L287 CegarLoopForPetriNet]: 142 programPoint places, 29 predicate places. [2022-09-20 20:35:10,497 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 140 transitions, 656 flow [2022-09-20 20:35:10,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 110.8) internal successors, (1108), 10 states have internal predecessors, (1108), 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) [2022-09-20 20:35:10,498 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:35:10,498 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:35:10,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-09-20 20:35:10,499 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:35:10,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:35:10,499 INFO L85 PathProgramCache]: Analyzing trace with hash 600617691, now seen corresponding path program 2 times [2022-09-20 20:35:10,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:35:10,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533954304] [2022-09-20 20:35:10,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:35:10,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:35:10,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:35:10,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:35:10,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:35:10,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533954304] [2022-09-20 20:35:10,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533954304] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:35:10,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:35:10,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-09-20 20:35:10,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704500789] [2022-09-20 20:35:10,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:35:10,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-09-20 20:35:10,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:35:10,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-09-20 20:35:10,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-09-20 20:35:10,704 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 135 [2022-09-20 20:35:10,706 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 140 transitions, 656 flow. Second operand has 10 states, 10 states have (on average 110.8) internal successors, (1108), 10 states have internal predecessors, (1108), 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) [2022-09-20 20:35:10,706 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:35:10,706 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 135 [2022-09-20 20:35:10,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:35:11,286 INFO L130 PetriNetUnfolder]: 712/1675 cut-off events. [2022-09-20 20:35:11,286 INFO L131 PetriNetUnfolder]: For 19698/20087 co-relation queries the response was YES. [2022-09-20 20:35:11,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9346 conditions, 1675 events. 712/1675 cut-off events. For 19698/20087 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 10778 event pairs, 104 based on Foata normal form. 53/1637 useless extension candidates. Maximal degree in co-relation 9247. Up to 613 conditions per place. [2022-09-20 20:35:11,313 INFO L137 encePairwiseOnDemand]: 123/135 looper letters, 36 selfloop transitions, 18 changer transitions 25/175 dead transitions. [2022-09-20 20:35:11,313 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 175 transitions, 1332 flow [2022-09-20 20:35:11,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-09-20 20:35:11,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-09-20 20:35:11,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1372 transitions. [2022-09-20 20:35:11,317 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8469135802469135 [2022-09-20 20:35:11,317 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1372 transitions. [2022-09-20 20:35:11,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1372 transitions. [2022-09-20 20:35:11,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:35:11,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1372 transitions. [2022-09-20 20:35:11,320 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 114.33333333333333) internal successors, (1372), 12 states have internal predecessors, (1372), 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) [2022-09-20 20:35:11,323 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 135.0) internal successors, (1755), 13 states have internal predecessors, (1755), 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) [2022-09-20 20:35:11,323 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 135.0) internal successors, (1755), 13 states have internal predecessors, (1755), 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) [2022-09-20 20:35:11,323 INFO L175 Difference]: Start difference. First operand has 171 places, 140 transitions, 656 flow. Second operand 12 states and 1372 transitions. [2022-09-20 20:35:11,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 175 transitions, 1332 flow [2022-09-20 20:35:11,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 175 transitions, 1197 flow, removed 61 selfloop flow, removed 9 redundant places. [2022-09-20 20:35:11,346 INFO L231 Difference]: Finished difference. Result has 177 places, 143 transitions, 708 flow [2022-09-20 20:35:11,347 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=579, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=708, PETRI_PLACES=177, PETRI_TRANSITIONS=143} [2022-09-20 20:35:11,347 INFO L287 CegarLoopForPetriNet]: 142 programPoint places, 35 predicate places. [2022-09-20 20:35:11,347 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 143 transitions, 708 flow [2022-09-20 20:35:11,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 110.8) internal successors, (1108), 10 states have internal predecessors, (1108), 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) [2022-09-20 20:35:11,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:35:11,348 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:35:11,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-09-20 20:35:11,348 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:35:11,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:35:11,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1401362573, now seen corresponding path program 3 times [2022-09-20 20:35:11,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:35:11,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109236544] [2022-09-20 20:35:11,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:35:11,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:35:11,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:35:11,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:35:11,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:35:11,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109236544] [2022-09-20 20:35:11,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109236544] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:35:11,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:35:11,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-09-20 20:35:11,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758547476] [2022-09-20 20:35:11,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:35:11,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-09-20 20:35:11,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:35:11,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-09-20 20:35:11,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-09-20 20:35:11,538 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 135 [2022-09-20 20:35:11,539 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 143 transitions, 708 flow. Second operand has 11 states, 11 states have (on average 111.54545454545455) internal successors, (1227), 11 states have internal predecessors, (1227), 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) [2022-09-20 20:35:11,539 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:35:11,539 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 135 [2022-09-20 20:35:11,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:35:12,177 INFO L130 PetriNetUnfolder]: 805/1764 cut-off events. [2022-09-20 20:35:12,177 INFO L131 PetriNetUnfolder]: For 32843/33361 co-relation queries the response was YES. [2022-09-20 20:35:12,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11926 conditions, 1764 events. 805/1764 cut-off events. For 32843/33361 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 11066 event pairs, 64 based on Foata normal form. 76/1750 useless extension candidates. Maximal degree in co-relation 11827. Up to 628 conditions per place. [2022-09-20 20:35:12,205 INFO L137 encePairwiseOnDemand]: 123/135 looper letters, 39 selfloop transitions, 19 changer transitions 25/180 dead transitions. [2022-09-20 20:35:12,205 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 180 transitions, 1552 flow [2022-09-20 20:35:12,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-09-20 20:35:12,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-09-20 20:35:12,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1492 transitions. [2022-09-20 20:35:12,207 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8501424501424502 [2022-09-20 20:35:12,207 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1492 transitions. [2022-09-20 20:35:12,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1492 transitions. [2022-09-20 20:35:12,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:35:12,208 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1492 transitions. [2022-09-20 20:35:12,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 114.76923076923077) internal successors, (1492), 13 states have internal predecessors, (1492), 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) [2022-09-20 20:35:12,213 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 135.0) internal successors, (1890), 14 states have internal predecessors, (1890), 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) [2022-09-20 20:35:12,214 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 135.0) internal successors, (1890), 14 states have internal predecessors, (1890), 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) [2022-09-20 20:35:12,214 INFO L175 Difference]: Start difference. First operand has 177 places, 143 transitions, 708 flow. Second operand 13 states and 1492 transitions. [2022-09-20 20:35:12,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 180 transitions, 1552 flow [2022-09-20 20:35:12,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 180 transitions, 1473 flow, removed 25 selfloop flow, removed 7 redundant places. [2022-09-20 20:35:12,236 INFO L231 Difference]: Finished difference. Result has 183 places, 146 transitions, 797 flow [2022-09-20 20:35:12,237 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=797, PETRI_PLACES=183, PETRI_TRANSITIONS=146} [2022-09-20 20:35:12,237 INFO L287 CegarLoopForPetriNet]: 142 programPoint places, 41 predicate places. [2022-09-20 20:35:12,237 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 146 transitions, 797 flow [2022-09-20 20:35:12,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 111.54545454545455) internal successors, (1227), 11 states have internal predecessors, (1227), 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) [2022-09-20 20:35:12,238 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:35:12,238 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:35:12,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-09-20 20:35:12,239 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:35:12,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:35:12,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1682452899, now seen corresponding path program 4 times [2022-09-20 20:35:12,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:35:12,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408019941] [2022-09-20 20:35:12,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:35:12,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:35:12,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:35:12,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:35:12,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:35:12,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408019941] [2022-09-20 20:35:12,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408019941] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:35:12,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:35:12,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-09-20 20:35:12,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742560955] [2022-09-20 20:35:12,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:35:12,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-09-20 20:35:12,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:35:12,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-09-20 20:35:12,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-09-20 20:35:12,409 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 135 [2022-09-20 20:35:12,409 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 146 transitions, 797 flow. Second operand has 9 states, 9 states have (on average 111.88888888888889) internal successors, (1007), 9 states have internal predecessors, (1007), 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) [2022-09-20 20:35:12,409 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:35:12,410 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 135 [2022-09-20 20:35:12,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:35:13,085 INFO L130 PetriNetUnfolder]: 785/1752 cut-off events. [2022-09-20 20:35:13,085 INFO L131 PetriNetUnfolder]: For 54009/55000 co-relation queries the response was YES. [2022-09-20 20:35:13,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14111 conditions, 1752 events. 785/1752 cut-off events. For 54009/55000 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 11520 event pairs, 50 based on Foata normal form. 97/1775 useless extension candidates. Maximal degree in co-relation 14007. Up to 644 conditions per place. [2022-09-20 20:35:13,119 INFO L137 encePairwiseOnDemand]: 123/135 looper letters, 40 selfloop transitions, 25 changer transitions 25/187 dead transitions. [2022-09-20 20:35:13,119 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 187 transitions, 1899 flow [2022-09-20 20:35:13,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-09-20 20:35:13,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-09-20 20:35:13,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1606 transitions. [2022-09-20 20:35:13,123 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8497354497354498 [2022-09-20 20:35:13,124 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1606 transitions. [2022-09-20 20:35:13,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1606 transitions. [2022-09-20 20:35:13,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:35:13,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1606 transitions. [2022-09-20 20:35:13,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 114.71428571428571) internal successors, (1606), 14 states have internal predecessors, (1606), 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) [2022-09-20 20:35:13,145 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 135.0) internal successors, (2025), 15 states have internal predecessors, (2025), 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) [2022-09-20 20:35:13,145 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 135.0) internal successors, (2025), 15 states have internal predecessors, (2025), 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) [2022-09-20 20:35:13,145 INFO L175 Difference]: Start difference. First operand has 183 places, 146 transitions, 797 flow. Second operand 14 states and 1606 transitions. [2022-09-20 20:35:13,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 187 transitions, 1899 flow [2022-09-20 20:35:13,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 187 transitions, 1441 flow, removed 216 selfloop flow, removed 14 redundant places. [2022-09-20 20:35:13,188 INFO L231 Difference]: Finished difference. Result has 183 places, 149 transitions, 829 flow [2022-09-20 20:35:13,188 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=663, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=829, PETRI_PLACES=183, PETRI_TRANSITIONS=149} [2022-09-20 20:35:13,189 INFO L287 CegarLoopForPetriNet]: 142 programPoint places, 41 predicate places. [2022-09-20 20:35:13,189 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 149 transitions, 829 flow [2022-09-20 20:35:13,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 111.88888888888889) internal successors, (1007), 9 states have internal predecessors, (1007), 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) [2022-09-20 20:35:13,189 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:35:13,189 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:35:13,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-09-20 20:35:13,190 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:35:13,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:35:13,190 INFO L85 PathProgramCache]: Analyzing trace with hash -642079145, now seen corresponding path program 1 times [2022-09-20 20:35:13,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:35:13,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527728380] [2022-09-20 20:35:13,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:35:13,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:35:13,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:35:13,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:35:13,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:35:13,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527728380] [2022-09-20 20:35:13,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527728380] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:35:13,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:35:13,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-09-20 20:35:13,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293848135] [2022-09-20 20:35:13,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:35:13,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-09-20 20:35:13,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:35:13,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-09-20 20:35:13,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-09-20 20:35:13,383 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 135 [2022-09-20 20:35:13,383 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 149 transitions, 829 flow. Second operand has 10 states, 10 states have (on average 110.9) internal successors, (1109), 10 states have internal predecessors, (1109), 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) [2022-09-20 20:35:13,384 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:35:13,384 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 135 [2022-09-20 20:35:13,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:35:13,965 INFO L130 PetriNetUnfolder]: 666/1643 cut-off events. [2022-09-20 20:35:13,965 INFO L131 PetriNetUnfolder]: For 33072/34075 co-relation queries the response was YES. [2022-09-20 20:35:13,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10916 conditions, 1643 events. 666/1643 cut-off events. For 33072/34075 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 10802 event pairs, 79 based on Foata normal form. 116/1662 useless extension candidates. Maximal degree in co-relation 10813. Up to 684 conditions per place. [2022-09-20 20:35:13,991 INFO L137 encePairwiseOnDemand]: 123/135 looper letters, 46 selfloop transitions, 21 changer transitions 19/182 dead transitions. [2022-09-20 20:35:13,991 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 182 transitions, 1662 flow [2022-09-20 20:35:13,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-09-20 20:35:13,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-09-20 20:35:13,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1366 transitions. [2022-09-20 20:35:13,994 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8432098765432099 [2022-09-20 20:35:13,994 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1366 transitions. [2022-09-20 20:35:13,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1366 transitions. [2022-09-20 20:35:13,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:35:13,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1366 transitions. [2022-09-20 20:35:13,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 113.83333333333333) internal successors, (1366), 12 states have internal predecessors, (1366), 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) [2022-09-20 20:35:13,998 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 135.0) internal successors, (1755), 13 states have internal predecessors, (1755), 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) [2022-09-20 20:35:13,999 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 135.0) internal successors, (1755), 13 states have internal predecessors, (1755), 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) [2022-09-20 20:35:13,999 INFO L175 Difference]: Start difference. First operand has 183 places, 149 transitions, 829 flow. Second operand 12 states and 1366 transitions. [2022-09-20 20:35:13,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 182 transitions, 1662 flow [2022-09-20 20:35:14,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 182 transitions, 1435 flow, removed 101 selfloop flow, removed 12 redundant places. [2022-09-20 20:35:14,024 INFO L231 Difference]: Finished difference. Result has 184 places, 155 transitions, 967 flow [2022-09-20 20:35:14,025 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=967, PETRI_PLACES=184, PETRI_TRANSITIONS=155} [2022-09-20 20:35:14,025 INFO L287 CegarLoopForPetriNet]: 142 programPoint places, 42 predicate places. [2022-09-20 20:35:14,025 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 155 transitions, 967 flow [2022-09-20 20:35:14,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 110.9) internal successors, (1109), 10 states have internal predecessors, (1109), 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) [2022-09-20 20:35:14,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:35:14,026 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:35:14,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-09-20 20:35:14,026 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:35:14,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:35:14,026 INFO L85 PathProgramCache]: Analyzing trace with hash 694488253, now seen corresponding path program 2 times [2022-09-20 20:35:14,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:35:14,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066711692] [2022-09-20 20:35:14,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:35:14,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:35:14,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:35:14,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:35:14,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:35:14,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066711692] [2022-09-20 20:35:14,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066711692] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:35:14,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:35:14,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-09-20 20:35:14,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201880534] [2022-09-20 20:35:14,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:35:14,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-09-20 20:35:14,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:35:14,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-09-20 20:35:14,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-09-20 20:35:14,268 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 135 [2022-09-20 20:35:14,269 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 155 transitions, 967 flow. Second operand has 13 states, 13 states have (on average 108.61538461538461) internal successors, (1412), 13 states have internal predecessors, (1412), 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) [2022-09-20 20:35:14,269 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:35:14,269 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 135 [2022-09-20 20:35:14,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:35:14,854 INFO L130 PetriNetUnfolder]: 682/1619 cut-off events. [2022-09-20 20:35:14,854 INFO L131 PetriNetUnfolder]: For 31648/33660 co-relation queries the response was YES. [2022-09-20 20:35:14,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10996 conditions, 1619 events. 682/1619 cut-off events. For 31648/33660 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 10799 event pairs, 96 based on Foata normal form. 103/1634 useless extension candidates. Maximal degree in co-relation 10891. Up to 741 conditions per place. [2022-09-20 20:35:14,877 INFO L137 encePairwiseOnDemand]: 122/135 looper letters, 49 selfloop transitions, 25 changer transitions 19/187 dead transitions. [2022-09-20 20:35:14,878 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 187 transitions, 1790 flow [2022-09-20 20:35:14,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-09-20 20:35:14,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-09-20 20:35:14,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1558 transitions. [2022-09-20 20:35:14,880 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8243386243386244 [2022-09-20 20:35:14,880 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1558 transitions. [2022-09-20 20:35:14,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1558 transitions. [2022-09-20 20:35:14,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:35:14,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1558 transitions. [2022-09-20 20:35:14,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 111.28571428571429) internal successors, (1558), 14 states have internal predecessors, (1558), 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) [2022-09-20 20:35:14,885 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 135.0) internal successors, (2025), 15 states have internal predecessors, (2025), 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) [2022-09-20 20:35:14,886 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 135.0) internal successors, (2025), 15 states have internal predecessors, (2025), 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) [2022-09-20 20:35:14,886 INFO L175 Difference]: Start difference. First operand has 184 places, 155 transitions, 967 flow. Second operand 14 states and 1558 transitions. [2022-09-20 20:35:14,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 187 transitions, 1790 flow [2022-09-20 20:35:14,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 187 transitions, 1588 flow, removed 90 selfloop flow, removed 9 redundant places. [2022-09-20 20:35:14,921 INFO L231 Difference]: Finished difference. Result has 189 places, 159 transitions, 1041 flow [2022-09-20 20:35:14,922 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=871, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1041, PETRI_PLACES=189, PETRI_TRANSITIONS=159} [2022-09-20 20:35:14,922 INFO L287 CegarLoopForPetriNet]: 142 programPoint places, 47 predicate places. [2022-09-20 20:35:14,922 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 159 transitions, 1041 flow [2022-09-20 20:35:14,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 108.61538461538461) internal successors, (1412), 13 states have internal predecessors, (1412), 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) [2022-09-20 20:35:14,923 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:35:14,923 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:35:14,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-09-20 20:35:14,923 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:35:14,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:35:14,923 INFO L85 PathProgramCache]: Analyzing trace with hash 2078255271, now seen corresponding path program 3 times [2022-09-20 20:35:14,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:35:14,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452017764] [2022-09-20 20:35:14,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:35:14,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:35:14,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:35:15,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:35:15,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:35:15,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452017764] [2022-09-20 20:35:15,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452017764] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:35:15,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:35:15,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-09-20 20:35:15,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930798506] [2022-09-20 20:35:15,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:35:15,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-09-20 20:35:15,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:35:15,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-09-20 20:35:15,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-09-20 20:35:15,146 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 135 [2022-09-20 20:35:15,147 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 159 transitions, 1041 flow. Second operand has 11 states, 11 states have (on average 109.81818181818181) internal successors, (1208), 11 states have internal predecessors, (1208), 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) [2022-09-20 20:35:15,147 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:35:15,147 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 135 [2022-09-20 20:35:15,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:35:15,724 INFO L130 PetriNetUnfolder]: 691/1818 cut-off events. [2022-09-20 20:35:15,724 INFO L131 PetriNetUnfolder]: For 33623/34883 co-relation queries the response was YES. [2022-09-20 20:35:15,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11408 conditions, 1818 events. 691/1818 cut-off events. For 33623/34883 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 13148 event pairs, 98 based on Foata normal form. 86/1827 useless extension candidates. Maximal degree in co-relation 11301. Up to 567 conditions per place. [2022-09-20 20:35:15,749 INFO L137 encePairwiseOnDemand]: 124/135 looper letters, 59 selfloop transitions, 17 changer transitions 19/190 dead transitions. [2022-09-20 20:35:15,750 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 190 transitions, 1901 flow [2022-09-20 20:35:15,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-09-20 20:35:15,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-09-20 20:35:15,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1461 transitions. [2022-09-20 20:35:15,752 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8324786324786325 [2022-09-20 20:35:15,752 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1461 transitions. [2022-09-20 20:35:15,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1461 transitions. [2022-09-20 20:35:15,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:35:15,753 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1461 transitions. [2022-09-20 20:35:15,755 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 112.38461538461539) internal successors, (1461), 13 states have internal predecessors, (1461), 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) [2022-09-20 20:35:15,757 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 135.0) internal successors, (1890), 14 states have internal predecessors, (1890), 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) [2022-09-20 20:35:15,757 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 135.0) internal successors, (1890), 14 states have internal predecessors, (1890), 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) [2022-09-20 20:35:15,757 INFO L175 Difference]: Start difference. First operand has 189 places, 159 transitions, 1041 flow. Second operand 13 states and 1461 transitions. [2022-09-20 20:35:15,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 190 transitions, 1901 flow [2022-09-20 20:35:15,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 190 transitions, 1651 flow, removed 106 selfloop flow, removed 12 redundant places. [2022-09-20 20:35:15,793 INFO L231 Difference]: Finished difference. Result has 190 places, 161 transitions, 1064 flow [2022-09-20 20:35:15,794 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=941, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1064, PETRI_PLACES=190, PETRI_TRANSITIONS=161} [2022-09-20 20:35:15,794 INFO L287 CegarLoopForPetriNet]: 142 programPoint places, 48 predicate places. [2022-09-20 20:35:15,794 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 161 transitions, 1064 flow [2022-09-20 20:35:15,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 109.81818181818181) internal successors, (1208), 11 states have internal predecessors, (1208), 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) [2022-09-20 20:35:15,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:35:15,795 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:35:15,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-09-20 20:35:15,795 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:35:15,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:35:15,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1326229701, now seen corresponding path program 1 times [2022-09-20 20:35:15,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:35:15,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715803346] [2022-09-20 20:35:15,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:35:15,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:35:15,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:35:15,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:35:15,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:35:15,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715803346] [2022-09-20 20:35:15,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715803346] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:35:15,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:35:15,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 20:35:15,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837063765] [2022-09-20 20:35:15,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:35:15,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 20:35:15,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:35:15,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 20:35:15,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 20:35:15,875 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 135 [2022-09-20 20:35:15,876 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 161 transitions, 1064 flow. Second operand has 6 states, 6 states have (on average 111.5) internal successors, (669), 6 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) [2022-09-20 20:35:15,876 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:35:15,876 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 135 [2022-09-20 20:35:15,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:35:18,020 INFO L130 PetriNetUnfolder]: 7978/14179 cut-off events. [2022-09-20 20:35:18,020 INFO L131 PetriNetUnfolder]: For 231739/237485 co-relation queries the response was YES. [2022-09-20 20:35:18,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70006 conditions, 14179 events. 7978/14179 cut-off events. For 231739/237485 co-relation queries the response was YES. Maximal size of possible extension queue 954. Compared 117233 event pairs, 383 based on Foata normal form. 987/14457 useless extension candidates. Maximal degree in co-relation 69904. Up to 4949 conditions per place. [2022-09-20 20:35:18,219 INFO L137 encePairwiseOnDemand]: 124/135 looper letters, 257 selfloop transitions, 20 changer transitions 7/383 dead transitions. [2022-09-20 20:35:18,220 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 383 transitions, 4546 flow [2022-09-20 20:35:18,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-09-20 20:35:18,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-09-20 20:35:18,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1182 transitions. [2022-09-20 20:35:18,222 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8755555555555555 [2022-09-20 20:35:18,222 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1182 transitions. [2022-09-20 20:35:18,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1182 transitions. [2022-09-20 20:35:18,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:35:18,223 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1182 transitions. [2022-09-20 20:35:18,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 118.2) internal successors, (1182), 10 states have internal predecessors, (1182), 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) [2022-09-20 20:35:18,227 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 135.0) internal successors, (1485), 11 states have internal predecessors, (1485), 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) [2022-09-20 20:35:18,227 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 135.0) internal successors, (1485), 11 states have internal predecessors, (1485), 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) [2022-09-20 20:35:18,228 INFO L175 Difference]: Start difference. First operand has 190 places, 161 transitions, 1064 flow. Second operand 10 states and 1182 transitions. [2022-09-20 20:35:18,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 383 transitions, 4546 flow [2022-09-20 20:35:18,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 383 transitions, 4303 flow, removed 102 selfloop flow, removed 10 redundant places. [2022-09-20 20:35:18,449 INFO L231 Difference]: Finished difference. Result has 189 places, 179 transitions, 1160 flow [2022-09-20 20:35:18,449 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=1017, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1160, PETRI_PLACES=189, PETRI_TRANSITIONS=179} [2022-09-20 20:35:18,450 INFO L287 CegarLoopForPetriNet]: 142 programPoint places, 47 predicate places. [2022-09-20 20:35:18,450 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 179 transitions, 1160 flow [2022-09-20 20:35:18,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.5) internal successors, (669), 6 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) [2022-09-20 20:35:18,450 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:35:18,451 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:35:18,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-09-20 20:35:18,451 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:35:18,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:35:18,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1370226718, now seen corresponding path program 1 times [2022-09-20 20:35:18,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:35:18,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851656882] [2022-09-20 20:35:18,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:35:18,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:35:18,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:35:18,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:35:18,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:35:18,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851656882] [2022-09-20 20:35:18,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851656882] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:35:18,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:35:18,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 20:35:18,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120391739] [2022-09-20 20:35:18,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:35:18,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 20:35:18,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:35:18,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 20:35:18,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-09-20 20:35:18,557 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 135 [2022-09-20 20:35:18,558 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 179 transitions, 1160 flow. Second operand has 7 states, 7 states have (on average 111.28571428571429) internal successors, (779), 7 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) [2022-09-20 20:35:18,558 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:35:18,558 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 135 [2022-09-20 20:35:18,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:35:20,942 INFO L130 PetriNetUnfolder]: 7295/13839 cut-off events. [2022-09-20 20:35:20,942 INFO L131 PetriNetUnfolder]: For 175947/181642 co-relation queries the response was YES. [2022-09-20 20:35:21,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72252 conditions, 13839 events. 7295/13839 cut-off events. For 175947/181642 co-relation queries the response was YES. Maximal size of possible extension queue 1018. Compared 123879 event pairs, 219 based on Foata normal form. 1251/14674 useless extension candidates. Maximal degree in co-relation 72151. Up to 3386 conditions per place. [2022-09-20 20:35:21,091 INFO L137 encePairwiseOnDemand]: 124/135 looper letters, 280 selfloop transitions, 38 changer transitions 33/450 dead transitions. [2022-09-20 20:35:21,092 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 450 transitions, 5576 flow [2022-09-20 20:35:21,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-09-20 20:35:21,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-09-20 20:35:21,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1540 transitions. [2022-09-20 20:35:21,095 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8774928774928775 [2022-09-20 20:35:21,095 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1540 transitions. [2022-09-20 20:35:21,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1540 transitions. [2022-09-20 20:35:21,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:35:21,096 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1540 transitions. [2022-09-20 20:35:21,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 118.46153846153847) internal successors, (1540), 13 states have internal predecessors, (1540), 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) [2022-09-20 20:35:21,100 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 135.0) internal successors, (1890), 14 states have internal predecessors, (1890), 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) [2022-09-20 20:35:21,100 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 135.0) internal successors, (1890), 14 states have internal predecessors, (1890), 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) [2022-09-20 20:35:21,100 INFO L175 Difference]: Start difference. First operand has 189 places, 179 transitions, 1160 flow. Second operand 13 states and 1540 transitions. [2022-09-20 20:35:21,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 450 transitions, 5576 flow [2022-09-20 20:35:21,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 450 transitions, 5574 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-09-20 20:35:21,254 INFO L231 Difference]: Finished difference. Result has 206 places, 193 transitions, 1395 flow [2022-09-20 20:35:21,254 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=1102, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1395, PETRI_PLACES=206, PETRI_TRANSITIONS=193} [2022-09-20 20:35:21,254 INFO L287 CegarLoopForPetriNet]: 142 programPoint places, 64 predicate places. [2022-09-20 20:35:21,255 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 193 transitions, 1395 flow [2022-09-20 20:35:21,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.28571428571429) internal successors, (779), 7 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) [2022-09-20 20:35:21,255 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:35:21,255 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:35:21,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-09-20 20:35:21,256 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:35:21,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:35:21,256 INFO L85 PathProgramCache]: Analyzing trace with hash -6616287, now seen corresponding path program 1 times [2022-09-20 20:35:21,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:35:21,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699817165] [2022-09-20 20:35:21,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:35:21,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:35:21,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:35:21,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:35:21,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:35:21,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699817165] [2022-09-20 20:35:21,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699817165] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:35:21,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:35:21,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 20:35:21,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019959691] [2022-09-20 20:35:21,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:35:21,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 20:35:21,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:35:21,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 20:35:21,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 20:35:21,351 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 135 [2022-09-20 20:35:21,352 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 193 transitions, 1395 flow. Second operand has 6 states, 6 states have (on average 114.5) internal successors, (687), 6 states have internal predecessors, (687), 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) [2022-09-20 20:35:21,352 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:35:21,353 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 135 [2022-09-20 20:35:21,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:35:23,019 INFO L130 PetriNetUnfolder]: 2621/8950 cut-off events. [2022-09-20 20:35:23,019 INFO L131 PetriNetUnfolder]: For 63177/74798 co-relation queries the response was YES. [2022-09-20 20:35:23,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39075 conditions, 8950 events. 2621/8950 cut-off events. For 63177/74798 co-relation queries the response was YES. Maximal size of possible extension queue 947. Compared 107371 event pairs, 283 based on Foata normal form. 274/8554 useless extension candidates. Maximal degree in co-relation 38966. Up to 2403 conditions per place. [2022-09-20 20:35:23,114 INFO L137 encePairwiseOnDemand]: 129/135 looper letters, 97 selfloop transitions, 11 changer transitions 50/297 dead transitions. [2022-09-20 20:35:23,114 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 297 transitions, 3419 flow [2022-09-20 20:35:23,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-09-20 20:35:23,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-09-20 20:35:23,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1069 transitions. [2022-09-20 20:35:23,116 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8798353909465021 [2022-09-20 20:35:23,116 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1069 transitions. [2022-09-20 20:35:23,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1069 transitions. [2022-09-20 20:35:23,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:35:23,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1069 transitions. [2022-09-20 20:35:23,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 118.77777777777777) internal successors, (1069), 9 states have internal predecessors, (1069), 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) [2022-09-20 20:35:23,120 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 135.0) internal successors, (1350), 10 states have internal predecessors, (1350), 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) [2022-09-20 20:35:23,120 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 135.0) internal successors, (1350), 10 states have internal predecessors, (1350), 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) [2022-09-20 20:35:23,120 INFO L175 Difference]: Start difference. First operand has 206 places, 193 transitions, 1395 flow. Second operand 9 states and 1069 transitions. [2022-09-20 20:35:23,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 297 transitions, 3419 flow [2022-09-20 20:35:23,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 297 transitions, 3316 flow, removed 42 selfloop flow, removed 4 redundant places. [2022-09-20 20:35:23,438 INFO L231 Difference]: Finished difference. Result has 217 places, 201 transitions, 1445 flow [2022-09-20 20:35:23,439 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=1298, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1445, PETRI_PLACES=217, PETRI_TRANSITIONS=201} [2022-09-20 20:35:23,439 INFO L287 CegarLoopForPetriNet]: 142 programPoint places, 75 predicate places. [2022-09-20 20:35:23,439 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 201 transitions, 1445 flow [2022-09-20 20:35:23,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.5) internal successors, (687), 6 states have internal predecessors, (687), 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) [2022-09-20 20:35:23,440 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:35:23,440 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:35:23,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-09-20 20:35:23,440 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:35:23,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:35:23,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1192076930, now seen corresponding path program 1 times [2022-09-20 20:35:23,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:35:23,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841947473] [2022-09-20 20:35:23,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:35:23,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:35:23,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:35:23,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:35:23,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:35:23,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841947473] [2022-09-20 20:35:23,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841947473] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:35:23,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:35:23,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-09-20 20:35:23,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097751649] [2022-09-20 20:35:23,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:35:23,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-09-20 20:35:23,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:35:23,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-09-20 20:35:23,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-09-20 20:35:23,535 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 135 [2022-09-20 20:35:23,536 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 201 transitions, 1445 flow. Second operand has 8 states, 8 states have (on average 111.25) internal successors, (890), 8 states have internal predecessors, (890), 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) [2022-09-20 20:35:23,536 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:35:23,536 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 135 [2022-09-20 20:35:23,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:35:27,205 INFO L130 PetriNetUnfolder]: 10415/19752 cut-off events. [2022-09-20 20:35:27,205 INFO L131 PetriNetUnfolder]: For 270784/279047 co-relation queries the response was YES. [2022-09-20 20:35:27,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107656 conditions, 19752 events. 10415/19752 cut-off events. For 270784/279047 co-relation queries the response was YES. Maximal size of possible extension queue 1608. Compared 193581 event pairs, 192 based on Foata normal form. 1775/20869 useless extension candidates. Maximal degree in co-relation 107541. Up to 4486 conditions per place. [2022-09-20 20:35:27,389 INFO L137 encePairwiseOnDemand]: 124/135 looper letters, 153 selfloop transitions, 36 changer transitions 192/480 dead transitions. [2022-09-20 20:35:27,389 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 480 transitions, 6225 flow [2022-09-20 20:35:27,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-09-20 20:35:27,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-09-20 20:35:27,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1897 transitions. [2022-09-20 20:35:27,392 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8782407407407408 [2022-09-20 20:35:27,392 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1897 transitions. [2022-09-20 20:35:27,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1897 transitions. [2022-09-20 20:35:27,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:35:27,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1897 transitions. [2022-09-20 20:35:27,395 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 118.5625) internal successors, (1897), 16 states have internal predecessors, (1897), 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) [2022-09-20 20:35:27,397 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 135.0) internal successors, (2295), 17 states have internal predecessors, (2295), 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) [2022-09-20 20:35:27,397 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 135.0) internal successors, (2295), 17 states have internal predecessors, (2295), 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) [2022-09-20 20:35:27,398 INFO L175 Difference]: Start difference. First operand has 217 places, 201 transitions, 1445 flow. Second operand 16 states and 1897 transitions. [2022-09-20 20:35:27,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 480 transitions, 6225 flow [2022-09-20 20:35:28,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 480 transitions, 5835 flow, removed 55 selfloop flow, removed 9 redundant places. [2022-09-20 20:35:28,018 INFO L231 Difference]: Finished difference. Result has 229 places, 183 transitions, 1339 flow [2022-09-20 20:35:28,019 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=1210, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1339, PETRI_PLACES=229, PETRI_TRANSITIONS=183} [2022-09-20 20:35:28,019 INFO L287 CegarLoopForPetriNet]: 142 programPoint places, 87 predicate places. [2022-09-20 20:35:28,019 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 183 transitions, 1339 flow [2022-09-20 20:35:28,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 111.25) internal successors, (890), 8 states have internal predecessors, (890), 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) [2022-09-20 20:35:28,019 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:35:28,020 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:35:28,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-09-20 20:35:28,020 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:35:28,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:35:28,020 INFO L85 PathProgramCache]: Analyzing trace with hash -490131440, now seen corresponding path program 1 times [2022-09-20 20:35:28,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:35:28,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705551452] [2022-09-20 20:35:28,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:35:28,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:35:28,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:35:28,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:35:28,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:35:28,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705551452] [2022-09-20 20:35:28,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705551452] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:35:28,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:35:28,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-09-20 20:35:28,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126258294] [2022-09-20 20:35:28,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:35:28,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-09-20 20:35:28,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:35:28,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-09-20 20:35:28,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-09-20 20:35:28,130 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 135 [2022-09-20 20:35:28,131 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 183 transitions, 1339 flow. Second operand has 9 states, 9 states have (on average 111.22222222222223) internal successors, (1001), 9 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) [2022-09-20 20:35:28,131 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:35:28,131 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 135 [2022-09-20 20:35:28,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:35:30,587 INFO L130 PetriNetUnfolder]: 5914/12661 cut-off events. [2022-09-20 20:35:30,588 INFO L131 PetriNetUnfolder]: For 166823/169674 co-relation queries the response was YES. [2022-09-20 20:35:30,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71842 conditions, 12661 events. 5914/12661 cut-off events. For 166823/169674 co-relation queries the response was YES. Maximal size of possible extension queue 1069. Compared 129542 event pairs, 73 based on Foata normal form. 689/12939 useless extension candidates. Maximal degree in co-relation 71780. Up to 2912 conditions per place. [2022-09-20 20:35:30,689 INFO L137 encePairwiseOnDemand]: 124/135 looper letters, 156 selfloop transitions, 41 changer transitions 84/380 dead transitions. [2022-09-20 20:35:30,689 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 380 transitions, 4545 flow [2022-09-20 20:35:30,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-09-20 20:35:30,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-09-20 20:35:30,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1971 transitions. [2022-09-20 20:35:30,692 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8588235294117647 [2022-09-20 20:35:30,692 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1971 transitions. [2022-09-20 20:35:30,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1971 transitions. [2022-09-20 20:35:30,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:35:30,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1971 transitions. [2022-09-20 20:35:30,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 115.94117647058823) internal successors, (1971), 17 states have internal predecessors, (1971), 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) [2022-09-20 20:35:30,697 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 135.0) internal successors, (2430), 18 states have internal predecessors, (2430), 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) [2022-09-20 20:35:30,698 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 135.0) internal successors, (2430), 18 states have internal predecessors, (2430), 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) [2022-09-20 20:35:30,698 INFO L175 Difference]: Start difference. First operand has 229 places, 183 transitions, 1339 flow. Second operand 17 states and 1971 transitions. [2022-09-20 20:35:30,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 380 transitions, 4545 flow [2022-09-20 20:35:31,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 380 transitions, 3712 flow, removed 333 selfloop flow, removed 25 redundant places. [2022-09-20 20:35:31,602 INFO L231 Difference]: Finished difference. Result has 215 places, 182 transitions, 1104 flow [2022-09-20 20:35:31,603 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=998, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1104, PETRI_PLACES=215, PETRI_TRANSITIONS=182} [2022-09-20 20:35:31,603 INFO L287 CegarLoopForPetriNet]: 142 programPoint places, 73 predicate places. [2022-09-20 20:35:31,603 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 182 transitions, 1104 flow [2022-09-20 20:35:31,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 111.22222222222223) internal successors, (1001), 9 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) [2022-09-20 20:35:31,603 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:35:31,603 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:35:31,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-09-20 20:35:31,604 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:35:31,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:35:31,604 INFO L85 PathProgramCache]: Analyzing trace with hash -799199360, now seen corresponding path program 1 times [2022-09-20 20:35:31,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:35:31,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653185896] [2022-09-20 20:35:31,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:35:31,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:35:31,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:35:31,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:35:31,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:35:31,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653185896] [2022-09-20 20:35:31,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653185896] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:35:31,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:35:31,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 20:35:31,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965581880] [2022-09-20 20:35:31,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:35:31,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 20:35:31,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:35:31,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 20:35:31,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-09-20 20:35:31,704 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 135 [2022-09-20 20:35:31,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 182 transitions, 1104 flow. Second operand has 7 states, 7 states have (on average 113.71428571428571) internal successors, (796), 7 states have internal predecessors, (796), 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) [2022-09-20 20:35:31,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:35:31,705 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 135 [2022-09-20 20:35:31,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:35:33,135 INFO L130 PetriNetUnfolder]: 2622/10279 cut-off events. [2022-09-20 20:35:33,135 INFO L131 PetriNetUnfolder]: For 33193/35723 co-relation queries the response was YES. [2022-09-20 20:35:33,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35584 conditions, 10279 events. 2622/10279 cut-off events. For 33193/35723 co-relation queries the response was YES. Maximal size of possible extension queue 1382. Compared 142097 event pairs, 44 based on Foata normal form. 45/9518 useless extension candidates. Maximal degree in co-relation 35477. Up to 1364 conditions per place. [2022-09-20 20:35:33,244 INFO L137 encePairwiseOnDemand]: 129/135 looper letters, 47 selfloop transitions, 1 changer transitions 51/241 dead transitions. [2022-09-20 20:35:33,244 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 241 transitions, 1872 flow [2022-09-20 20:35:33,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-20 20:35:33,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-09-20 20:35:33,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 814 transitions. [2022-09-20 20:35:33,246 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8613756613756614 [2022-09-20 20:35:33,246 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 814 transitions. [2022-09-20 20:35:33,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 814 transitions. [2022-09-20 20:35:33,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:35:33,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 814 transitions. [2022-09-20 20:35:33,247 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 116.28571428571429) internal successors, (814), 7 states have internal predecessors, (814), 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) [2022-09-20 20:35:33,249 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 135.0) internal successors, (1080), 8 states have internal predecessors, (1080), 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) [2022-09-20 20:35:33,249 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 135.0) internal successors, (1080), 8 states have internal predecessors, (1080), 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) [2022-09-20 20:35:33,249 INFO L175 Difference]: Start difference. First operand has 215 places, 182 transitions, 1104 flow. Second operand 7 states and 814 transitions. [2022-09-20 20:35:33,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 241 transitions, 1872 flow [2022-09-20 20:35:33,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 241 transitions, 1550 flow, removed 112 selfloop flow, removed 23 redundant places. [2022-09-20 20:35:33,893 INFO L231 Difference]: Finished difference. Result has 200 places, 182 transitions, 911 flow [2022-09-20 20:35:33,893 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=898, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=911, PETRI_PLACES=200, PETRI_TRANSITIONS=182} [2022-09-20 20:35:33,894 INFO L287 CegarLoopForPetriNet]: 142 programPoint places, 58 predicate places. [2022-09-20 20:35:33,894 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 182 transitions, 911 flow [2022-09-20 20:35:33,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.71428571428571) internal successors, (796), 7 states have internal predecessors, (796), 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) [2022-09-20 20:35:33,894 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:35:33,894 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:35:33,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-09-20 20:35:33,894 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:35:33,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:35:33,895 INFO L85 PathProgramCache]: Analyzing trace with hash 555635160, now seen corresponding path program 2 times [2022-09-20 20:35:33,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:35:33,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544217813] [2022-09-20 20:35:33,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:35:33,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:35:33,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:35:34,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:35:34,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:35:34,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544217813] [2022-09-20 20:35:34,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544217813] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:35:34,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:35:34,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 20:35:34,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012789101] [2022-09-20 20:35:34,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:35:34,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 20:35:34,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:35:34,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 20:35:34,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 20:35:34,003 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 135 [2022-09-20 20:35:34,004 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 182 transitions, 911 flow. Second operand has 6 states, 6 states have (on average 114.16666666666667) internal successors, (685), 6 states have internal predecessors, (685), 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) [2022-09-20 20:35:34,004 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:35:34,004 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 135 [2022-09-20 20:35:34,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:35:35,154 INFO L130 PetriNetUnfolder]: 2367/9220 cut-off events. [2022-09-20 20:35:35,154 INFO L131 PetriNetUnfolder]: For 12892/13434 co-relation queries the response was YES. [2022-09-20 20:35:35,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24809 conditions, 9220 events. 2367/9220 cut-off events. For 12892/13434 co-relation queries the response was YES. Maximal size of possible extension queue 1169. Compared 125321 event pairs, 45 based on Foata normal form. 35/8506 useless extension candidates. Maximal degree in co-relation 24772. Up to 1105 conditions per place. [2022-09-20 20:35:35,204 INFO L137 encePairwiseOnDemand]: 129/135 looper letters, 27 selfloop transitions, 2 changer transitions 41/207 dead transitions. [2022-09-20 20:35:35,204 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 207 transitions, 1223 flow [2022-09-20 20:35:35,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-09-20 20:35:35,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-09-20 20:35:35,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 697 transitions. [2022-09-20 20:35:35,205 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8604938271604938 [2022-09-20 20:35:35,205 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 697 transitions. [2022-09-20 20:35:35,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 697 transitions. [2022-09-20 20:35:35,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:35:35,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 697 transitions. [2022-09-20 20:35:35,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 116.16666666666667) internal successors, (697), 6 states have internal predecessors, (697), 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) [2022-09-20 20:35:35,207 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 135.0) internal successors, (945), 7 states have internal predecessors, (945), 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) [2022-09-20 20:35:35,207 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 135.0) internal successors, (945), 7 states have internal predecessors, (945), 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) [2022-09-20 20:35:35,207 INFO L175 Difference]: Start difference. First operand has 200 places, 182 transitions, 911 flow. Second operand 6 states and 697 transitions. [2022-09-20 20:35:35,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 207 transitions, 1223 flow [2022-09-20 20:35:35,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 207 transitions, 1208 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-09-20 20:35:35,483 INFO L231 Difference]: Finished difference. Result has 200 places, 163 transitions, 757 flow [2022-09-20 20:35:35,483 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=757, PETRI_PLACES=200, PETRI_TRANSITIONS=163} [2022-09-20 20:35:35,484 INFO L287 CegarLoopForPetriNet]: 142 programPoint places, 58 predicate places. [2022-09-20 20:35:35,484 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 163 transitions, 757 flow [2022-09-20 20:35:35,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.16666666666667) internal successors, (685), 6 states have internal predecessors, (685), 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) [2022-09-20 20:35:35,484 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:35:35,484 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:35:35,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-09-20 20:35:35,484 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 20:35:35,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:35:35,485 INFO L85 PathProgramCache]: Analyzing trace with hash -139203650, now seen corresponding path program 3 times [2022-09-20 20:35:35,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:35:35,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341044836] [2022-09-20 20:35:35,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:35:35,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:35:35,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-20 20:35:35,536 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-20 20:35:35,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-20 20:35:35,638 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-20 20:35:35,638 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-09-20 20:35:35,641 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-09-20 20:35:35,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-09-20 20:35:35,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-09-20 20:35:35,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-09-20 20:35:35,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-09-20 20:35:35,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-09-20 20:35:35,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-09-20 20:35:35,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-09-20 20:35:35,645 INFO L444 BasicCegarLoop]: Path program histogram: [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:35:35,650 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-09-20 20:35:35,650 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-09-20 20:35:35,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 08:35:35 BasicIcfg [2022-09-20 20:35:35,835 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-09-20 20:35:35,836 INFO L158 Benchmark]: Toolchain (without parser) took 34463.54ms. Allocated memory was 181.4MB in the beginning and 5.6GB in the end (delta: 5.4GB). Free memory was 151.0MB in the beginning and 4.2GB in the end (delta: -4.1GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2022-09-20 20:35:35,836 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 181.4MB. Free memory is still 138.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-09-20 20:35:35,837 INFO L158 Benchmark]: CACSL2BoogieTranslator took 438.60ms. Allocated memory was 181.4MB in the beginning and 263.2MB in the end (delta: 81.8MB). Free memory was 151.0MB in the beginning and 218.6MB in the end (delta: -67.6MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-09-20 20:35:35,837 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.70ms. Allocated memory is still 263.2MB. Free memory was 218.6MB in the beginning and 215.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-09-20 20:35:35,837 INFO L158 Benchmark]: Boogie Preprocessor took 52.76ms. Allocated memory is still 263.2MB. Free memory was 215.5MB in the beginning and 213.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-09-20 20:35:35,837 INFO L158 Benchmark]: RCFGBuilder took 1078.50ms. Allocated memory is still 263.2MB. Free memory was 213.4MB in the beginning and 134.2MB in the end (delta: 79.2MB). Peak memory consumption was 77.6MB. Max. memory is 8.0GB. [2022-09-20 20:35:35,838 INFO L158 Benchmark]: TraceAbstraction took 32802.24ms. Allocated memory was 263.2MB in the beginning and 5.6GB in the end (delta: 5.3GB). Free memory was 133.2MB in the beginning and 4.2GB in the end (delta: -4.1GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2022-09-20 20:35:35,839 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.14ms. Allocated memory is still 181.4MB. Free memory is still 138.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 438.60ms. Allocated memory was 181.4MB in the beginning and 263.2MB in the end (delta: 81.8MB). Free memory was 151.0MB in the beginning and 218.6MB in the end (delta: -67.6MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 84.70ms. Allocated memory is still 263.2MB. Free memory was 218.6MB in the beginning and 215.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.76ms. Allocated memory is still 263.2MB. Free memory was 215.5MB in the beginning and 213.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1078.50ms. Allocated memory is still 263.2MB. Free memory was 213.4MB in the beginning and 134.2MB in the end (delta: 79.2MB). Peak memory consumption was 77.6MB. Max. memory is 8.0GB. * TraceAbstraction took 32802.24ms. Allocated memory was 263.2MB in the beginning and 5.6GB in the end (delta: 5.3GB). Free memory was 133.2MB in the beginning and 4.2GB in the end (delta: -4.1GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0] [L714] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L716] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L717] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0] [L718] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L720] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L722] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L723] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L724] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L725] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L726] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L727] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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] [L728] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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] [L729] 0 _Bool y$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0] [L730] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0, y$r_buff1_thd0=0] [L731] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L732] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L733] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L734] 0 _Bool y$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0] [L735] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0] [L736] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L737] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L738] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L739] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L740] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L742] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L743] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L744] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L844] 0 pthread_t t805; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t805={5: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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L845] FCALL, FORK 0 pthread_create(&t805, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t805, ((void *)0), P0, ((void *)0))=-3, t805={5: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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L846] 0 pthread_t t806; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t805={5:0}, t806={6: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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L847] FCALL, FORK 0 pthread_create(&t806, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t806, ((void *)0), P1, ((void *)0))=-2, t805={5:0}, t806={6: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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L848] 0 pthread_t t807; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t805={5:0}, t806={6:0}, t807={7: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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L849] FCALL, FORK 0 pthread_create(&t807, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t807, ((void *)0), P2, ((void *)0))=-1, t805={5:0}, t806={6:0}, t807={7: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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L850] 0 pthread_t t808; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t805={5:0}, t806={6:0}, t807={7:0}, t808={3: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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L851] FCALL, FORK 0 pthread_create(&t808, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t808, ((void *)0), P3, ((void *)0))=0, t805={5:0}, t806={6:0}, t807={7:0}, t808={3: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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L783] 3 y$w_buff1 = y$w_buff0 [L784] 3 y$w_buff0 = 2 [L785] 3 y$w_buff1_used = y$w_buff0_used [L786] 3 y$w_buff0_used = (_Bool)1 [L787] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L787] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L788] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L789] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L790] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L791] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L792] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L793] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0: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=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L796] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0: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=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L813] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L816] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L819] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L763] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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=2, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L766] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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=2, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L769] 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) [L769] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L769] 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) [L769] 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) [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] 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 [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L773] 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 [L799] 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) [L799] 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) [L800] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L800] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L801] 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 [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L802] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L803] 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 [L822] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L822] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L822] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L822] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L823] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L823] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L824] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L824] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L825] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L825] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L826] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L826] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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=2, y=2, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L776] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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=2, y=2, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L806] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0: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=2, y=2, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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=2, y=2, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t805={5:0}, t806={6:0}, t807={7:0}, t808={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 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) [L857] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L857] 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) [L857] 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) [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L858] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L859] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L859] 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 [L860] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L860] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L861] 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 [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 y$flush_delayed = weak$$choice2 [L867] 0 y$mem_tmp = y [L868] 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) [L868] 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) [L869] 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)) [L869] 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)) [L870] 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)) [L870] 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)) [L871] 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)) [L871] 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)) [L872] 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)) [L872] 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)) [L873] 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)) [L873] 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)) [L874] 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)) [L874] 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)) [L875] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L876] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L876] 0 y = y$flush_delayed ? y$mem_tmp : y [L877] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t805={5:0}, t806={6:0}, t807={7:0}, t808={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L879] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 845]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 171 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 32.5s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 28.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1308 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1308 mSDsluCounter, 990 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1856 mSDsCounter, 483 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3269 IncrementalHoareTripleChecker+Invalid, 3752 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 483 mSolverCounterUnsat, 195 mSDtfsCounter, 3269 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 327 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 279 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1445occurred in iteration=18, InterpolantAutomatonStates: 254, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 2119 NumberOfCodeBlocks, 2119 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1993 ConstructedInterpolants, 0 QuantifiedInterpolants, 10373 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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! [2022-09-20 20:35:35,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...