/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/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-?-0612a5f-m [2022-09-20 20:40:43,153 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-20 20:40:43,155 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-20 20:40:43,182 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-20 20:40:43,183 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-20 20:40:43,184 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-20 20:40:43,185 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-20 20:40:43,187 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-20 20:40:43,198 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-20 20:40:43,203 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-20 20:40:43,204 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-20 20:40:43,205 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-20 20:40:43,205 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-20 20:40:43,206 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-20 20:40:43,207 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-20 20:40:43,207 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-20 20:40:43,208 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-20 20:40:43,209 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-20 20:40:43,210 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-20 20:40:43,211 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-20 20:40:43,213 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-20 20:40:43,218 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-20 20:40:43,223 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-20 20:40:43,225 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-20 20:40:43,234 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-20 20:40:43,234 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-20 20:40:43,235 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-20 20:40:43,235 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-20 20:40:43,236 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-20 20:40:43,236 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-20 20:40:43,236 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-20 20:40:43,237 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-20 20:40:43,238 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-20 20:40:43,238 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-20 20:40:43,239 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-20 20:40:43,239 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-20 20:40:43,240 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-20 20:40:43,240 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-20 20:40:43,240 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-20 20:40:43,241 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-20 20:40:43,241 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-20 20:40:43,251 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:40:43,283 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-20 20:40:43,283 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-20 20:40:43,285 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-20 20:40:43,285 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-20 20:40:43,285 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-20 20:40:43,285 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-20 20:40:43,286 INFO L138 SettingsManager]: * Use SBE=true [2022-09-20 20:40:43,286 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-20 20:40:43,286 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-20 20:40:43,286 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-20 20:40:43,287 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-20 20:40:43,287 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-20 20:40:43,287 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-20 20:40:43,287 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-20 20:40:43,287 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-20 20:40:43,287 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-20 20:40:43,288 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-20 20:40:43,288 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-20 20:40:43,288 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-20 20:40:43,288 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-20 20:40:43,288 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-20 20:40:43,288 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-20 20:40:43,288 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-20 20:40:43,288 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 20:40:43,289 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-20 20:40:43,289 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-20 20:40:43,289 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-20 20:40:43,289 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-20 20:40:43,289 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-20 20:40:43,289 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-20 20:40:43,289 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-09-20 20:40:43,289 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:40:43,531 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-20 20:40:43,549 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-20 20:40:43,551 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-20 20:40:43,552 INFO L271 PluginConnector]: Initializing CDTParser... [2022-09-20 20:40:43,552 INFO L275 PluginConnector]: CDTParser initialized [2022-09-20 20:40:43,553 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2022-09-20 20:40:43,606 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8256807e7/509793ff2cdf49f7b3f3819fe1307dfe/FLAGc0cfbdbe9 [2022-09-20 20:40:44,013 INFO L306 CDTParser]: Found 1 translation units. [2022-09-20 20:40:44,014 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2022-09-20 20:40:44,029 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8256807e7/509793ff2cdf49f7b3f3819fe1307dfe/FLAGc0cfbdbe9 [2022-09-20 20:40:44,384 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8256807e7/509793ff2cdf49f7b3f3819fe1307dfe [2022-09-20 20:40:44,386 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-20 20:40:44,388 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-09-20 20:40:44,389 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-09-20 20:40:44,389 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-09-20 20:40:44,393 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-09-20 20:40:44,394 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 08:40:44" (1/1) ... [2022-09-20 20:40:44,395 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1329a45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:40:44, skipping insertion in model container [2022-09-20 20:40:44,395 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 08:40:44" (1/1) ... [2022-09-20 20:40:44,400 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-09-20 20:40:44,439 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-09-20 20:40:44,640 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/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i[978,991] [2022-09-20 20:40:44,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 20:40:44,882 INFO L203 MainTranslator]: Completed pre-run [2022-09-20 20:40:44,899 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/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i[978,991] [2022-09-20 20:40:44,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 20:40:45,001 INFO L208 MainTranslator]: Completed translation [2022-09-20 20:40:45,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:40:45 WrapperNode [2022-09-20 20:40:45,002 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-09-20 20:40:45,004 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-20 20:40:45,004 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-20 20:40:45,004 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-20 20:40:45,010 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:40:45" (1/1) ... [2022-09-20 20:40:45,030 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:40:45" (1/1) ... [2022-09-20 20:40:45,076 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 274 [2022-09-20 20:40:45,077 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-20 20:40:45,077 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-20 20:40:45,077 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-20 20:40:45,077 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-20 20:40:45,084 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:40:45" (1/1) ... [2022-09-20 20:40:45,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:40:45" (1/1) ... [2022-09-20 20:40:45,088 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:40:45" (1/1) ... [2022-09-20 20:40:45,088 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:40:45" (1/1) ... [2022-09-20 20:40:45,096 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:40:45" (1/1) ... [2022-09-20 20:40:45,099 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:40:45" (1/1) ... [2022-09-20 20:40:45,102 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:40:45" (1/1) ... [2022-09-20 20:40:45,105 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-20 20:40:45,106 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-20 20:40:45,106 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-20 20:40:45,106 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-20 20:40:45,107 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:40:45" (1/1) ... [2022-09-20 20:40:45,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 20:40:45,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 20:40:45,135 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:40:45,165 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:40:45,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-09-20 20:40:45,183 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-09-20 20:40:45,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-09-20 20:40:45,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-09-20 20:40:45,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-09-20 20:40:45,183 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-09-20 20:40:45,183 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-09-20 20:40:45,183 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-09-20 20:40:45,184 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-09-20 20:40:45,184 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-09-20 20:40:45,184 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-09-20 20:40:45,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-09-20 20:40:45,184 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-09-20 20:40:45,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-20 20:40:45,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-20 20:40:45,186 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:40:45,344 INFO L234 CfgBuilder]: Building ICFG [2022-09-20 20:40:45,345 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-20 20:40:45,739 INFO L275 CfgBuilder]: Performing block encoding [2022-09-20 20:40:46,036 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-20 20:40:46,036 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-09-20 20:40:46,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 08:40:46 BoogieIcfgContainer [2022-09-20 20:40:46,038 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-20 20:40:46,041 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-20 20:40:46,041 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-20 20:40:46,044 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-20 20:40:46,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 08:40:44" (1/3) ... [2022-09-20 20:40:46,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e9f738b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 08:40:46, skipping insertion in model container [2022-09-20 20:40:46,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:40:45" (2/3) ... [2022-09-20 20:40:46,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e9f738b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 08:40:46, skipping insertion in model container [2022-09-20 20:40:46,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 08:40:46" (3/3) ... [2022-09-20 20:40:46,047 INFO L112 eAbstractionObserver]: Analyzing ICFG safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2022-09-20 20:40:46,065 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-20 20:40:46,065 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-09-20 20:40:46,065 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-20 20:40:46,115 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-09-20 20:40:46,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 243 flow [2022-09-20 20:40:46,217 INFO L130 PetriNetUnfolder]: 2/111 cut-off events. [2022-09-20 20:40:46,217 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-09-20 20:40:46,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-09-20 20:40:46,222 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 114 transitions, 243 flow [2022-09-20 20:40:46,226 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 111 transitions, 231 flow [2022-09-20 20:40:46,237 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-09-20 20:40:46,243 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;@31625ce5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-20 20:40:46,244 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-09-20 20:40:46,252 INFO L130 PetriNetUnfolder]: 0/45 cut-off events. [2022-09-20 20:40:46,252 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-09-20 20:40:46,253 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:40:46,253 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] [2022-09-20 20:40:46,254 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 20:40:46,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:40:46,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1654950207, now seen corresponding path program 1 times [2022-09-20 20:40:46,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:40:46,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194598915] [2022-09-20 20:40:46,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:40:46,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:40:46,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:40:46,598 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:40:46,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:40:46,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194598915] [2022-09-20 20:40:46,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194598915] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:40:46,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:40:46,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-20 20:40:46,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563699844] [2022-09-20 20:40:46,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:40:46,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-20 20:40:46,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:40:46,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-20 20:40:46,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-20 20:40:46,646 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 114 [2022-09-20 20:40:46,653 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 111 transitions, 231 flow. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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:40:46,653 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:40:46,653 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 114 [2022-09-20 20:40:46,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:40:46,836 INFO L130 PetriNetUnfolder]: 58/326 cut-off events. [2022-09-20 20:40:46,837 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-09-20 20:40:46,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 455 conditions, 326 events. 58/326 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1342 event pairs, 10 based on Foata normal form. 12/321 useless extension candidates. Maximal degree in co-relation 404. Up to 79 conditions per place. [2022-09-20 20:40:46,840 INFO L137 encePairwiseOnDemand]: 109/114 looper letters, 14 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2022-09-20 20:40:46,840 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 113 transitions, 273 flow [2022-09-20 20:40:46,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-20 20:40:46,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-09-20 20:40:46,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2022-09-20 20:40:46,859 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9385964912280702 [2022-09-20 20:40:46,860 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 321 transitions. [2022-09-20 20:40:46,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 321 transitions. [2022-09-20 20:40:46,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:40:46,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 321 transitions. [2022-09-20 20:40:46,873 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 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:40:46,881 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 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:40:46,882 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 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:40:46,883 INFO L175 Difference]: Start difference. First operand has 119 places, 111 transitions, 231 flow. Second operand 3 states and 321 transitions. [2022-09-20 20:40:46,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 113 transitions, 273 flow [2022-09-20 20:40:46,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 113 transitions, 268 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-09-20 20:40:46,891 INFO L231 Difference]: Finished difference. Result has 116 places, 107 transitions, 224 flow [2022-09-20 20:40:46,893 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=116, PETRI_TRANSITIONS=107} [2022-09-20 20:40:46,897 INFO L287 CegarLoopForPetriNet]: 119 programPoint places, -3 predicate places. [2022-09-20 20:40:46,897 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 107 transitions, 224 flow [2022-09-20 20:40:46,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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:40:46,898 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:40:46,898 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] [2022-09-20 20:40:46,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-20 20:40:46,899 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 20:40:46,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:40:46,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1969702196, now seen corresponding path program 1 times [2022-09-20 20:40:46,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:40:46,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790609196] [2022-09-20 20:40:46,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:40:46,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:40:47,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:40:47,134 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:40:47,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:40:47,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790609196] [2022-09-20 20:40:47,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790609196] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:40:47,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:40:47,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 20:40:47,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839145326] [2022-09-20 20:40:47,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:40:47,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 20:40:47,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:40:47,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 20:40:47,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 20:40:47,142 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 114 [2022-09-20 20:40:47,144 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 107 transitions, 224 flow. Second operand has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 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:40:47,144 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:40:47,144 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 114 [2022-09-20 20:40:47,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:40:47,618 INFO L130 PetriNetUnfolder]: 331/1079 cut-off events. [2022-09-20 20:40:47,621 INFO L131 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2022-09-20 20:40:47,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1712 conditions, 1079 events. 331/1079 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 7288 event pairs, 54 based on Foata normal form. 0/1046 useless extension candidates. Maximal degree in co-relation 1661. Up to 257 conditions per place. [2022-09-20 20:40:47,634 INFO L137 encePairwiseOnDemand]: 108/114 looper letters, 18 selfloop transitions, 2 changer transitions 45/144 dead transitions. [2022-09-20 20:40:47,634 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 144 transitions, 420 flow [2022-09-20 20:40:47,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-09-20 20:40:47,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-09-20 20:40:47,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 893 transitions. [2022-09-20 20:40:47,643 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8703703703703703 [2022-09-20 20:40:47,643 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 893 transitions. [2022-09-20 20:40:47,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 893 transitions. [2022-09-20 20:40:47,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:40:47,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 893 transitions. [2022-09-20 20:40:47,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 99.22222222222223) internal successors, (893), 9 states have internal predecessors, (893), 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:40:47,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 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:40:47,651 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 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:40:47,651 INFO L175 Difference]: Start difference. First operand has 116 places, 107 transitions, 224 flow. Second operand 9 states and 893 transitions. [2022-09-20 20:40:47,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 144 transitions, 420 flow [2022-09-20 20:40:47,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 144 transitions, 402 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-09-20 20:40:47,657 INFO L231 Difference]: Finished difference. Result has 129 places, 95 transitions, 216 flow [2022-09-20 20:40:47,657 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=216, PETRI_PLACES=129, PETRI_TRANSITIONS=95} [2022-09-20 20:40:47,658 INFO L287 CegarLoopForPetriNet]: 119 programPoint places, 10 predicate places. [2022-09-20 20:40:47,658 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 95 transitions, 216 flow [2022-09-20 20:40:47,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 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:40:47,659 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:40:47,659 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] [2022-09-20 20:40:47,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-09-20 20:40:47,659 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 20:40:47,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:40:47,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1559926167, now seen corresponding path program 1 times [2022-09-20 20:40:47,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:40:47,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105781857] [2022-09-20 20:40:47,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:40:47,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:40:47,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:40:47,912 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:40:47,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:40:47,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105781857] [2022-09-20 20:40:47,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105781857] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:40:47,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:40:47,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 20:40:47,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633475042] [2022-09-20 20:40:47,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:40:47,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 20:40:47,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:40:47,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 20:40:47,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-09-20 20:40:47,915 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 114 [2022-09-20 20:40:47,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 95 transitions, 216 flow. Second operand has 7 states, 7 states have (on average 92.85714285714286) internal successors, (650), 7 states have internal predecessors, (650), 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:40:47,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:40:47,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 114 [2022-09-20 20:40:47,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:40:48,293 INFO L130 PetriNetUnfolder]: 356/838 cut-off events. [2022-09-20 20:40:48,294 INFO L131 PetriNetUnfolder]: For 192/192 co-relation queries the response was YES. [2022-09-20 20:40:48,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1666 conditions, 838 events. 356/838 cut-off events. For 192/192 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4670 event pairs, 50 based on Foata normal form. 18/819 useless extension candidates. Maximal degree in co-relation 1607. Up to 225 conditions per place. [2022-09-20 20:40:48,300 INFO L137 encePairwiseOnDemand]: 106/114 looper letters, 22 selfloop transitions, 4 changer transitions 35/138 dead transitions. [2022-09-20 20:40:48,300 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 138 transitions, 449 flow [2022-09-20 20:40:48,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-09-20 20:40:48,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-09-20 20:40:48,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 973 transitions. [2022-09-20 20:40:48,306 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8535087719298246 [2022-09-20 20:40:48,306 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 973 transitions. [2022-09-20 20:40:48,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 973 transitions. [2022-09-20 20:40:48,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:40:48,307 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 973 transitions. [2022-09-20 20:40:48,309 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 97.3) internal successors, (973), 10 states have internal predecessors, (973), 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:40:48,311 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 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:40:48,312 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 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:40:48,312 INFO L175 Difference]: Start difference. First operand has 129 places, 95 transitions, 216 flow. Second operand 10 states and 973 transitions. [2022-09-20 20:40:48,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 138 transitions, 449 flow [2022-09-20 20:40:48,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 138 transitions, 415 flow, removed 14 selfloop flow, removed 8 redundant places. [2022-09-20 20:40:48,319 INFO L231 Difference]: Finished difference. Result has 120 places, 95 transitions, 230 flow [2022-09-20 20:40:48,319 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=230, PETRI_PLACES=120, PETRI_TRANSITIONS=95} [2022-09-20 20:40:48,321 INFO L287 CegarLoopForPetriNet]: 119 programPoint places, 1 predicate places. [2022-09-20 20:40:48,321 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 95 transitions, 230 flow [2022-09-20 20:40:48,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.85714285714286) internal successors, (650), 7 states have internal predecessors, (650), 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:40:48,322 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:40:48,322 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] [2022-09-20 20:40:48,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-09-20 20:40:48,322 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 20:40:48,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:40:48,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1314771257, now seen corresponding path program 1 times [2022-09-20 20:40:48,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:40:48,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928554275] [2022-09-20 20:40:48,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:40:48,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:40:48,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:40:48,539 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:40:48,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:40:48,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928554275] [2022-09-20 20:40:48,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928554275] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:40:48,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:40:48,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-09-20 20:40:48,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400345050] [2022-09-20 20:40:48,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:40:48,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-09-20 20:40:48,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:40:48,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-09-20 20:40:48,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-09-20 20:40:48,542 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2022-09-20 20:40:48,545 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 95 transitions, 230 flow. Second operand has 10 states, 10 states have (on average 91.4) internal successors, (914), 10 states have internal predecessors, (914), 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:40:48,545 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:40:48,545 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2022-09-20 20:40:48,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:40:49,023 INFO L130 PetriNetUnfolder]: 329/796 cut-off events. [2022-09-20 20:40:49,023 INFO L131 PetriNetUnfolder]: For 285/289 co-relation queries the response was YES. [2022-09-20 20:40:49,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1622 conditions, 796 events. 329/796 cut-off events. For 285/289 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3989 event pairs, 83 based on Foata normal form. 19/794 useless extension candidates. Maximal degree in co-relation 1557. Up to 318 conditions per place. [2022-09-20 20:40:49,028 INFO L137 encePairwiseOnDemand]: 101/114 looper letters, 21 selfloop transitions, 11 changer transitions 43/151 dead transitions. [2022-09-20 20:40:49,029 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 151 transitions, 536 flow [2022-09-20 20:40:49,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-09-20 20:40:49,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-09-20 20:40:49,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1428 transitions. [2022-09-20 20:40:49,033 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8350877192982457 [2022-09-20 20:40:49,033 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1428 transitions. [2022-09-20 20:40:49,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1428 transitions. [2022-09-20 20:40:49,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:40:49,034 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1428 transitions. [2022-09-20 20:40:49,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 95.2) internal successors, (1428), 15 states have internal predecessors, (1428), 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:40:49,041 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 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:40:49,042 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 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:40:49,042 INFO L175 Difference]: Start difference. First operand has 120 places, 95 transitions, 230 flow. Second operand 15 states and 1428 transitions. [2022-09-20 20:40:49,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 151 transitions, 536 flow [2022-09-20 20:40:49,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 151 transitions, 478 flow, removed 24 selfloop flow, removed 10 redundant places. [2022-09-20 20:40:49,048 INFO L231 Difference]: Finished difference. Result has 129 places, 102 transitions, 303 flow [2022-09-20 20:40:49,048 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=303, PETRI_PLACES=129, PETRI_TRANSITIONS=102} [2022-09-20 20:40:49,049 INFO L287 CegarLoopForPetriNet]: 119 programPoint places, 10 predicate places. [2022-09-20 20:40:49,049 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 102 transitions, 303 flow [2022-09-20 20:40:49,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 91.4) internal successors, (914), 10 states have internal predecessors, (914), 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:40:49,050 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:40:49,050 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] [2022-09-20 20:40:49,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-09-20 20:40:49,050 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 20:40:49,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:40:49,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1724413797, now seen corresponding path program 1 times [2022-09-20 20:40:49,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:40:49,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822145222] [2022-09-20 20:40:49,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:40:49,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:40:49,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:40:49,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:40:49,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:40:49,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822145222] [2022-09-20 20:40:49,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822145222] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:40:49,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:40:49,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-09-20 20:40:49,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080749333] [2022-09-20 20:40:49,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:40:49,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-09-20 20:40:49,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:40:49,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-09-20 20:40:49,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-09-20 20:40:49,294 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2022-09-20 20:40:49,295 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 102 transitions, 303 flow. Second operand has 10 states, 10 states have (on average 91.5) internal successors, (915), 10 states have internal predecessors, (915), 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:40:49,295 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:40:49,295 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2022-09-20 20:40:49,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:40:49,670 INFO L130 PetriNetUnfolder]: 238/587 cut-off events. [2022-09-20 20:40:49,670 INFO L131 PetriNetUnfolder]: For 1532/1654 co-relation queries the response was YES. [2022-09-20 20:40:49,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1984 conditions, 587 events. 238/587 cut-off events. For 1532/1654 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2688 event pairs, 32 based on Foata normal form. 19/589 useless extension candidates. Maximal degree in co-relation 1913. Up to 251 conditions per place. [2022-09-20 20:40:49,676 INFO L137 encePairwiseOnDemand]: 105/114 looper letters, 27 selfloop transitions, 6 changer transitions 25/134 dead transitions. [2022-09-20 20:40:49,676 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 134 transitions, 633 flow [2022-09-20 20:40:49,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-09-20 20:40:49,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-09-20 20:40:49,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1135 transitions. [2022-09-20 20:40:49,680 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8296783625730995 [2022-09-20 20:40:49,680 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1135 transitions. [2022-09-20 20:40:49,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1135 transitions. [2022-09-20 20:40:49,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:40:49,681 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1135 transitions. [2022-09-20 20:40:49,683 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 94.58333333333333) internal successors, (1135), 12 states have internal predecessors, (1135), 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:40:49,685 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 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:40:49,686 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 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:40:49,686 INFO L175 Difference]: Start difference. First operand has 129 places, 102 transitions, 303 flow. Second operand 12 states and 1135 transitions. [2022-09-20 20:40:49,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 134 transitions, 633 flow [2022-09-20 20:40:49,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 134 transitions, 607 flow, removed 11 selfloop flow, removed 5 redundant places. [2022-09-20 20:40:49,691 INFO L231 Difference]: Finished difference. Result has 133 places, 102 transitions, 319 flow [2022-09-20 20:40:49,691 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=319, PETRI_PLACES=133, PETRI_TRANSITIONS=102} [2022-09-20 20:40:49,692 INFO L287 CegarLoopForPetriNet]: 119 programPoint places, 14 predicate places. [2022-09-20 20:40:49,692 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 102 transitions, 319 flow [2022-09-20 20:40:49,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 91.5) internal successors, (915), 10 states have internal predecessors, (915), 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:40:49,693 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:40:49,693 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] [2022-09-20 20:40:49,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-09-20 20:40:49,693 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 20:40:49,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:40:49,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1666090413, now seen corresponding path program 1 times [2022-09-20 20:40:49,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:40:49,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688111041] [2022-09-20 20:40:49,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:40:49,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:40:49,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:40:49,926 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:40:49,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:40:49,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688111041] [2022-09-20 20:40:49,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688111041] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:40:49,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:40:49,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-09-20 20:40:49,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144628754] [2022-09-20 20:40:49,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:40:49,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-09-20 20:40:49,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:40:49,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-09-20 20:40:49,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-09-20 20:40:49,930 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 114 [2022-09-20 20:40:49,931 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 102 transitions, 319 flow. Second operand has 10 states, 10 states have (on average 90.6) internal successors, (906), 10 states have internal predecessors, (906), 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:40:49,931 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:40:49,931 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 114 [2022-09-20 20:40:49,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:40:50,262 INFO L130 PetriNetUnfolder]: 229/630 cut-off events. [2022-09-20 20:40:50,262 INFO L131 PetriNetUnfolder]: For 1785/1820 co-relation queries the response was YES. [2022-09-20 20:40:50,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2073 conditions, 630 events. 229/630 cut-off events. For 1785/1820 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2995 event pairs, 70 based on Foata normal form. 17/625 useless extension candidates. Maximal degree in co-relation 1995. Up to 236 conditions per place. [2022-09-20 20:40:50,269 INFO L137 encePairwiseOnDemand]: 101/114 looper letters, 22 selfloop transitions, 13 changer transitions 29/139 dead transitions. [2022-09-20 20:40:50,270 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 139 transitions, 705 flow [2022-09-20 20:40:50,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-09-20 20:40:50,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-09-20 20:40:50,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1219 transitions. [2022-09-20 20:40:50,273 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8225371120107963 [2022-09-20 20:40:50,273 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1219 transitions. [2022-09-20 20:40:50,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1219 transitions. [2022-09-20 20:40:50,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:40:50,274 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1219 transitions. [2022-09-20 20:40:50,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 93.76923076923077) internal successors, (1219), 13 states have internal predecessors, (1219), 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:40:50,279 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 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:40:50,280 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 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:40:50,280 INFO L175 Difference]: Start difference. First operand has 133 places, 102 transitions, 319 flow. Second operand 13 states and 1219 transitions. [2022-09-20 20:40:50,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 139 transitions, 705 flow [2022-09-20 20:40:50,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 139 transitions, 647 flow, removed 24 selfloop flow, removed 13 redundant places. [2022-09-20 20:40:50,286 INFO L231 Difference]: Finished difference. Result has 133 places, 104 transitions, 375 flow [2022-09-20 20:40:50,287 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=375, PETRI_PLACES=133, PETRI_TRANSITIONS=104} [2022-09-20 20:40:50,287 INFO L287 CegarLoopForPetriNet]: 119 programPoint places, 14 predicate places. [2022-09-20 20:40:50,288 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 104 transitions, 375 flow [2022-09-20 20:40:50,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 90.6) internal successors, (906), 10 states have internal predecessors, (906), 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:40:50,288 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:40:50,288 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] [2022-09-20 20:40:50,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-09-20 20:40:50,289 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 20:40:50,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:40:50,289 INFO L85 PathProgramCache]: Analyzing trace with hash -22650765, now seen corresponding path program 1 times [2022-09-20 20:40:50,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:40:50,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842757853] [2022-09-20 20:40:50,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:40:50,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:40:50,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:40:50,521 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:40:50,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:40:50,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842757853] [2022-09-20 20:40:50,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842757853] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:40:50,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:40:50,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-09-20 20:40:50,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085871532] [2022-09-20 20:40:50,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:40:50,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-09-20 20:40:50,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:40:50,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-09-20 20:40:50,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-09-20 20:40:50,524 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 114 [2022-09-20 20:40:50,525 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 104 transitions, 375 flow. Second operand has 12 states, 12 states have (on average 89.5) internal successors, (1074), 12 states have internal predecessors, (1074), 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:40:50,526 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:40:50,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 114 [2022-09-20 20:40:50,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:40:50,883 INFO L130 PetriNetUnfolder]: 163/501 cut-off events. [2022-09-20 20:40:50,883 INFO L131 PetriNetUnfolder]: For 2915/3003 co-relation queries the response was YES. [2022-09-20 20:40:50,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1985 conditions, 501 events. 163/501 cut-off events. For 2915/3003 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2221 event pairs, 74 based on Foata normal form. 14/496 useless extension candidates. Maximal degree in co-relation 1905. Up to 215 conditions per place. [2022-09-20 20:40:50,888 INFO L137 encePairwiseOnDemand]: 102/114 looper letters, 26 selfloop transitions, 13 changer transitions 22/135 dead transitions. [2022-09-20 20:40:50,888 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 135 transitions, 803 flow [2022-09-20 20:40:50,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-09-20 20:40:50,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-09-20 20:40:50,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1289 transitions. [2022-09-20 20:40:50,892 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8076441102756893 [2022-09-20 20:40:50,892 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1289 transitions. [2022-09-20 20:40:50,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1289 transitions. [2022-09-20 20:40:50,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:40:50,893 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1289 transitions. [2022-09-20 20:40:50,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 92.07142857142857) internal successors, (1289), 14 states have internal predecessors, (1289), 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:40:50,899 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 114.0) internal successors, (1710), 15 states have internal predecessors, (1710), 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:40:50,899 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 114.0) internal successors, (1710), 15 states have internal predecessors, (1710), 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:40:50,899 INFO L175 Difference]: Start difference. First operand has 133 places, 104 transitions, 375 flow. Second operand 14 states and 1289 transitions. [2022-09-20 20:40:50,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 135 transitions, 803 flow [2022-09-20 20:40:50,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 135 transitions, 760 flow, removed 13 selfloop flow, removed 8 redundant places. [2022-09-20 20:40:50,905 INFO L231 Difference]: Finished difference. Result has 139 places, 106 transitions, 433 flow [2022-09-20 20:40:50,906 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=433, PETRI_PLACES=139, PETRI_TRANSITIONS=106} [2022-09-20 20:40:50,906 INFO L287 CegarLoopForPetriNet]: 119 programPoint places, 20 predicate places. [2022-09-20 20:40:50,907 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 106 transitions, 433 flow [2022-09-20 20:40:50,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 89.5) internal successors, (1074), 12 states have internal predecessors, (1074), 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:40:50,907 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:40:50,907 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] [2022-09-20 20:40:50,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-09-20 20:40:50,908 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 20:40:50,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:40:50,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1237400633, now seen corresponding path program 1 times [2022-09-20 20:40:50,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:40:50,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76757425] [2022-09-20 20:40:50,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:40:50,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:40:50,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:40:51,113 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:40:51,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:40:51,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76757425] [2022-09-20 20:40:51,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76757425] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:40:51,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:40:51,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-09-20 20:40:51,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728601110] [2022-09-20 20:40:51,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:40:51,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-09-20 20:40:51,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:40:51,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-09-20 20:40:51,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-09-20 20:40:51,115 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 114 [2022-09-20 20:40:51,116 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 106 transitions, 433 flow. Second operand has 11 states, 11 states have (on average 89.63636363636364) internal successors, (986), 11 states have internal predecessors, (986), 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:40:51,117 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:40:51,117 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 114 [2022-09-20 20:40:51,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:40:51,527 INFO L130 PetriNetUnfolder]: 226/607 cut-off events. [2022-09-20 20:40:51,527 INFO L131 PetriNetUnfolder]: For 6031/6260 co-relation queries the response was YES. [2022-09-20 20:40:51,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2904 conditions, 607 events. 226/607 cut-off events. For 6031/6260 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2949 event pairs, 25 based on Foata normal form. 24/612 useless extension candidates. Maximal degree in co-relation 2819. Up to 224 conditions per place. [2022-09-20 20:40:51,534 INFO L137 encePairwiseOnDemand]: 102/114 looper letters, 33 selfloop transitions, 12 changer transitions 25/144 dead transitions. [2022-09-20 20:40:51,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 144 transitions, 1021 flow [2022-09-20 20:40:51,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-09-20 20:40:51,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-09-20 20:40:51,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1206 transitions. [2022-09-20 20:40:51,537 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8137651821862348 [2022-09-20 20:40:51,537 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1206 transitions. [2022-09-20 20:40:51,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1206 transitions. [2022-09-20 20:40:51,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:40:51,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1206 transitions. [2022-09-20 20:40:51,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 92.76923076923077) internal successors, (1206), 13 states have internal predecessors, (1206), 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:40:51,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 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:40:51,543 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 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:40:51,543 INFO L175 Difference]: Start difference. First operand has 139 places, 106 transitions, 433 flow. Second operand 13 states and 1206 transitions. [2022-09-20 20:40:51,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 144 transitions, 1021 flow [2022-09-20 20:40:51,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 144 transitions, 768 flow, removed 117 selfloop flow, removed 15 redundant places. [2022-09-20 20:40:51,555 INFO L231 Difference]: Finished difference. Result has 137 places, 109 transitions, 451 flow [2022-09-20 20:40:51,555 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=451, PETRI_PLACES=137, PETRI_TRANSITIONS=109} [2022-09-20 20:40:51,557 INFO L287 CegarLoopForPetriNet]: 119 programPoint places, 18 predicate places. [2022-09-20 20:40:51,558 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 109 transitions, 451 flow [2022-09-20 20:40:51,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 89.63636363636364) internal successors, (986), 11 states have internal predecessors, (986), 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:40:51,558 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:40:51,558 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] [2022-09-20 20:40:51,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-09-20 20:40:51,559 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 20:40:51,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:40:51,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1936034343, now seen corresponding path program 2 times [2022-09-20 20:40:51,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:40:51,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985397767] [2022-09-20 20:40:51,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:40:51,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:40:51,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:40:51,732 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:40:51,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:40:51,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985397767] [2022-09-20 20:40:51,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985397767] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:40:51,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:40:51,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-09-20 20:40:51,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095433137] [2022-09-20 20:40:51,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:40:51,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-09-20 20:40:51,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:40:51,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-09-20 20:40:51,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-09-20 20:40:51,735 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 114 [2022-09-20 20:40:51,736 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 109 transitions, 451 flow. Second operand has 9 states, 9 states have (on average 90.88888888888889) internal successors, (818), 9 states have internal predecessors, (818), 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:40:51,736 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:40:51,736 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 114 [2022-09-20 20:40:51,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:40:52,109 INFO L130 PetriNetUnfolder]: 224/609 cut-off events. [2022-09-20 20:40:52,109 INFO L131 PetriNetUnfolder]: For 5323/5576 co-relation queries the response was YES. [2022-09-20 20:40:52,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3004 conditions, 609 events. 224/609 cut-off events. For 5323/5576 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2951 event pairs, 30 based on Foata normal form. 23/609 useless extension candidates. Maximal degree in co-relation 2924. Up to 265 conditions per place. [2022-09-20 20:40:52,117 INFO L137 encePairwiseOnDemand]: 102/114 looper letters, 35 selfloop transitions, 12 changer transitions 25/147 dead transitions. [2022-09-20 20:40:52,117 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 147 transitions, 1097 flow [2022-09-20 20:40:52,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-09-20 20:40:52,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-09-20 20:40:52,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1129 transitions. [2022-09-20 20:40:52,120 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8252923976608187 [2022-09-20 20:40:52,120 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1129 transitions. [2022-09-20 20:40:52,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1129 transitions. [2022-09-20 20:40:52,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:40:52,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1129 transitions. [2022-09-20 20:40:52,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 94.08333333333333) internal successors, (1129), 12 states have internal predecessors, (1129), 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:40:52,126 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 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:40:52,126 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 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:40:52,126 INFO L175 Difference]: Start difference. First operand has 137 places, 109 transitions, 451 flow. Second operand 12 states and 1129 transitions. [2022-09-20 20:40:52,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 147 transitions, 1097 flow [2022-09-20 20:40:52,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 147 transitions, 1068 flow, removed 10 selfloop flow, removed 7 redundant places. [2022-09-20 20:40:52,137 INFO L231 Difference]: Finished difference. Result has 143 places, 116 transitions, 599 flow [2022-09-20 20:40:52,137 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=599, PETRI_PLACES=143, PETRI_TRANSITIONS=116} [2022-09-20 20:40:52,139 INFO L287 CegarLoopForPetriNet]: 119 programPoint places, 24 predicate places. [2022-09-20 20:40:52,139 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 116 transitions, 599 flow [2022-09-20 20:40:52,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 90.88888888888889) internal successors, (818), 9 states have internal predecessors, (818), 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:40:52,139 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:40:52,140 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] [2022-09-20 20:40:52,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-09-20 20:40:52,140 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 20:40:52,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:40:52,140 INFO L85 PathProgramCache]: Analyzing trace with hash -68989877, now seen corresponding path program 3 times [2022-09-20 20:40:52,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:40:52,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634325585] [2022-09-20 20:40:52,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:40:52,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:40:52,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:40:52,347 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:40:52,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:40:52,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634325585] [2022-09-20 20:40:52,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634325585] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:40:52,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:40:52,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-09-20 20:40:52,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47855978] [2022-09-20 20:40:52,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:40:52,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-09-20 20:40:52,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:40:52,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-09-20 20:40:52,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-09-20 20:40:52,352 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 114 [2022-09-20 20:40:52,353 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 116 transitions, 599 flow. Second operand has 11 states, 11 states have (on average 90.54545454545455) internal successors, (996), 11 states have internal predecessors, (996), 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:40:52,353 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:40:52,353 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 114 [2022-09-20 20:40:52,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:40:52,799 INFO L130 PetriNetUnfolder]: 232/640 cut-off events. [2022-09-20 20:40:52,799 INFO L131 PetriNetUnfolder]: For 11863/12180 co-relation queries the response was YES. [2022-09-20 20:40:52,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4081 conditions, 640 events. 232/640 cut-off events. For 11863/12180 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3113 event pairs, 43 based on Foata normal form. 16/628 useless extension candidates. Maximal degree in co-relation 3997. Up to 230 conditions per place. [2022-09-20 20:40:52,808 INFO L137 encePairwiseOnDemand]: 101/114 looper letters, 39 selfloop transitions, 21 changer transitions 25/160 dead transitions. [2022-09-20 20:40:52,808 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 160 transitions, 1566 flow [2022-09-20 20:40:52,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-09-20 20:40:52,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-09-20 20:40:52,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1314 transitions. [2022-09-20 20:40:52,812 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8233082706766918 [2022-09-20 20:40:52,812 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1314 transitions. [2022-09-20 20:40:52,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1314 transitions. [2022-09-20 20:40:52,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:40:52,813 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1314 transitions. [2022-09-20 20:40:52,816 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 93.85714285714286) internal successors, (1314), 14 states have internal predecessors, (1314), 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:40:52,819 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 114.0) internal successors, (1710), 15 states have internal predecessors, (1710), 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:40:52,819 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 114.0) internal successors, (1710), 15 states have internal predecessors, (1710), 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:40:52,820 INFO L175 Difference]: Start difference. First operand has 143 places, 116 transitions, 599 flow. Second operand 14 states and 1314 transitions. [2022-09-20 20:40:52,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 160 transitions, 1566 flow [2022-09-20 20:40:52,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 160 transitions, 1286 flow, removed 136 selfloop flow, removed 8 redundant places. [2022-09-20 20:40:52,831 INFO L231 Difference]: Finished difference. Result has 150 places, 123 transitions, 694 flow [2022-09-20 20:40:52,831 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=694, PETRI_PLACES=150, PETRI_TRANSITIONS=123} [2022-09-20 20:40:52,832 INFO L287 CegarLoopForPetriNet]: 119 programPoint places, 31 predicate places. [2022-09-20 20:40:52,832 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 123 transitions, 694 flow [2022-09-20 20:40:52,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 90.54545454545455) internal successors, (996), 11 states have internal predecessors, (996), 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:40:52,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:40:52,833 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] [2022-09-20 20:40:52,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-09-20 20:40:52,833 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 20:40:52,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:40:52,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1910040746, now seen corresponding path program 1 times [2022-09-20 20:40:52,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:40:52,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739918964] [2022-09-20 20:40:52,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:40:52,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:40:52,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:40:52,933 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:40:52,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:40:52,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739918964] [2022-09-20 20:40:52,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739918964] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:40:52,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:40:52,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 20:40:52,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498012554] [2022-09-20 20:40:52,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:40:52,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 20:40:52,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:40:52,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 20:40:52,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 20:40:52,936 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2022-09-20 20:40:52,936 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 123 transitions, 694 flow. Second operand has 6 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 states have internal predecessors, (554), 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:40:52,937 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:40:52,937 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2022-09-20 20:40:52,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:40:53,513 INFO L130 PetriNetUnfolder]: 1329/2562 cut-off events. [2022-09-20 20:40:53,513 INFO L131 PetriNetUnfolder]: For 51093/51370 co-relation queries the response was YES. [2022-09-20 20:40:53,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14014 conditions, 2562 events. 1329/2562 cut-off events. For 51093/51370 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 16515 event pairs, 75 based on Foata normal form. 180/2661 useless extension candidates. Maximal degree in co-relation 13930. Up to 749 conditions per place. [2022-09-20 20:40:53,542 INFO L137 encePairwiseOnDemand]: 104/114 looper letters, 79 selfloop transitions, 7 changer transitions 114/279 dead transitions. [2022-09-20 20:40:53,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 279 transitions, 3088 flow [2022-09-20 20:40:53,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-09-20 20:40:53,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-09-20 20:40:53,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 982 transitions. [2022-09-20 20:40:53,546 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8614035087719298 [2022-09-20 20:40:53,546 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 982 transitions. [2022-09-20 20:40:53,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 982 transitions. [2022-09-20 20:40:53,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:40:53,547 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 982 transitions. [2022-09-20 20:40:53,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 98.2) internal successors, (982), 10 states have internal predecessors, (982), 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:40:53,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 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:40:53,551 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 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:40:53,551 INFO L175 Difference]: Start difference. First operand has 150 places, 123 transitions, 694 flow. Second operand 10 states and 982 transitions. [2022-09-20 20:40:53,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 279 transitions, 3088 flow [2022-09-20 20:40:53,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 279 transitions, 2480 flow, removed 289 selfloop flow, removed 10 redundant places. [2022-09-20 20:40:53,587 INFO L231 Difference]: Finished difference. Result has 149 places, 126 transitions, 653 flow [2022-09-20 20:40:53,587 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=653, PETRI_PLACES=149, PETRI_TRANSITIONS=126} [2022-09-20 20:40:53,588 INFO L287 CegarLoopForPetriNet]: 119 programPoint places, 30 predicate places. [2022-09-20 20:40:53,588 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 126 transitions, 653 flow [2022-09-20 20:40:53,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 states have internal predecessors, (554), 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:40:53,588 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:40:53,588 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] [2022-09-20 20:40:53,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-09-20 20:40:53,589 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 20:40:53,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:40:53,589 INFO L85 PathProgramCache]: Analyzing trace with hash -531485674, now seen corresponding path program 1 times [2022-09-20 20:40:53,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:40:53,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560965499] [2022-09-20 20:40:53,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:40:53,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:40:53,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:40:53,680 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:40:53,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:40:53,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560965499] [2022-09-20 20:40:53,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560965499] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:40:53,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:40:53,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 20:40:53,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522510365] [2022-09-20 20:40:53,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:40:53,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 20:40:53,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:40:53,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 20:40:53,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-09-20 20:40:53,683 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2022-09-20 20:40:53,683 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 126 transitions, 653 flow. Second operand has 7 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 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:40:53,684 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:40:53,684 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2022-09-20 20:40:53,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:40:54,120 INFO L130 PetriNetUnfolder]: 604/1429 cut-off events. [2022-09-20 20:40:54,120 INFO L131 PetriNetUnfolder]: For 12966/13144 co-relation queries the response was YES. [2022-09-20 20:40:54,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6674 conditions, 1429 events. 604/1429 cut-off events. For 12966/13144 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 9264 event pairs, 41 based on Foata normal form. 132/1541 useless extension candidates. Maximal degree in co-relation 6590. Up to 287 conditions per place. [2022-09-20 20:40:54,134 INFO L137 encePairwiseOnDemand]: 104/114 looper letters, 73 selfloop transitions, 11 changer transitions 72/234 dead transitions. [2022-09-20 20:40:54,134 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 234 transitions, 2150 flow [2022-09-20 20:40:54,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-09-20 20:40:54,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-09-20 20:40:54,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1081 transitions. [2022-09-20 20:40:54,137 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8620414673046252 [2022-09-20 20:40:54,137 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1081 transitions. [2022-09-20 20:40:54,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1081 transitions. [2022-09-20 20:40:54,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:40:54,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1081 transitions. [2022-09-20 20:40:54,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 98.27272727272727) internal successors, (1081), 11 states have internal predecessors, (1081), 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:40:54,142 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 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:40:54,142 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 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:40:54,142 INFO L175 Difference]: Start difference. First operand has 149 places, 126 transitions, 653 flow. Second operand 11 states and 1081 transitions. [2022-09-20 20:40:54,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 234 transitions, 2150 flow [2022-09-20 20:40:54,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 234 transitions, 2104 flow, removed 10 selfloop flow, removed 6 redundant places. [2022-09-20 20:40:54,157 INFO L231 Difference]: Finished difference. Result has 156 places, 126 transitions, 677 flow [2022-09-20 20:40:54,158 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=567, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=677, PETRI_PLACES=156, PETRI_TRANSITIONS=126} [2022-09-20 20:40:54,158 INFO L287 CegarLoopForPetriNet]: 119 programPoint places, 37 predicate places. [2022-09-20 20:40:54,158 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 126 transitions, 677 flow [2022-09-20 20:40:54,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 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:40:54,159 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:40:54,159 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] [2022-09-20 20:40:54,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-09-20 20:40:54,159 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 20:40:54,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:40:54,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1701478821, now seen corresponding path program 1 times [2022-09-20 20:40:54,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:40:54,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662850036] [2022-09-20 20:40:54,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:40:54,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:40:54,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:40:54,242 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:40:54,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:40:54,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662850036] [2022-09-20 20:40:54,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662850036] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:40:54,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:40:54,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 20:40:54,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876640178] [2022-09-20 20:40:54,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:40:54,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 20:40:54,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:40:54,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 20:40:54,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 20:40:54,245 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 114 [2022-09-20 20:40:54,245 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 126 transitions, 677 flow. Second operand has 6 states, 6 states have (on average 94.66666666666667) internal successors, (568), 6 states have internal predecessors, (568), 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:40:54,246 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:40:54,246 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 114 [2022-09-20 20:40:54,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:40:54,551 INFO L130 PetriNetUnfolder]: 214/1190 cut-off events. [2022-09-20 20:40:54,551 INFO L131 PetriNetUnfolder]: For 5992/6153 co-relation queries the response was YES. [2022-09-20 20:40:54,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4423 conditions, 1190 events. 214/1190 cut-off events. For 5992/6153 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 9712 event pairs, 42 based on Foata normal form. 29/1151 useless extension candidates. Maximal degree in co-relation 4335. Up to 240 conditions per place. [2022-09-20 20:40:54,563 INFO L137 encePairwiseOnDemand]: 108/114 looper letters, 40 selfloop transitions, 2 changer transitions 32/165 dead transitions. [2022-09-20 20:40:54,564 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 165 transitions, 1269 flow [2022-09-20 20:40:54,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-09-20 20:40:54,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-09-20 20:40:54,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 594 transitions. [2022-09-20 20:40:54,565 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.868421052631579 [2022-09-20 20:40:54,565 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 594 transitions. [2022-09-20 20:40:54,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 594 transitions. [2022-09-20 20:40:54,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:40:54,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 594 transitions. [2022-09-20 20:40:54,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 99.0) internal successors, (594), 6 states have internal predecessors, (594), 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:40:54,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 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:40:54,569 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 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:40:54,569 INFO L175 Difference]: Start difference. First operand has 156 places, 126 transitions, 677 flow. Second operand 6 states and 594 transitions. [2022-09-20 20:40:54,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 165 transitions, 1269 flow [2022-09-20 20:40:54,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 165 transitions, 1235 flow, removed 13 selfloop flow, removed 5 redundant places. [2022-09-20 20:40:54,589 INFO L231 Difference]: Finished difference. Result has 157 places, 125 transitions, 645 flow [2022-09-20 20:40:54,590 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=643, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=645, PETRI_PLACES=157, PETRI_TRANSITIONS=125} [2022-09-20 20:40:54,590 INFO L287 CegarLoopForPetriNet]: 119 programPoint places, 38 predicate places. [2022-09-20 20:40:54,590 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 125 transitions, 645 flow [2022-09-20 20:40:54,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.66666666666667) internal successors, (568), 6 states have internal predecessors, (568), 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:40:54,591 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:40:54,591 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] [2022-09-20 20:40:54,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-09-20 20:40:54,592 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 20:40:54,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:40:54,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1528898073, now seen corresponding path program 2 times [2022-09-20 20:40:54,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:40:54,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263551663] [2022-09-20 20:40:54,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:40:54,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:40:54,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:40:54,688 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:40:54,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:40:54,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263551663] [2022-09-20 20:40:54,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263551663] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:40:54,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:40:54,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-09-20 20:40:54,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875795937] [2022-09-20 20:40:54,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:40:54,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-09-20 20:40:54,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:40:54,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-09-20 20:40:54,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-09-20 20:40:54,691 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2022-09-20 20:40:54,691 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 125 transitions, 645 flow. Second operand has 8 states, 8 states have (on average 92.125) internal successors, (737), 8 states have internal predecessors, (737), 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:40:54,692 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:40:54,692 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2022-09-20 20:40:54,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:40:55,156 INFO L130 PetriNetUnfolder]: 645/1673 cut-off events. [2022-09-20 20:40:55,156 INFO L131 PetriNetUnfolder]: For 19430/19693 co-relation queries the response was YES. [2022-09-20 20:40:55,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8455 conditions, 1673 events. 645/1673 cut-off events. For 19430/19693 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 12874 event pairs, 69 based on Foata normal form. 153/1800 useless extension candidates. Maximal degree in co-relation 8418. Up to 421 conditions per place. [2022-09-20 20:40:55,169 INFO L137 encePairwiseOnDemand]: 105/114 looper letters, 33 selfloop transitions, 12 changer transitions 77/200 dead transitions. [2022-09-20 20:40:55,169 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 200 transitions, 1778 flow [2022-09-20 20:40:55,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-09-20 20:40:55,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-09-20 20:40:55,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1243 transitions. [2022-09-20 20:40:55,172 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8387314439946019 [2022-09-20 20:40:55,172 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1243 transitions. [2022-09-20 20:40:55,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1243 transitions. [2022-09-20 20:40:55,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:40:55,173 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1243 transitions. [2022-09-20 20:40:55,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 95.61538461538461) internal successors, (1243), 13 states have internal predecessors, (1243), 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:40:55,176 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 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:40:55,177 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 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:40:55,177 INFO L175 Difference]: Start difference. First operand has 157 places, 125 transitions, 645 flow. Second operand 13 states and 1243 transitions. [2022-09-20 20:40:55,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 200 transitions, 1778 flow [2022-09-20 20:40:55,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 200 transitions, 1572 flow, removed 77 selfloop flow, removed 10 redundant places. [2022-09-20 20:40:55,201 INFO L231 Difference]: Finished difference. Result has 162 places, 109 transitions, 496 flow [2022-09-20 20:40:55,202 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=496, PETRI_PLACES=162, PETRI_TRANSITIONS=109} [2022-09-20 20:40:55,202 INFO L287 CegarLoopForPetriNet]: 119 programPoint places, 43 predicate places. [2022-09-20 20:40:55,202 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 109 transitions, 496 flow [2022-09-20 20:40:55,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 92.125) internal successors, (737), 8 states have internal predecessors, (737), 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:40:55,202 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:40:55,203 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] [2022-09-20 20:40:55,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-09-20 20:40:55,203 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 20:40:55,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:40:55,203 INFO L85 PathProgramCache]: Analyzing trace with hash -2099054504, now seen corresponding path program 1 times [2022-09-20 20:40:55,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:40:55,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806655471] [2022-09-20 20:40:55,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:40:55,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:40:55,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:40:55,518 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:40:55,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:40:55,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806655471] [2022-09-20 20:40:55,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806655471] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:40:55,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:40:55,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-09-20 20:40:55,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045995931] [2022-09-20 20:40:55,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:40:55,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-09-20 20:40:55,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:40:55,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-09-20 20:40:55,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-09-20 20:40:55,520 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 114 [2022-09-20 20:40:55,521 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 109 transitions, 496 flow. Second operand has 13 states, 13 states have (on average 86.84615384615384) internal successors, (1129), 13 states have internal predecessors, (1129), 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:40:55,522 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:40:55,522 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 114 [2022-09-20 20:40:55,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:40:55,927 INFO L130 PetriNetUnfolder]: 74/499 cut-off events. [2022-09-20 20:40:55,927 INFO L131 PetriNetUnfolder]: For 2411/2493 co-relation queries the response was YES. [2022-09-20 20:40:55,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1688 conditions, 499 events. 74/499 cut-off events. For 2411/2493 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2856 event pairs, 3 based on Foata normal form. 9/492 useless extension candidates. Maximal degree in co-relation 1658. Up to 81 conditions per place. [2022-09-20 20:40:55,930 INFO L137 encePairwiseOnDemand]: 103/114 looper letters, 30 selfloop transitions, 10 changer transitions 15/132 dead transitions. [2022-09-20 20:40:55,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 132 transitions, 784 flow [2022-09-20 20:40:55,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-09-20 20:40:55,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-09-20 20:40:55,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1070 transitions. [2022-09-20 20:40:55,932 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7821637426900585 [2022-09-20 20:40:55,932 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1070 transitions. [2022-09-20 20:40:55,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1070 transitions. [2022-09-20 20:40:55,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:40:55,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1070 transitions. [2022-09-20 20:40:55,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 89.16666666666667) internal successors, (1070), 12 states have internal predecessors, (1070), 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:40:55,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 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:40:55,936 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 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:40:55,936 INFO L175 Difference]: Start difference. First operand has 162 places, 109 transitions, 496 flow. Second operand 12 states and 1070 transitions. [2022-09-20 20:40:55,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 132 transitions, 784 flow [2022-09-20 20:40:55,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 132 transitions, 541 flow, removed 88 selfloop flow, removed 30 redundant places. [2022-09-20 20:40:55,945 INFO L231 Difference]: Finished difference. Result has 134 places, 108 transitions, 362 flow [2022-09-20 20:40:55,945 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=362, PETRI_PLACES=134, PETRI_TRANSITIONS=108} [2022-09-20 20:40:55,945 INFO L287 CegarLoopForPetriNet]: 119 programPoint places, 15 predicate places. [2022-09-20 20:40:55,946 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 108 transitions, 362 flow [2022-09-20 20:40:55,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 86.84615384615384) internal successors, (1129), 13 states have internal predecessors, (1129), 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:40:55,946 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:40:55,946 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] [2022-09-20 20:40:55,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-09-20 20:40:55,946 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 20:40:55,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:40:55,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1057172030, now seen corresponding path program 2 times [2022-09-20 20:40:55,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:40:55,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579281717] [2022-09-20 20:40:55,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:40:55,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:40:55,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-20 20:40:55,992 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-20 20:40:56,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-20 20:40:56,092 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-20 20:40:56,092 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-09-20 20:40:56,094 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-09-20 20:40:56,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-09-20 20:40:56,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-09-20 20:40:56,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-09-20 20:40:56,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-09-20 20:40:56,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-09-20 20:40:56,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-09-20 20:40:56,097 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:40:56,103 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-09-20 20:40:56,104 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-09-20 20:40:56,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 08:40:56 BasicIcfg [2022-09-20 20:40:56,226 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-09-20 20:40:56,226 INFO L158 Benchmark]: Toolchain (without parser) took 11838.75ms. Allocated memory was 180.4MB in the beginning and 320.9MB in the end (delta: 140.5MB). Free memory was 147.9MB in the beginning and 198.3MB in the end (delta: -50.4MB). Peak memory consumption was 90.6MB. Max. memory is 8.0GB. [2022-09-20 20:40:56,227 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 180.4MB. Free memory is still 135.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-09-20 20:40:56,227 INFO L158 Benchmark]: CACSL2BoogieTranslator took 614.14ms. Allocated memory was 180.4MB in the beginning and 219.2MB in the end (delta: 38.8MB). Free memory was 147.9MB in the beginning and 176.5MB in the end (delta: -28.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-09-20 20:40:56,227 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.09ms. Allocated memory is still 219.2MB. Free memory was 176.5MB in the beginning and 173.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-09-20 20:40:56,228 INFO L158 Benchmark]: Boogie Preprocessor took 28.18ms. Allocated memory is still 219.2MB. Free memory was 173.4MB in the beginning and 171.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-09-20 20:40:56,228 INFO L158 Benchmark]: RCFGBuilder took 932.62ms. Allocated memory is still 219.2MB. Free memory was 171.3MB in the beginning and 94.2MB in the end (delta: 77.1MB). Peak memory consumption was 77.6MB. Max. memory is 8.0GB. [2022-09-20 20:40:56,228 INFO L158 Benchmark]: TraceAbstraction took 10185.43ms. Allocated memory was 219.2MB in the beginning and 320.9MB in the end (delta: 101.7MB). Free memory was 93.7MB in the beginning and 198.3MB in the end (delta: -104.6MB). There was no memory consumed. Max. memory is 8.0GB. [2022-09-20 20:40:56,230 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.17ms. Allocated memory is still 180.4MB. Free memory is still 135.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 614.14ms. Allocated memory was 180.4MB in the beginning and 219.2MB in the end (delta: 38.8MB). Free memory was 147.9MB in the beginning and 176.5MB in the end (delta: -28.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 73.09ms. Allocated memory is still 219.2MB. Free memory was 176.5MB in the beginning and 173.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.18ms. Allocated memory is still 219.2MB. Free memory was 173.4MB in the beginning and 171.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 932.62ms. Allocated memory is still 219.2MB. Free memory was 171.3MB in the beginning and 94.2MB in the end (delta: 77.1MB). Peak memory consumption was 77.6MB. Max. memory is 8.0GB. * TraceAbstraction took 10185.43ms. Allocated memory was 219.2MB in the beginning and 320.9MB in the end (delta: 101.7MB). Free memory was 93.7MB in the beginning and 198.3MB in the end (delta: -104.6MB). There was no memory consumed. 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: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L712] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L713] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L715] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L719] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L720] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L721] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L722] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L723] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L724] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L725] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L726] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L727] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L728] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L729] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L730] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L731] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L732] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L733] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L734] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L735] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 pthread_t t2025; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2025={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L819] FCALL, FORK 0 pthread_create(&t2025, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2025, ((void *)0), P0, ((void *)0))=-2, t2025={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 2 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 pthread_t t2026; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2025={5:0}, t2026={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] FCALL, FORK 0 pthread_create(&t2026, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2026, ((void *)0), P1, ((void *)0))=-1, t2025={5:0}, t2026={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 0 pthread_t t2027; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2025={5:0}, t2026={6:0}, t2027={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L823] FCALL, FORK 0 pthread_create(&t2027, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2027, ((void *)0), P2, ((void *)0))=0, t2025={5:0}, t2026={6:0}, t2027={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L776] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L776] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L777] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L778] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L779] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L780] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, 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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, 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, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L796] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L796] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L797] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L798] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L799] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L800] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L800] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=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, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, 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, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, 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, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025={5:0}, t2026={6:0}, t2027={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, 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=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L829] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L829] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L830] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L831] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L832] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L833] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L833] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 z$flush_delayed = weak$$choice2 [L839] 0 z$mem_tmp = z [L840] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L840] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L841] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L841] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L842] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L842] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L843] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L843] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L844] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L845] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L846] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L848] 0 z = z$flush_delayed ? z$mem_tmp : z [L849] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025={5:0}, t2026={6:0}, t2027={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, 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=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - 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: 823]: 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: 821]: 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: 819]: 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 7 procedures, 141 locations, 6 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: 9.9s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 726 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 726 mSDsluCounter, 720 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1187 mSDsCounter, 266 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2163 IncrementalHoareTripleChecker+Invalid, 2429 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 266 mSolverCounterUnsat, 134 mSDtfsCounter, 2163 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 217 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=694occurred in iteration=10, InterpolantAutomatonStates: 167, 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.6s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1264 NumberOfCodeBlocks, 1264 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1161 ConstructedInterpolants, 0 QuantifiedInterpolants, 7029 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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:40:56,272 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...