./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix019_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a340643f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix019_tso.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d6f4376125179246714b78f2e2f349c8b75c8c24c937ac142dcf7789f615522d --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a340643-m [2024-01-27 16:11:29,023 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 16:11:29,072 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 16:11:29,075 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 16:11:29,076 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 16:11:29,103 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 16:11:29,104 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 16:11:29,104 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 16:11:29,104 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 16:11:29,104 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 16:11:29,105 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 16:11:29,105 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 16:11:29,105 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 16:11:29,105 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 16:11:29,106 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 16:11:29,106 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 16:11:29,106 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 16:11:29,106 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 16:11:29,107 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 16:11:29,107 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 16:11:29,109 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 16:11:29,112 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 16:11:29,112 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 16:11:29,113 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 16:11:29,113 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 16:11:29,113 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 16:11:29,113 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 16:11:29,113 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 16:11:29,114 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 16:11:29,114 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 16:11:29,114 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 16:11:29,114 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 16:11:29,114 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 16:11:29,115 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 16:11:29,115 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 16:11:29,116 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 16:11:29,116 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 16:11:29,116 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 16:11:29,116 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 16:11:29,117 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 16:11:29,117 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 16:11:29,117 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 16:11:29,117 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 16:11:29,118 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d6f4376125179246714b78f2e2f349c8b75c8c24c937ac142dcf7789f615522d [2024-01-27 16:11:29,315 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 16:11:29,336 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 16:11:29,338 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 16:11:29,338 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 16:11:29,339 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 16:11:29,340 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix019_tso.oepc.i [2024-01-27 16:11:30,310 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 16:11:30,491 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 16:11:30,491 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019_tso.oepc.i [2024-01-27 16:11:30,502 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56834c92a/56ff91a09e0a4d7fa72fa4c467a5a445/FLAG97243dcbe [2024-01-27 16:11:30,511 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56834c92a/56ff91a09e0a4d7fa72fa4c467a5a445 [2024-01-27 16:11:30,513 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 16:11:30,514 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-01-27 16:11:30,515 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 16:11:30,515 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 16:11:30,518 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 16:11:30,519 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 04:11:30" (1/1) ... [2024-01-27 16:11:30,519 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f42500a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:11:30, skipping insertion in model container [2024-01-27 16:11:30,519 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 04:11:30" (1/1) ... [2024-01-27 16:11:30,552 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 16:11:30,700 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019_tso.oepc.i[949,962] [2024-01-27 16:11:30,820 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 16:11:30,835 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 16:11:30,847 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019_tso.oepc.i[949,962] [2024-01-27 16:11:30,884 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 16:11:30,913 INFO L206 MainTranslator]: Completed translation [2024-01-27 16:11:30,914 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:11:30 WrapperNode [2024-01-27 16:11:30,914 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 16:11:30,915 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 16:11:30,915 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 16:11:30,915 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 16:11:30,921 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:11:30" (1/1) ... [2024-01-27 16:11:30,944 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:11:30" (1/1) ... [2024-01-27 16:11:30,978 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2024-01-27 16:11:30,978 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 16:11:30,978 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 16:11:30,978 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 16:11:30,979 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 16:11:30,987 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:11:30" (1/1) ... [2024-01-27 16:11:30,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:11:30" (1/1) ... [2024-01-27 16:11:31,001 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:11:30" (1/1) ... [2024-01-27 16:11:31,013 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-01-27 16:11:31,018 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:11:30" (1/1) ... [2024-01-27 16:11:31,019 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:11:30" (1/1) ... [2024-01-27 16:11:31,028 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:11:30" (1/1) ... [2024-01-27 16:11:31,030 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:11:30" (1/1) ... [2024-01-27 16:11:31,031 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:11:30" (1/1) ... [2024-01-27 16:11:31,032 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:11:30" (1/1) ... [2024-01-27 16:11:31,034 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 16:11:31,035 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 16:11:31,035 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 16:11:31,035 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 16:11:31,036 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:11:30" (1/1) ... [2024-01-27 16:11:31,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 16:11:31,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:11:31,066 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-27 16:11:31,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-27 16:11:31,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 16:11:31,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 16:11:31,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 16:11:31,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-27 16:11:31,105 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-27 16:11:31,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 16:11:31,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 16:11:31,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 16:11:31,107 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-01-27 16:11:31,107 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-01-27 16:11:31,107 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-01-27 16:11:31,107 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-01-27 16:11:31,108 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-01-27 16:11:31,108 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-01-27 16:11:31,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 16:11:31,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 16:11:31,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 16:11:31,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-27 16:11:31,109 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-27 16:11:31,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 16:11:31,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 16:11:31,110 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-27 16:11:31,233 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 16:11:31,235 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 16:11:31,446 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 16:11:31,446 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 16:11:31,629 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 16:11:31,629 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-27 16:11:31,630 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:11:31 BoogieIcfgContainer [2024-01-27 16:11:31,631 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 16:11:31,632 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 16:11:31,632 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 16:11:31,635 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 16:11:31,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 04:11:30" (1/3) ... [2024-01-27 16:11:31,635 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ac11a91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 04:11:31, skipping insertion in model container [2024-01-27 16:11:31,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:11:30" (2/3) ... [2024-01-27 16:11:31,636 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ac11a91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 04:11:31, skipping insertion in model container [2024-01-27 16:11:31,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:11:31" (3/3) ... [2024-01-27 16:11:31,637 INFO L112 eAbstractionObserver]: Analyzing ICFG mix019_tso.oepc.i [2024-01-27 16:11:31,643 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-27 16:11:31,649 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 16:11:31,650 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-01-27 16:11:31,650 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 16:11:31,683 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-01-27 16:11:31,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 40 transitions, 92 flow [2024-01-27 16:11:31,738 INFO L124 PetriNetUnfolderBase]: 1/37 cut-off events. [2024-01-27 16:11:31,739 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 16:11:31,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 37 events. 1/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 66 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2024-01-27 16:11:31,742 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 40 transitions, 92 flow [2024-01-27 16:11:31,746 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 37 transitions, 83 flow [2024-01-27 16:11:31,753 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 16:11:31,757 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@9865a91, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 16:11:31,757 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-01-27 16:11:31,761 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 16:11:31,761 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2024-01-27 16:11:31,761 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 16:11:31,761 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:11:31,762 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-27 16:11:31,762 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:11:31,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:11:31,766 INFO L85 PathProgramCache]: Analyzing trace with hash -2060963303, now seen corresponding path program 1 times [2024-01-27 16:11:31,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:11:31,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469554133] [2024-01-27 16:11:31,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:11:31,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:11:31,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:11:32,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:11:32,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:11:32,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469554133] [2024-01-27 16:11:32,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469554133] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:11:32,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:11:32,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 16:11:32,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116368062] [2024-01-27 16:11:32,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:11:32,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 16:11:32,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:11:32,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 16:11:32,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 16:11:32,167 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 40 [2024-01-27 16:11:32,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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) [2024-01-27 16:11:32,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:11:32,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 40 [2024-01-27 16:11:32,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:11:32,417 INFO L124 PetriNetUnfolderBase]: 528/1007 cut-off events. [2024-01-27 16:11:32,417 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-01-27 16:11:32,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1855 conditions, 1007 events. 528/1007 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 6212 event pairs, 84 based on Foata normal form. 36/1013 useless extension candidates. Maximal degree in co-relation 1844. Up to 652 conditions per place. [2024-01-27 16:11:32,428 INFO L140 encePairwiseOnDemand]: 36/40 looper letters, 27 selfloop transitions, 2 changer transitions 2/47 dead transitions. [2024-01-27 16:11:32,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 47 transitions, 168 flow [2024-01-27 16:11:32,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 16:11:32,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 16:11:32,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2024-01-27 16:11:32,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7583333333333333 [2024-01-27 16:11:32,440 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 83 flow. Second operand 3 states and 91 transitions. [2024-01-27 16:11:32,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 47 transitions, 168 flow [2024-01-27 16:11:32,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 47 transitions, 164 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-27 16:11:32,448 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 78 flow [2024-01-27 16:11:32,449 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2024-01-27 16:11:32,452 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -2 predicate places. [2024-01-27 16:11:32,453 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 78 flow [2024-01-27 16:11:32,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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) [2024-01-27 16:11:32,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:11:32,454 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:11:32,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 16:11:32,454 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:11:32,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:11:32,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1218548506, now seen corresponding path program 1 times [2024-01-27 16:11:32,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:11:32,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118598204] [2024-01-27 16:11:32,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:11:32,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:11:32,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:11:32,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:11:32,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:11:32,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118598204] [2024-01-27 16:11:32,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118598204] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:11:32,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:11:32,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 16:11:32,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672973604] [2024-01-27 16:11:32,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:11:32,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 16:11:32,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:11:32,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 16:11:32,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-27 16:11:32,730 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40 [2024-01-27 16:11:32,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 78 flow. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 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) [2024-01-27 16:11:32,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:11:32,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40 [2024-01-27 16:11:32,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:11:33,047 INFO L124 PetriNetUnfolderBase]: 983/1747 cut-off events. [2024-01-27 16:11:33,048 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2024-01-27 16:11:33,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3403 conditions, 1747 events. 983/1747 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 11131 event pairs, 167 based on Foata normal form. 0/1690 useless extension candidates. Maximal degree in co-relation 3393. Up to 790 conditions per place. [2024-01-27 16:11:33,056 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 26 selfloop transitions, 2 changer transitions 39/80 dead transitions. [2024-01-27 16:11:33,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 80 transitions, 316 flow [2024-01-27 16:11:33,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-27 16:11:33,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-27 16:11:33,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 197 transitions. [2024-01-27 16:11:33,062 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.615625 [2024-01-27 16:11:33,063 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 78 flow. Second operand 8 states and 197 transitions. [2024-01-27 16:11:33,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 80 transitions, 316 flow [2024-01-27 16:11:33,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 80 transitions, 300 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 16:11:33,067 INFO L231 Difference]: Finished difference. Result has 53 places, 33 transitions, 88 flow [2024-01-27 16:11:33,067 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=88, PETRI_PLACES=53, PETRI_TRANSITIONS=33} [2024-01-27 16:11:33,068 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 7 predicate places. [2024-01-27 16:11:33,068 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 33 transitions, 88 flow [2024-01-27 16:11:33,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 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) [2024-01-27 16:11:33,069 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:11:33,069 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:11:33,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 16:11:33,069 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:11:33,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:11:33,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1671939278, now seen corresponding path program 1 times [2024-01-27 16:11:33,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:11:33,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158373761] [2024-01-27 16:11:33,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:11:33,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:11:33,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:11:33,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:11:33,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:11:33,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158373761] [2024-01-27 16:11:33,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158373761] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:11:33,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:11:33,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 16:11:33,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829135048] [2024-01-27 16:11:33,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:11:33,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 16:11:33,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:11:33,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 16:11:33,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-01-27 16:11:33,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40 [2024-01-27 16:11:33,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 33 transitions, 88 flow. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 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) [2024-01-27 16:11:33,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:11:33,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40 [2024-01-27 16:11:33,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:11:33,682 INFO L124 PetriNetUnfolderBase]: 874/1549 cut-off events. [2024-01-27 16:11:33,683 INFO L125 PetriNetUnfolderBase]: For 321/321 co-relation queries the response was YES. [2024-01-27 16:11:33,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3264 conditions, 1549 events. 874/1549 cut-off events. For 321/321 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 9624 event pairs, 279 based on Foata normal form. 48/1587 useless extension candidates. Maximal degree in co-relation 3249. Up to 1057 conditions per place. [2024-01-27 16:11:33,689 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 28 selfloop transitions, 3 changer transitions 27/71 dead transitions. [2024-01-27 16:11:33,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 71 transitions, 294 flow [2024-01-27 16:11:33,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-27 16:11:33,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-27 16:11:33,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 172 transitions. [2024-01-27 16:11:33,691 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6142857142857143 [2024-01-27 16:11:33,691 INFO L175 Difference]: Start difference. First operand has 53 places, 33 transitions, 88 flow. Second operand 7 states and 172 transitions. [2024-01-27 16:11:33,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 71 transitions, 294 flow [2024-01-27 16:11:33,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 71 transitions, 274 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-01-27 16:11:33,698 INFO L231 Difference]: Finished difference. Result has 52 places, 35 transitions, 111 flow [2024-01-27 16:11:33,698 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=111, PETRI_PLACES=52, PETRI_TRANSITIONS=35} [2024-01-27 16:11:33,698 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 6 predicate places. [2024-01-27 16:11:33,699 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 35 transitions, 111 flow [2024-01-27 16:11:33,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 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) [2024-01-27 16:11:33,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:11:33,699 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:11:33,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 16:11:33,700 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:11:33,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:11:33,700 INFO L85 PathProgramCache]: Analyzing trace with hash 388292812, now seen corresponding path program 1 times [2024-01-27 16:11:33,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:11:33,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730169884] [2024-01-27 16:11:33,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:11:33,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:11:33,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:11:34,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:11:34,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:11:34,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730169884] [2024-01-27 16:11:34,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730169884] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:11:34,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:11:34,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-27 16:11:34,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486214363] [2024-01-27 16:11:34,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:11:34,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-27 16:11:34,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:11:34,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-27 16:11:34,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-01-27 16:11:34,190 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40 [2024-01-27 16:11:34,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 35 transitions, 111 flow. Second operand has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 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) [2024-01-27 16:11:34,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:11:34,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40 [2024-01-27 16:11:34,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:11:34,484 INFO L124 PetriNetUnfolderBase]: 817/1448 cut-off events. [2024-01-27 16:11:34,484 INFO L125 PetriNetUnfolderBase]: For 1078/1078 co-relation queries the response was YES. [2024-01-27 16:11:34,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3612 conditions, 1448 events. 817/1448 cut-off events. For 1078/1078 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 8538 event pairs, 455 based on Foata normal form. 36/1474 useless extension candidates. Maximal degree in co-relation 3596. Up to 1048 conditions per place. [2024-01-27 16:11:34,492 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 33 selfloop transitions, 7 changer transitions 23/76 dead transitions. [2024-01-27 16:11:34,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 76 transitions, 373 flow [2024-01-27 16:11:34,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-27 16:11:34,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-27 16:11:34,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 191 transitions. [2024-01-27 16:11:34,494 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.596875 [2024-01-27 16:11:34,494 INFO L175 Difference]: Start difference. First operand has 52 places, 35 transitions, 111 flow. Second operand 8 states and 191 transitions. [2024-01-27 16:11:34,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 76 transitions, 373 flow [2024-01-27 16:11:34,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 76 transitions, 360 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-01-27 16:11:34,499 INFO L231 Difference]: Finished difference. Result has 58 places, 41 transitions, 176 flow [2024-01-27 16:11:34,500 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=176, PETRI_PLACES=58, PETRI_TRANSITIONS=41} [2024-01-27 16:11:34,501 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 12 predicate places. [2024-01-27 16:11:34,501 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 41 transitions, 176 flow [2024-01-27 16:11:34,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 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) [2024-01-27 16:11:34,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:11:34,501 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] [2024-01-27 16:11:34,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 16:11:34,502 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:11:34,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:11:34,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1526203815, now seen corresponding path program 1 times [2024-01-27 16:11:34,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:11:34,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985339979] [2024-01-27 16:11:34,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:11:34,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:11:34,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:11:34,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:11:34,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:11:34,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985339979] [2024-01-27 16:11:34,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985339979] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:11:34,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:11:34,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 16:11:34,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208207387] [2024-01-27 16:11:34,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:11:34,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 16:11:34,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:11:34,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 16:11:34,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-01-27 16:11:34,707 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40 [2024-01-27 16:11:34,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 41 transitions, 176 flow. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 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) [2024-01-27 16:11:34,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:11:34,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40 [2024-01-27 16:11:34,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:11:34,973 INFO L124 PetriNetUnfolderBase]: 839/1492 cut-off events. [2024-01-27 16:11:34,973 INFO L125 PetriNetUnfolderBase]: For 2970/3015 co-relation queries the response was YES. [2024-01-27 16:11:34,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4556 conditions, 1492 events. 839/1492 cut-off events. For 2970/3015 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 8768 event pairs, 214 based on Foata normal form. 41/1512 useless extension candidates. Maximal degree in co-relation 4535. Up to 880 conditions per place. [2024-01-27 16:11:34,983 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 41 selfloop transitions, 10 changer transitions 25/89 dead transitions. [2024-01-27 16:11:34,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 89 transitions, 508 flow [2024-01-27 16:11:34,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-27 16:11:34,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-27 16:11:34,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 199 transitions. [2024-01-27 16:11:34,984 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.621875 [2024-01-27 16:11:34,984 INFO L175 Difference]: Start difference. First operand has 58 places, 41 transitions, 176 flow. Second operand 8 states and 199 transitions. [2024-01-27 16:11:34,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 89 transitions, 508 flow [2024-01-27 16:11:34,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 89 transitions, 490 flow, removed 9 selfloop flow, removed 2 redundant places. [2024-01-27 16:11:34,990 INFO L231 Difference]: Finished difference. Result has 64 places, 45 transitions, 224 flow [2024-01-27 16:11:34,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=224, PETRI_PLACES=64, PETRI_TRANSITIONS=45} [2024-01-27 16:11:34,990 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 18 predicate places. [2024-01-27 16:11:34,990 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 45 transitions, 224 flow [2024-01-27 16:11:34,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 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) [2024-01-27 16:11:34,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:11:34,991 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] [2024-01-27 16:11:34,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 16:11:34,991 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:11:34,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:11:34,991 INFO L85 PathProgramCache]: Analyzing trace with hash 378924901, now seen corresponding path program 2 times [2024-01-27 16:11:34,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:11:34,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990219804] [2024-01-27 16:11:34,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:11:34,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:11:35,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:11:35,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:11:35,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:11:35,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990219804] [2024-01-27 16:11:35,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990219804] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:11:35,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:11:35,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-27 16:11:35,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241281432] [2024-01-27 16:11:35,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:11:35,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-27 16:11:35,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:11:35,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-27 16:11:35,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-01-27 16:11:35,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40 [2024-01-27 16:11:35,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 45 transitions, 224 flow. Second operand has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 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) [2024-01-27 16:11:35,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:11:35,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40 [2024-01-27 16:11:35,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:11:35,628 INFO L124 PetriNetUnfolderBase]: 841/1493 cut-off events. [2024-01-27 16:11:35,629 INFO L125 PetriNetUnfolderBase]: For 4396/4490 co-relation queries the response was YES. [2024-01-27 16:11:35,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5188 conditions, 1493 events. 841/1493 cut-off events. For 4396/4490 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 8785 event pairs, 240 based on Foata normal form. 46/1518 useless extension candidates. Maximal degree in co-relation 5162. Up to 879 conditions per place. [2024-01-27 16:11:35,638 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 42 selfloop transitions, 12 changer transitions 34/101 dead transitions. [2024-01-27 16:11:35,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 101 transitions, 676 flow [2024-01-27 16:11:35,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-01-27 16:11:35,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-01-27 16:11:35,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 241 transitions. [2024-01-27 16:11:35,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6025 [2024-01-27 16:11:35,639 INFO L175 Difference]: Start difference. First operand has 64 places, 45 transitions, 224 flow. Second operand 10 states and 241 transitions. [2024-01-27 16:11:35,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 101 transitions, 676 flow [2024-01-27 16:11:35,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 101 transitions, 630 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-01-27 16:11:35,646 INFO L231 Difference]: Finished difference. Result has 71 places, 48 transitions, 280 flow [2024-01-27 16:11:35,646 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=280, PETRI_PLACES=71, PETRI_TRANSITIONS=48} [2024-01-27 16:11:35,649 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 25 predicate places. [2024-01-27 16:11:35,649 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 48 transitions, 280 flow [2024-01-27 16:11:35,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 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) [2024-01-27 16:11:35,649 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:11:35,649 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] [2024-01-27 16:11:35,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-27 16:11:35,650 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:11:35,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:11:35,650 INFO L85 PathProgramCache]: Analyzing trace with hash -663345330, now seen corresponding path program 1 times [2024-01-27 16:11:35,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:11:35,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559568113] [2024-01-27 16:11:35,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:11:35,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:11:35,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:11:36,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:11:36,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:11:36,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559568113] [2024-01-27 16:11:36,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559568113] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:11:36,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:11:36,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-01-27 16:11:36,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377287853] [2024-01-27 16:11:36,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:11:36,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-01-27 16:11:36,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:11:36,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-01-27 16:11:36,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-01-27 16:11:36,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40 [2024-01-27 16:11:36,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 48 transitions, 280 flow. Second operand has 8 states, 8 states have (on average 17.75) internal successors, (142), 8 states have internal predecessors, (142), 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) [2024-01-27 16:11:36,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:11:36,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40 [2024-01-27 16:11:36,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:11:36,516 INFO L124 PetriNetUnfolderBase]: 766/1372 cut-off events. [2024-01-27 16:11:36,516 INFO L125 PetriNetUnfolderBase]: For 6322/6436 co-relation queries the response was YES. [2024-01-27 16:11:36,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5448 conditions, 1372 events. 766/1372 cut-off events. For 6322/6436 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7864 event pairs, 202 based on Foata normal form. 42/1407 useless extension candidates. Maximal degree in co-relation 5418. Up to 855 conditions per place. [2024-01-27 16:11:36,524 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 44 selfloop transitions, 8 changer transitions 25/90 dead transitions. [2024-01-27 16:11:36,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 90 transitions, 678 flow [2024-01-27 16:11:36,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-27 16:11:36,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-27 16:11:36,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 195 transitions. [2024-01-27 16:11:36,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.609375 [2024-01-27 16:11:36,526 INFO L175 Difference]: Start difference. First operand has 71 places, 48 transitions, 280 flow. Second operand 8 states and 195 transitions. [2024-01-27 16:11:36,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 90 transitions, 678 flow [2024-01-27 16:11:36,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 90 transitions, 640 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-01-27 16:11:36,533 INFO L231 Difference]: Finished difference. Result has 72 places, 48 transitions, 287 flow [2024-01-27 16:11:36,533 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=287, PETRI_PLACES=72, PETRI_TRANSITIONS=48} [2024-01-27 16:11:36,535 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 26 predicate places. [2024-01-27 16:11:36,535 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 48 transitions, 287 flow [2024-01-27 16:11:36,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.75) internal successors, (142), 8 states have internal predecessors, (142), 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) [2024-01-27 16:11:36,536 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:11:36,536 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] [2024-01-27 16:11:36,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-27 16:11:36,536 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:11:36,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:11:36,537 INFO L85 PathProgramCache]: Analyzing trace with hash -781720501, now seen corresponding path program 1 times [2024-01-27 16:11:36,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:11:36,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585523327] [2024-01-27 16:11:36,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:11:36,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:11:36,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:11:36,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:11:36,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:11:36,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585523327] [2024-01-27 16:11:36,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585523327] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:11:36,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:11:36,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 16:11:36,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500182296] [2024-01-27 16:11:36,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:11:36,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 16:11:36,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:11:36,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 16:11:36,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 16:11:36,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2024-01-27 16:11:36,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 48 transitions, 287 flow. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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) [2024-01-27 16:11:36,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:11:36,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2024-01-27 16:11:36,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:11:36,899 INFO L124 PetriNetUnfolderBase]: 1428/2345 cut-off events. [2024-01-27 16:11:36,899 INFO L125 PetriNetUnfolderBase]: For 8526/8590 co-relation queries the response was YES. [2024-01-27 16:11:36,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8415 conditions, 2345 events. 1428/2345 cut-off events. For 8526/8590 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 13387 event pairs, 175 based on Foata normal form. 152/2413 useless extension candidates. Maximal degree in co-relation 8383. Up to 1215 conditions per place. [2024-01-27 16:11:36,914 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 57 selfloop transitions, 5 changer transitions 0/76 dead transitions. [2024-01-27 16:11:36,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 76 transitions, 574 flow [2024-01-27 16:11:36,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 16:11:36,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 16:11:36,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2024-01-27 16:11:36,916 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.66875 [2024-01-27 16:11:36,917 INFO L175 Difference]: Start difference. First operand has 72 places, 48 transitions, 287 flow. Second operand 4 states and 107 transitions. [2024-01-27 16:11:36,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 76 transitions, 574 flow [2024-01-27 16:11:36,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 76 transitions, 531 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-01-27 16:11:36,924 INFO L231 Difference]: Finished difference. Result has 66 places, 51 transitions, 291 flow [2024-01-27 16:11:36,924 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=291, PETRI_PLACES=66, PETRI_TRANSITIONS=51} [2024-01-27 16:11:36,926 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 20 predicate places. [2024-01-27 16:11:36,926 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 51 transitions, 291 flow [2024-01-27 16:11:36,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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) [2024-01-27 16:11:36,927 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:11:36,927 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] [2024-01-27 16:11:36,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-27 16:11:36,927 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:11:36,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:11:36,927 INFO L85 PathProgramCache]: Analyzing trace with hash -215491072, now seen corresponding path program 1 times [2024-01-27 16:11:36,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:11:36,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279733287] [2024-01-27 16:11:36,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:11:36,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:11:36,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:11:37,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:11:37,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:11:37,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279733287] [2024-01-27 16:11:37,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279733287] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:11:37,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:11:37,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 16:11:37,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183478147] [2024-01-27 16:11:37,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:11:37,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 16:11:37,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:11:37,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 16:11:37,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-27 16:11:37,048 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2024-01-27 16:11:37,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 51 transitions, 291 flow. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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) [2024-01-27 16:11:37,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:11:37,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2024-01-27 16:11:37,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:11:37,257 INFO L124 PetriNetUnfolderBase]: 1061/1802 cut-off events. [2024-01-27 16:11:37,257 INFO L125 PetriNetUnfolderBase]: For 5036/5087 co-relation queries the response was YES. [2024-01-27 16:11:37,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6260 conditions, 1802 events. 1061/1802 cut-off events. For 5036/5087 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 9740 event pairs, 124 based on Foata normal form. 126/1846 useless extension candidates. Maximal degree in co-relation 6231. Up to 549 conditions per place. [2024-01-27 16:11:37,288 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 62 selfloop transitions, 8 changer transitions 0/84 dead transitions. [2024-01-27 16:11:37,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 84 transitions, 607 flow [2024-01-27 16:11:37,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 16:11:37,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 16:11:37,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions. [2024-01-27 16:11:37,292 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.68 [2024-01-27 16:11:37,292 INFO L175 Difference]: Start difference. First operand has 66 places, 51 transitions, 291 flow. Second operand 5 states and 136 transitions. [2024-01-27 16:11:37,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 84 transitions, 607 flow [2024-01-27 16:11:37,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 84 transitions, 555 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-01-27 16:11:37,297 INFO L231 Difference]: Finished difference. Result has 67 places, 52 transitions, 296 flow [2024-01-27 16:11:37,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=296, PETRI_PLACES=67, PETRI_TRANSITIONS=52} [2024-01-27 16:11:37,298 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 21 predicate places. [2024-01-27 16:11:37,298 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 52 transitions, 296 flow [2024-01-27 16:11:37,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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) [2024-01-27 16:11:37,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:11:37,298 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] [2024-01-27 16:11:37,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-27 16:11:37,298 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:11:37,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:11:37,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1220269221, now seen corresponding path program 1 times [2024-01-27 16:11:37,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:11:37,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322024489] [2024-01-27 16:11:37,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:11:37,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:11:37,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:11:37,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:11:37,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:11:37,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322024489] [2024-01-27 16:11:37,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322024489] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:11:37,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:11:37,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 16:11:37,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679684972] [2024-01-27 16:11:37,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:11:37,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 16:11:37,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:11:37,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 16:11:37,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-01-27 16:11:37,452 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2024-01-27 16:11:37,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 52 transitions, 296 flow. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 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) [2024-01-27 16:11:37,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:11:37,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2024-01-27 16:11:37,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:11:37,649 INFO L124 PetriNetUnfolderBase]: 817/1390 cut-off events. [2024-01-27 16:11:37,650 INFO L125 PetriNetUnfolderBase]: For 3976/4008 co-relation queries the response was YES. [2024-01-27 16:11:37,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4962 conditions, 1390 events. 817/1390 cut-off events. For 3976/4008 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 7201 event pairs, 94 based on Foata normal form. 65/1372 useless extension candidates. Maximal degree in co-relation 4933. Up to 483 conditions per place. [2024-01-27 16:11:37,664 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 57 selfloop transitions, 11 changer transitions 0/82 dead transitions. [2024-01-27 16:11:37,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 82 transitions, 561 flow [2024-01-27 16:11:37,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 16:11:37,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 16:11:37,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2024-01-27 16:11:37,665 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6208333333333333 [2024-01-27 16:11:37,665 INFO L175 Difference]: Start difference. First operand has 67 places, 52 transitions, 296 flow. Second operand 6 states and 149 transitions. [2024-01-27 16:11:37,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 82 transitions, 561 flow [2024-01-27 16:11:37,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 82 transitions, 519 flow, removed 13 selfloop flow, removed 4 redundant places. [2024-01-27 16:11:37,674 INFO L231 Difference]: Finished difference. Result has 70 places, 53 transitions, 302 flow [2024-01-27 16:11:37,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=302, PETRI_PLACES=70, PETRI_TRANSITIONS=53} [2024-01-27 16:11:37,675 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 24 predicate places. [2024-01-27 16:11:37,676 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 53 transitions, 302 flow [2024-01-27 16:11:37,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 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) [2024-01-27 16:11:37,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:11:37,676 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] [2024-01-27 16:11:37,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-27 16:11:37,677 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:11:37,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:11:37,677 INFO L85 PathProgramCache]: Analyzing trace with hash 259693209, now seen corresponding path program 1 times [2024-01-27 16:11:37,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:11:37,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253599724] [2024-01-27 16:11:37,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:11:37,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:11:37,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:11:37,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:11:37,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:11:37,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253599724] [2024-01-27 16:11:37,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253599724] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:11:37,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:11:37,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-01-27 16:11:37,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724905064] [2024-01-27 16:11:37,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:11:37,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-27 16:11:37,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:11:37,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-27 16:11:37,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-01-27 16:11:38,009 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 40 [2024-01-27 16:11:38,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 53 transitions, 302 flow. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 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) [2024-01-27 16:11:38,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:11:38,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 40 [2024-01-27 16:11:38,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:11:38,346 INFO L124 PetriNetUnfolderBase]: 1256/2335 cut-off events. [2024-01-27 16:11:38,346 INFO L125 PetriNetUnfolderBase]: For 5251/5789 co-relation queries the response was YES. [2024-01-27 16:11:38,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7269 conditions, 2335 events. 1256/2335 cut-off events. For 5251/5789 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 14787 event pairs, 312 based on Foata normal form. 70/2211 useless extension candidates. Maximal degree in co-relation 7240. Up to 1009 conditions per place. [2024-01-27 16:11:38,357 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 43 selfloop transitions, 4 changer transitions 43/112 dead transitions. [2024-01-27 16:11:38,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 112 transitions, 729 flow [2024-01-27 16:11:38,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-27 16:11:38,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-27 16:11:38,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 174 transitions. [2024-01-27 16:11:38,359 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.54375 [2024-01-27 16:11:38,359 INFO L175 Difference]: Start difference. First operand has 70 places, 53 transitions, 302 flow. Second operand 8 states and 174 transitions. [2024-01-27 16:11:38,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 112 transitions, 729 flow [2024-01-27 16:11:38,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 112 transitions, 669 flow, removed 24 selfloop flow, removed 7 redundant places. [2024-01-27 16:11:38,373 INFO L231 Difference]: Finished difference. Result has 76 places, 55 transitions, 305 flow [2024-01-27 16:11:38,374 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=305, PETRI_PLACES=76, PETRI_TRANSITIONS=55} [2024-01-27 16:11:38,374 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 30 predicate places. [2024-01-27 16:11:38,374 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 55 transitions, 305 flow [2024-01-27 16:11:38,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 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) [2024-01-27 16:11:38,375 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:11:38,375 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] [2024-01-27 16:11:38,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-27 16:11:38,375 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:11:38,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:11:38,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1773549921, now seen corresponding path program 2 times [2024-01-27 16:11:38,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:11:38,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336372236] [2024-01-27 16:11:38,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:11:38,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:11:38,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:11:38,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:11:38,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:11:38,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336372236] [2024-01-27 16:11:38,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336372236] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:11:38,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:11:38,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-01-27 16:11:38,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540445966] [2024-01-27 16:11:38,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:11:38,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-27 16:11:38,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:11:38,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-27 16:11:38,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-01-27 16:11:38,663 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 40 [2024-01-27 16:11:38,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 55 transitions, 305 flow. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 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) [2024-01-27 16:11:38,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:11:38,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 40 [2024-01-27 16:11:38,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:11:38,984 INFO L124 PetriNetUnfolderBase]: 1073/2072 cut-off events. [2024-01-27 16:11:38,984 INFO L125 PetriNetUnfolderBase]: For 2302/2558 co-relation queries the response was YES. [2024-01-27 16:11:38,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5871 conditions, 2072 events. 1073/2072 cut-off events. For 2302/2558 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 13882 event pairs, 216 based on Foata normal form. 49/1926 useless extension candidates. Maximal degree in co-relation 5840. Up to 822 conditions per place. [2024-01-27 16:11:38,993 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 29 selfloop transitions, 3 changer transitions 37/89 dead transitions. [2024-01-27 16:11:38,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 89 transitions, 562 flow [2024-01-27 16:11:38,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-27 16:11:38,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-27 16:11:38,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 161 transitions. [2024-01-27 16:11:38,995 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.503125 [2024-01-27 16:11:38,995 INFO L175 Difference]: Start difference. First operand has 76 places, 55 transitions, 305 flow. Second operand 8 states and 161 transitions. [2024-01-27 16:11:38,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 89 transitions, 562 flow [2024-01-27 16:11:39,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 89 transitions, 542 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-01-27 16:11:39,005 INFO L231 Difference]: Finished difference. Result has 79 places, 45 transitions, 238 flow [2024-01-27 16:11:39,005 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=238, PETRI_PLACES=79, PETRI_TRANSITIONS=45} [2024-01-27 16:11:39,006 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 33 predicate places. [2024-01-27 16:11:39,006 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 45 transitions, 238 flow [2024-01-27 16:11:39,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 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) [2024-01-27 16:11:39,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:11:39,006 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:11:39,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-27 16:11:39,007 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:11:39,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:11:39,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1457648025, now seen corresponding path program 3 times [2024-01-27 16:11:39,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:11:39,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123016530] [2024-01-27 16:11:39,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:11:39,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:11:39,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:11:39,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:11:39,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:11:39,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123016530] [2024-01-27 16:11:39,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123016530] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:11:39,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:11:39,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-01-27 16:11:39,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916965075] [2024-01-27 16:11:39,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:11:39,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-01-27 16:11:39,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:11:39,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-01-27 16:11:39,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-01-27 16:11:39,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40 [2024-01-27 16:11:39,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 45 transitions, 238 flow. Second operand has 11 states, 11 states have (on average 17.545454545454547) internal successors, (193), 11 states have internal predecessors, (193), 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) [2024-01-27 16:11:39,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:11:39,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40 [2024-01-27 16:11:39,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:11:40,007 INFO L124 PetriNetUnfolderBase]: 639/1348 cut-off events. [2024-01-27 16:11:40,007 INFO L125 PetriNetUnfolderBase]: For 1516/1712 co-relation queries the response was YES. [2024-01-27 16:11:40,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3867 conditions, 1348 events. 639/1348 cut-off events. For 1516/1712 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 8352 event pairs, 177 based on Foata normal form. 29/1251 useless extension candidates. Maximal degree in co-relation 3834. Up to 444 conditions per place. [2024-01-27 16:11:40,014 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 27 selfloop transitions, 3 changer transitions 28/80 dead transitions. [2024-01-27 16:11:40,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 80 transitions, 468 flow [2024-01-27 16:11:40,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-27 16:11:40,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-01-27 16:11:40,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 200 transitions. [2024-01-27 16:11:40,016 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2024-01-27 16:11:40,016 INFO L175 Difference]: Start difference. First operand has 79 places, 45 transitions, 238 flow. Second operand 9 states and 200 transitions. [2024-01-27 16:11:40,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 80 transitions, 468 flow [2024-01-27 16:11:40,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 80 transitions, 436 flow, removed 8 selfloop flow, removed 11 redundant places. [2024-01-27 16:11:40,022 INFO L231 Difference]: Finished difference. Result has 75 places, 44 transitions, 224 flow [2024-01-27 16:11:40,023 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=224, PETRI_PLACES=75, PETRI_TRANSITIONS=44} [2024-01-27 16:11:40,023 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 29 predicate places. [2024-01-27 16:11:40,024 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 44 transitions, 224 flow [2024-01-27 16:11:40,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 17.545454545454547) internal successors, (193), 11 states have internal predecessors, (193), 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) [2024-01-27 16:11:40,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:11:40,024 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] [2024-01-27 16:11:40,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-27 16:11:40,024 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:11:40,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:11:40,025 INFO L85 PathProgramCache]: Analyzing trace with hash 210800045, now seen corresponding path program 4 times [2024-01-27 16:11:40,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:11:40,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409892976] [2024-01-27 16:11:40,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:11:40,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:11:40,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 16:11:40,051 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-27 16:11:40,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 16:11:40,094 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-27 16:11:40,094 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-27 16:11:40,095 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-01-27 16:11:40,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-01-27 16:11:40,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-01-27 16:11:40,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-01-27 16:11:40,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-01-27 16:11:40,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-01-27 16:11:40,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-01-27 16:11:40,097 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:11:40,101 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-27 16:11:40,101 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-27 16:11:40,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 04:11:40 BasicIcfg [2024-01-27 16:11:40,157 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-27 16:11:40,158 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-01-27 16:11:40,158 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-01-27 16:11:40,159 INFO L274 PluginConnector]: Witness Printer initialized [2024-01-27 16:11:40,159 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:11:31" (3/4) ... [2024-01-27 16:11:40,160 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2024-01-27 16:11:40,245 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-01-27 16:11:40,245 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-01-27 16:11:40,246 INFO L158 Benchmark]: Toolchain (without parser) took 9732.23ms. Allocated memory was 174.1MB in the beginning and 444.6MB in the end (delta: 270.5MB). Free memory was 106.5MB in the beginning and 193.4MB in the end (delta: -86.8MB). Peak memory consumption was 183.0MB. Max. memory is 16.1GB. [2024-01-27 16:11:40,246 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 96.5MB. Free memory is still 43.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 16:11:40,246 INFO L158 Benchmark]: CACSL2BoogieTranslator took 399.17ms. Allocated memory is still 174.1MB. Free memory was 106.1MB in the beginning and 130.1MB in the end (delta: -24.0MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. [2024-01-27 16:11:40,247 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.88ms. Allocated memory is still 174.1MB. Free memory was 130.1MB in the beginning and 127.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 16:11:40,247 INFO L158 Benchmark]: Boogie Preprocessor took 55.94ms. Allocated memory is still 174.1MB. Free memory was 127.4MB in the beginning and 123.9MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-27 16:11:40,247 INFO L158 Benchmark]: RCFGBuilder took 595.84ms. Allocated memory is still 174.1MB. Free memory was 123.9MB in the beginning and 133.2MB in the end (delta: -9.3MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-01-27 16:11:40,247 INFO L158 Benchmark]: TraceAbstraction took 8524.86ms. Allocated memory was 174.1MB in the beginning and 444.6MB in the end (delta: 270.5MB). Free memory was 133.2MB in the beginning and 204.9MB in the end (delta: -71.7MB). Peak memory consumption was 198.5MB. Max. memory is 16.1GB. [2024-01-27 16:11:40,247 INFO L158 Benchmark]: Witness Printer took 87.28ms. Allocated memory is still 444.6MB. Free memory was 204.9MB in the beginning and 193.4MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-01-27 16:11:40,250 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 96.5MB. Free memory is still 43.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 399.17ms. Allocated memory is still 174.1MB. Free memory was 106.1MB in the beginning and 130.1MB in the end (delta: -24.0MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.88ms. Allocated memory is still 174.1MB. Free memory was 130.1MB in the beginning and 127.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.94ms. Allocated memory is still 174.1MB. Free memory was 127.4MB in the beginning and 123.9MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 595.84ms. Allocated memory is still 174.1MB. Free memory was 123.9MB in the beginning and 133.2MB in the end (delta: -9.3MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * TraceAbstraction took 8524.86ms. Allocated memory was 174.1MB in the beginning and 444.6MB in the end (delta: 270.5MB). Free memory was 133.2MB in the beginning and 204.9MB in the end (delta: -71.7MB). Peak memory consumption was 198.5MB. Max. memory is 16.1GB. * Witness Printer took 87.28ms. Allocated memory is still 444.6MB. Free memory was 204.9MB in the beginning and 193.4MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * 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; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff0_thd3; [L726] 0 _Bool x$r_buff1_thd0; [L727] 0 _Bool x$r_buff1_thd1; [L728] 0 _Bool x$r_buff1_thd2; [L729] 0 _Bool x$r_buff1_thd3; [L730] 0 _Bool x$read_delayed; [L731] 0 int *x$read_delayed_var; [L732] 0 int x$w_buff0; [L733] 0 _Bool x$w_buff0_used; [L734] 0 int x$w_buff1; [L735] 0 _Bool x$w_buff1_used; [L737] 0 int y = 0; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L825] 0 pthread_t t515; [L826] FCALL, FORK 0 pthread_create(&t515, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t515={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L827] 0 pthread_t t516; [L828] FCALL, FORK 0 pthread_create(&t516, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t515={5:0}, t516={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L829] 0 pthread_t t517; [L830] FCALL, FORK 0 pthread_create(&t517, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t515={5:0}, t516={6:0}, t517={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L765] 2 x$w_buff1 = x$w_buff0 [L766] 2 x$w_buff0 = 2 [L767] 2 x$w_buff1_used = x$w_buff0_used [L768] 2 x$w_buff0_used = (_Bool)1 [L769] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L769] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L770] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L771] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L772] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L773] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L774] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L777] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L794] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L797] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L800] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L745] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L751] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L752] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L753] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L754] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L755] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L780] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L781] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L782] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L783] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L784] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L803] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L804] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L805] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L806] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L807] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t515={5:0}, t516={6:0}, t517={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L834] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L834] RET 0 assume_abort_if_not(main$tmp_guard0) [L836] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L837] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L838] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L839] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L840] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t515={5:0}, t516={6:0}, t517={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L843] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L844] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L845] 0 x$flush_delayed = weak$$choice2 [L846] 0 x$mem_tmp = x [L847] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L848] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L849] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L850] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L851] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L853] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L854] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L855] 0 x = x$flush_delayed ? x$mem_tmp : x [L856] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t515={5:0}, t516={6:0}, t517={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L858] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 826]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 830]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 66 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: 8.4s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 611 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 587 mSDsluCounter, 262 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 225 mSDsCounter, 73 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1903 IncrementalHoareTripleChecker+Invalid, 1976 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 73 mSolverCounterUnsat, 37 mSDtfsCounter, 1903 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=305occurred in iteration=11, InterpolantAutomatonStates: 92, 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.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 305 NumberOfCodeBlocks, 305 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 262 ConstructedInterpolants, 0 QuantifiedInterpolants, 2298 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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! [2024-01-27 16:11:40,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE