./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe014_power.opt.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/safe014_power.opt.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 9b910ee0748a7f7121f7d4562c55923dd0d235550d07c5b976ef4d5cc3d7332e --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a340643-m [2024-01-27 16:15:51,995 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 16:15:52,075 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 16:15:52,080 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 16:15:52,080 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 16:15:52,103 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 16:15:52,104 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 16:15:52,104 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 16:15:52,104 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 16:15:52,107 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 16:15:52,107 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 16:15:52,107 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 16:15:52,108 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 16:15:52,109 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 16:15:52,109 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 16:15:52,109 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 16:15:52,109 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 16:15:52,109 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 16:15:52,109 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 16:15:52,109 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 16:15:52,109 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 16:15:52,110 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 16:15:52,110 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 16:15:52,110 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 16:15:52,110 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 16:15:52,110 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 16:15:52,110 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 16:15:52,111 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 16:15:52,111 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 16:15:52,111 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 16:15:52,112 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 16:15:52,112 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 16:15:52,112 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 16:15:52,112 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 16:15:52,112 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 16:15:52,112 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 16:15:52,112 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 16:15:52,112 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 16:15:52,113 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 16:15:52,113 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 16:15:52,113 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 16:15:52,113 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 16:15:52,113 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 16:15:52,113 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 -> 9b910ee0748a7f7121f7d4562c55923dd0d235550d07c5b976ef4d5cc3d7332e [2024-01-27 16:15:52,296 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 16:15:52,312 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 16:15:52,314 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 16:15:52,315 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 16:15:52,315 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 16:15:52,316 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe014_power.opt.i [2024-01-27 16:15:53,296 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 16:15:53,482 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 16:15:53,483 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe014_power.opt.i [2024-01-27 16:15:53,498 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab9299701/541558e32a634514957484b9d0422759/FLAGe2e07fa2e [2024-01-27 16:15:53,510 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab9299701/541558e32a634514957484b9d0422759 [2024-01-27 16:15:53,512 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 16:15:53,513 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-01-27 16:15:53,514 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 16:15:53,514 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 16:15:53,518 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 16:15:53,518 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 04:15:53" (1/1) ... [2024-01-27 16:15:53,519 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bf24c0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:15:53, skipping insertion in model container [2024-01-27 16:15:53,519 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 04:15:53" (1/1) ... [2024-01-27 16:15:53,549 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 16:15:53,673 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/safe014_power.opt.i[994,1007] [2024-01-27 16:15:53,851 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 16:15:53,859 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 16:15:53,867 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/safe014_power.opt.i[994,1007] [2024-01-27 16:15:53,902 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 16:15:53,929 INFO L206 MainTranslator]: Completed translation [2024-01-27 16:15:53,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:15:53 WrapperNode [2024-01-27 16:15:53,930 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 16:15:53,931 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 16:15:53,932 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 16:15:53,932 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 16:15:53,937 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:15:53" (1/1) ... [2024-01-27 16:15:53,958 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:15:53" (1/1) ... [2024-01-27 16:15:53,976 INFO L138 Inliner]: procedures = 176, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 180 [2024-01-27 16:15:53,976 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 16:15:53,977 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 16:15:53,977 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 16:15:53,977 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 16:15:53,985 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:15:53" (1/1) ... [2024-01-27 16:15:53,986 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:15:53" (1/1) ... [2024-01-27 16:15:53,988 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:15:53" (1/1) ... [2024-01-27 16:15:54,023 INFO L175 MemorySlicer]: Split 19 memory accesses to 5 slices as follows [2, 14, 1, 1, 1]. 74 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0, 0, 0]. The 7 writes are split as follows [0, 4, 1, 1, 1]. [2024-01-27 16:15:54,023 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:15:53" (1/1) ... [2024-01-27 16:15:54,023 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:15:53" (1/1) ... [2024-01-27 16:15:54,037 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:15:53" (1/1) ... [2024-01-27 16:15:54,049 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:15:53" (1/1) ... [2024-01-27 16:15:54,051 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:15:53" (1/1) ... [2024-01-27 16:15:54,053 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:15:53" (1/1) ... [2024-01-27 16:15:54,059 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 16:15:54,060 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 16:15:54,060 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 16:15:54,060 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 16:15:54,061 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:15:53" (1/1) ... [2024-01-27 16:15:54,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 16:15:54,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:15:54,116 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:15:54,118 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:15:54,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-27 16:15:54,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-27 16:15:54,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-27 16:15:54,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-27 16:15:54,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-01-27 16:15:54,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 16:15:54,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 16:15:54,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 16:15:54,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-27 16:15:54,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-27 16:15:54,155 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-27 16:15:54,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 16:15:54,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 16:15:54,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 16:15:54,155 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-01-27 16:15:54,155 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-01-27 16:15:54,155 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-01-27 16:15:54,156 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-01-27 16:15:54,156 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-01-27 16:15:54,156 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-01-27 16:15:54,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 16:15:54,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 16:15:54,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 16:15:54,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-27 16:15:54,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-27 16:15:54,157 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-27 16:15:54,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 16:15:54,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 16:15:54,158 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:15:54,278 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 16:15:54,280 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 16:15:54,559 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 16:15:54,559 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 16:15:54,740 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 16:15:54,740 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-27 16:15:54,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:15:54 BoogieIcfgContainer [2024-01-27 16:15:54,741 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 16:15:54,742 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 16:15:54,742 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 16:15:54,745 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 16:15:54,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 04:15:53" (1/3) ... [2024-01-27 16:15:54,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4058e3d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 04:15:54, skipping insertion in model container [2024-01-27 16:15:54,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:15:53" (2/3) ... [2024-01-27 16:15:54,747 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4058e3d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 04:15:54, skipping insertion in model container [2024-01-27 16:15:54,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:15:54" (3/3) ... [2024-01-27 16:15:54,748 INFO L112 eAbstractionObserver]: Analyzing ICFG safe014_power.opt.i [2024-01-27 16:15:54,755 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-27 16:15:54,786 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 16:15:54,786 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-01-27 16:15:54,786 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 16:15:54,827 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-01-27 16:15:54,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 39 transitions, 90 flow [2024-01-27 16:15:54,885 INFO L124 PetriNetUnfolderBase]: 1/36 cut-off events. [2024-01-27 16:15:54,885 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 16:15:54,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 36 events. 1/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 66 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2024-01-27 16:15:54,889 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 39 transitions, 90 flow [2024-01-27 16:15:54,891 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 36 transitions, 81 flow [2024-01-27 16:15:54,906 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 16:15:54,913 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;@e89370d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 16:15:54,913 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-01-27 16:15:54,924 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 16:15:54,924 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2024-01-27 16:15:54,925 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 16:15:54,925 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:15:54,925 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:15:54,926 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:15:54,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:15:54,929 INFO L85 PathProgramCache]: Analyzing trace with hash -615730506, now seen corresponding path program 1 times [2024-01-27 16:15:54,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:15:54,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106160294] [2024-01-27 16:15:54,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:15:54,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:15:55,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:15:55,353 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:15:55,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:15:55,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106160294] [2024-01-27 16:15:55,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106160294] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:15:55,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:15:55,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 16:15:55,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087718711] [2024-01-27 16:15:55,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:15:55,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 16:15:55,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:15:55,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 16:15:55,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 16:15:55,385 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 39 [2024-01-27 16:15:55,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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:15:55,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:15:55,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 39 [2024-01-27 16:15:55,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:15:55,613 INFO L124 PetriNetUnfolderBase]: 317/601 cut-off events. [2024-01-27 16:15:55,613 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 16:15:55,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1130 conditions, 601 events. 317/601 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3527 event pairs, 62 based on Foata normal form. 24/601 useless extension candidates. Maximal degree in co-relation 1119. Up to 382 conditions per place. [2024-01-27 16:15:55,623 INFO L140 encePairwiseOnDemand]: 35/39 looper letters, 23 selfloop transitions, 2 changer transitions 2/43 dead transitions. [2024-01-27 16:15:55,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 43 transitions, 149 flow [2024-01-27 16:15:55,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 16:15:55,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 16:15:55,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2024-01-27 16:15:55,632 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7435897435897436 [2024-01-27 16:15:55,634 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 81 flow. Second operand 3 states and 87 transitions. [2024-01-27 16:15:55,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 43 transitions, 149 flow [2024-01-27 16:15:55,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 43 transitions, 146 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-27 16:15:55,639 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 76 flow [2024-01-27 16:15:55,641 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2024-01-27 16:15:55,644 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -2 predicate places. [2024-01-27 16:15:55,645 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 76 flow [2024-01-27 16:15:55,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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:15:55,645 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:15:55,645 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:15:55,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 16:15:55,646 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:15:55,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:15:55,646 INFO L85 PathProgramCache]: Analyzing trace with hash 443873552, now seen corresponding path program 1 times [2024-01-27 16:15:55,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:15:55,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015928656] [2024-01-27 16:15:55,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:15:55,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:15:55,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:15:55,878 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:15:55,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:15:55,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015928656] [2024-01-27 16:15:55,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015928656] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:15:55,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:15:55,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 16:15:55,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317428623] [2024-01-27 16:15:55,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:15:55,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 16:15:55,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:15:55,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 16:15:55,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-27 16:15:55,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2024-01-27 16:15:55,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 76 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 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:15:55,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:15:55,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2024-01-27 16:15:55,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:15:56,315 INFO L124 PetriNetUnfolderBase]: 983/1690 cut-off events. [2024-01-27 16:15:56,316 INFO L125 PetriNetUnfolderBase]: For 120/120 co-relation queries the response was YES. [2024-01-27 16:15:56,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3340 conditions, 1690 events. 983/1690 cut-off events. For 120/120 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 10832 event pairs, 137 based on Foata normal form. 0/1633 useless extension candidates. Maximal degree in co-relation 3330. Up to 838 conditions per place. [2024-01-27 16:15:56,322 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 28 selfloop transitions, 2 changer transitions 39/81 dead transitions. [2024-01-27 16:15:56,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 81 transitions, 324 flow [2024-01-27 16:15:56,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-27 16:15:56,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-27 16:15:56,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 191 transitions. [2024-01-27 16:15:56,328 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6121794871794872 [2024-01-27 16:15:56,328 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 76 flow. Second operand 8 states and 191 transitions. [2024-01-27 16:15:56,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 81 transitions, 324 flow [2024-01-27 16:15:56,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 81 transitions, 308 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 16:15:56,334 INFO L231 Difference]: Finished difference. Result has 52 places, 32 transitions, 86 flow [2024-01-27 16:15:56,335 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=86, PETRI_PLACES=52, PETRI_TRANSITIONS=32} [2024-01-27 16:15:56,336 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places. [2024-01-27 16:15:56,336 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 32 transitions, 86 flow [2024-01-27 16:15:56,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 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:15:56,337 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:15:56,337 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:15:56,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 16:15:56,337 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:15:56,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:15:56,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1835715119, now seen corresponding path program 1 times [2024-01-27 16:15:56,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:15:56,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941153858] [2024-01-27 16:15:56,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:15:56,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:15:56,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:15:56,547 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:15:56,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:15:56,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941153858] [2024-01-27 16:15:56,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941153858] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:15:56,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:15:56,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 16:15:56,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904775444] [2024-01-27 16:15:56,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:15:56,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 16:15:56,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:15:56,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 16:15:56,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-27 16:15:56,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2024-01-27 16:15:56,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 32 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 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:15:56,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:15:56,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2024-01-27 16:15:56,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:15:56,863 INFO L124 PetriNetUnfolderBase]: 671/1180 cut-off events. [2024-01-27 16:15:56,863 INFO L125 PetriNetUnfolderBase]: For 231/231 co-relation queries the response was YES. [2024-01-27 16:15:56,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2571 conditions, 1180 events. 671/1180 cut-off events. For 231/231 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7139 event pairs, 365 based on Foata normal form. 36/1180 useless extension candidates. Maximal degree in co-relation 2556. Up to 673 conditions per place. [2024-01-27 16:15:56,868 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 28 selfloop transitions, 2 changer transitions 27/69 dead transitions. [2024-01-27 16:15:56,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 69 transitions, 286 flow [2024-01-27 16:15:56,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-27 16:15:56,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-27 16:15:56,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 164 transitions. [2024-01-27 16:15:56,870 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6007326007326007 [2024-01-27 16:15:56,870 INFO L175 Difference]: Start difference. First operand has 52 places, 32 transitions, 86 flow. Second operand 7 states and 164 transitions. [2024-01-27 16:15:56,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 69 transitions, 286 flow [2024-01-27 16:15:56,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 69 transitions, 266 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-01-27 16:15:56,874 INFO L231 Difference]: Finished difference. Result has 51 places, 32 transitions, 90 flow [2024-01-27 16:15:56,874 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=90, PETRI_PLACES=51, PETRI_TRANSITIONS=32} [2024-01-27 16:15:56,875 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 6 predicate places. [2024-01-27 16:15:56,875 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 32 transitions, 90 flow [2024-01-27 16:15:56,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 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:15:56,875 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:15:56,875 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:15:56,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 16:15:56,876 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:15:56,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:15:56,876 INFO L85 PathProgramCache]: Analyzing trace with hash 2073211599, now seen corresponding path program 1 times [2024-01-27 16:15:56,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:15:56,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808877715] [2024-01-27 16:15:56,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:15:56,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:15:56,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:15:56,979 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:15:56,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:15:56,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808877715] [2024-01-27 16:15:56,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808877715] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:15:56,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:15:56,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 16:15:56,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088020973] [2024-01-27 16:15:56,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:15:56,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 16:15:56,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:15:56,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 16:15:56,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-27 16:15:56,985 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 39 [2024-01-27 16:15:56,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 32 transitions, 90 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:15:56,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:15:56,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 39 [2024-01-27 16:15:56,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:15:57,204 INFO L124 PetriNetUnfolderBase]: 457/813 cut-off events. [2024-01-27 16:15:57,204 INFO L125 PetriNetUnfolderBase]: For 237/252 co-relation queries the response was YES. [2024-01-27 16:15:57,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1798 conditions, 813 events. 457/813 cut-off events. For 237/252 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4844 event pairs, 95 based on Foata normal form. 30/831 useless extension candidates. Maximal degree in co-relation 1783. Up to 491 conditions per place. [2024-01-27 16:15:57,208 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 23 selfloop transitions, 2 changer transitions 23/61 dead transitions. [2024-01-27 16:15:57,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 61 transitions, 256 flow [2024-01-27 16:15:57,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-27 16:15:57,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-27 16:15:57,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 162 transitions. [2024-01-27 16:15:57,209 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5934065934065934 [2024-01-27 16:15:57,209 INFO L175 Difference]: Start difference. First operand has 51 places, 32 transitions, 90 flow. Second operand 7 states and 162 transitions. [2024-01-27 16:15:57,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 61 transitions, 256 flow [2024-01-27 16:15:57,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 61 transitions, 236 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-01-27 16:15:57,212 INFO L231 Difference]: Finished difference. Result has 52 places, 32 transitions, 94 flow [2024-01-27 16:15:57,213 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=94, PETRI_PLACES=52, PETRI_TRANSITIONS=32} [2024-01-27 16:15:57,213 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places. [2024-01-27 16:15:57,213 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 32 transitions, 94 flow [2024-01-27 16:15:57,214 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:15:57,214 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:15:57,214 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:15:57,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 16:15:57,214 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:15:57,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:15:57,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1683110748, now seen corresponding path program 1 times [2024-01-27 16:15:57,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:15:57,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951461540] [2024-01-27 16:15:57,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:15:57,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:15:57,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:15:57,350 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:15:57,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:15:57,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951461540] [2024-01-27 16:15:57,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951461540] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:15:57,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:15:57,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 16:15:57,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588366350] [2024-01-27 16:15:57,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:15:57,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 16:15:57,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:15:57,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 16:15:57,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-27 16:15:57,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 39 [2024-01-27 16:15:57,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 32 transitions, 94 flow. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 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:15:57,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:15:57,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 39 [2024-01-27 16:15:57,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:15:57,540 INFO L124 PetriNetUnfolderBase]: 339/724 cut-off events. [2024-01-27 16:15:57,541 INFO L125 PetriNetUnfolderBase]: For 248/260 co-relation queries the response was YES. [2024-01-27 16:15:57,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1495 conditions, 724 events. 339/724 cut-off events. For 248/260 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4450 event pairs, 59 based on Foata normal form. 24/732 useless extension candidates. Maximal degree in co-relation 1478. Up to 353 conditions per place. [2024-01-27 16:15:57,546 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 27 selfloop transitions, 2 changer transitions 23/66 dead transitions. [2024-01-27 16:15:57,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 66 transitions, 284 flow [2024-01-27 16:15:57,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-27 16:15:57,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-27 16:15:57,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 173 transitions. [2024-01-27 16:15:57,549 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6336996336996337 [2024-01-27 16:15:57,549 INFO L175 Difference]: Start difference. First operand has 52 places, 32 transitions, 94 flow. Second operand 7 states and 173 transitions. [2024-01-27 16:15:57,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 66 transitions, 284 flow [2024-01-27 16:15:57,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 66 transitions, 264 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-01-27 16:15:57,552 INFO L231 Difference]: Finished difference. Result has 53 places, 32 transitions, 98 flow [2024-01-27 16:15:57,553 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=98, PETRI_PLACES=53, PETRI_TRANSITIONS=32} [2024-01-27 16:15:57,554 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 8 predicate places. [2024-01-27 16:15:57,554 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 32 transitions, 98 flow [2024-01-27 16:15:57,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 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:15:57,555 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:15:57,555 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:15:57,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 16:15:57,555 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:15:57,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:15:57,556 INFO L85 PathProgramCache]: Analyzing trace with hash 2102272437, now seen corresponding path program 1 times [2024-01-27 16:15:57,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:15:57,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488349180] [2024-01-27 16:15:57,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:15:57,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:15:57,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:15:58,397 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:15:58,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:15:58,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488349180] [2024-01-27 16:15:58,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488349180] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:15:58,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:15:58,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-27 16:15:58,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294222473] [2024-01-27 16:15:58,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:15:58,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-27 16:15:58,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:15:58,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-27 16:15:58,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-01-27 16:15:58,401 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 39 [2024-01-27 16:15:58,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 32 transitions, 98 flow. Second operand has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 0 states have call successors, (0), 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:15:58,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:15:58,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 39 [2024-01-27 16:15:58,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:15:58,673 INFO L124 PetriNetUnfolderBase]: 315/630 cut-off events. [2024-01-27 16:15:58,674 INFO L125 PetriNetUnfolderBase]: For 311/321 co-relation queries the response was YES. [2024-01-27 16:15:58,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1416 conditions, 630 events. 315/630 cut-off events. For 311/321 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3638 event pairs, 29 based on Foata normal form. 16/638 useless extension candidates. Maximal degree in co-relation 1398. Up to 311 conditions per place. [2024-01-27 16:15:58,677 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 33 selfloop transitions, 6 changer transitions 23/76 dead transitions. [2024-01-27 16:15:58,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 76 transitions, 345 flow [2024-01-27 16:15:58,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-01-27 16:15:58,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-01-27 16:15:58,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 252 transitions. [2024-01-27 16:15:58,679 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5874125874125874 [2024-01-27 16:15:58,679 INFO L175 Difference]: Start difference. First operand has 53 places, 32 transitions, 98 flow. Second operand 11 states and 252 transitions. [2024-01-27 16:15:58,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 76 transitions, 345 flow [2024-01-27 16:15:58,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 76 transitions, 319 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-01-27 16:15:58,682 INFO L231 Difference]: Finished difference. Result has 62 places, 36 transitions, 141 flow [2024-01-27 16:15:58,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=141, PETRI_PLACES=62, PETRI_TRANSITIONS=36} [2024-01-27 16:15:58,685 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 17 predicate places. [2024-01-27 16:15:58,685 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 36 transitions, 141 flow [2024-01-27 16:15:58,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 0 states have call successors, (0), 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:15:58,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:15:58,686 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:15:58,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-27 16:15:58,686 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:15:58,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:15:58,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1058805442, now seen corresponding path program 1 times [2024-01-27 16:15:58,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:15:58,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871923821] [2024-01-27 16:15:58,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:15:58,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:15:58,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:15:59,356 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:15:59,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:15:59,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871923821] [2024-01-27 16:15:59,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871923821] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:15:59,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:15:59,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-01-27 16:15:59,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515960147] [2024-01-27 16:15:59,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:15:59,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-01-27 16:15:59,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:15:59,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-01-27 16:15:59,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-01-27 16:15:59,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 39 [2024-01-27 16:15:59,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 36 transitions, 141 flow. Second operand has 8 states, 8 states have (on average 18.75) internal successors, (150), 8 states have internal predecessors, (150), 0 states have call successors, (0), 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:15:59,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:15:59,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 39 [2024-01-27 16:15:59,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:15:59,626 INFO L124 PetriNetUnfolderBase]: 303/598 cut-off events. [2024-01-27 16:15:59,627 INFO L125 PetriNetUnfolderBase]: For 624/638 co-relation queries the response was YES. [2024-01-27 16:15:59,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1687 conditions, 598 events. 303/598 cut-off events. For 624/638 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3436 event pairs, 34 based on Foata normal form. 16/603 useless extension candidates. Maximal degree in co-relation 1664. Up to 332 conditions per place. [2024-01-27 16:15:59,630 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 36 selfloop transitions, 8 changer transitions 15/73 dead transitions. [2024-01-27 16:15:59,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 73 transitions, 398 flow [2024-01-27 16:15:59,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-27 16:15:59,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-01-27 16:15:59,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 210 transitions. [2024-01-27 16:15:59,631 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5982905982905983 [2024-01-27 16:15:59,632 INFO L175 Difference]: Start difference. First operand has 62 places, 36 transitions, 141 flow. Second operand 9 states and 210 transitions. [2024-01-27 16:15:59,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 73 transitions, 398 flow [2024-01-27 16:15:59,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 73 transitions, 376 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-01-27 16:15:59,635 INFO L231 Difference]: Finished difference. Result has 66 places, 43 transitions, 218 flow [2024-01-27 16:15:59,635 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=218, PETRI_PLACES=66, PETRI_TRANSITIONS=43} [2024-01-27 16:15:59,635 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 21 predicate places. [2024-01-27 16:15:59,635 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 43 transitions, 218 flow [2024-01-27 16:15:59,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.75) internal successors, (150), 8 states have internal predecessors, (150), 0 states have call successors, (0), 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:15:59,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:15:59,636 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:15:59,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-27 16:15:59,636 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:15:59,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:15:59,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1897754274, now seen corresponding path program 2 times [2024-01-27 16:15:59,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:15:59,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713273755] [2024-01-27 16:15:59,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:15:59,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:15:59,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:15:59,782 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:15:59,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:15:59,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713273755] [2024-01-27 16:15:59,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713273755] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:15:59,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:15:59,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 16:15:59,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177331916] [2024-01-27 16:15:59,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:15:59,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 16:15:59,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:15:59,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 16:15:59,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-01-27 16:15:59,792 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-01-27 16:15:59,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 43 transitions, 218 flow. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 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:15:59,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:15:59,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-01-27 16:15:59,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:16:00,095 INFO L124 PetriNetUnfolderBase]: 1002/1817 cut-off events. [2024-01-27 16:16:00,095 INFO L125 PetriNetUnfolderBase]: For 4073/4073 co-relation queries the response was YES. [2024-01-27 16:16:00,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5752 conditions, 1817 events. 1002/1817 cut-off events. For 4073/4073 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 12162 event pairs, 88 based on Foata normal form. 12/1821 useless extension candidates. Maximal degree in co-relation 5725. Up to 684 conditions per place. [2024-01-27 16:16:00,104 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 47 selfloop transitions, 3 changer transitions 35/96 dead transitions. [2024-01-27 16:16:00,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 96 transitions, 718 flow [2024-01-27 16:16:00,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 16:16:00,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 16:16:00,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions. [2024-01-27 16:16:00,105 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5854700854700855 [2024-01-27 16:16:00,106 INFO L175 Difference]: Start difference. First operand has 66 places, 43 transitions, 218 flow. Second operand 6 states and 137 transitions. [2024-01-27 16:16:00,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 96 transitions, 718 flow [2024-01-27 16:16:00,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 96 transitions, 662 flow, removed 28 selfloop flow, removed 4 redundant places. [2024-01-27 16:16:00,115 INFO L231 Difference]: Finished difference. Result has 66 places, 43 transitions, 212 flow [2024-01-27 16:16:00,115 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=212, PETRI_PLACES=66, PETRI_TRANSITIONS=43} [2024-01-27 16:16:00,115 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 21 predicate places. [2024-01-27 16:16:00,115 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 43 transitions, 212 flow [2024-01-27 16:16:00,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 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:16:00,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:16:00,116 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:16:00,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-27 16:16:00,116 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:16:00,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:16:00,117 INFO L85 PathProgramCache]: Analyzing trace with hash 2078793540, now seen corresponding path program 3 times [2024-01-27 16:16:00,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:16:00,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10093695] [2024-01-27 16:16:00,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:16:00,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:16:00,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:16:00,220 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:16:00,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:16:00,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10093695] [2024-01-27 16:16:00,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10093695] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:16:00,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:16:00,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 16:16:00,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084607383] [2024-01-27 16:16:00,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:16:00,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 16:16:00,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:16:00,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 16:16:00,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 16:16:00,226 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2024-01-27 16:16:00,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 43 transitions, 212 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:16:00,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:16:00,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2024-01-27 16:16:00,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:16:00,439 INFO L124 PetriNetUnfolderBase]: 927/1518 cut-off events. [2024-01-27 16:16:00,439 INFO L125 PetriNetUnfolderBase]: For 2510/2510 co-relation queries the response was YES. [2024-01-27 16:16:00,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4552 conditions, 1518 events. 927/1518 cut-off events. For 2510/2510 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 8208 event pairs, 98 based on Foata normal form. 69/1571 useless extension candidates. Maximal degree in co-relation 4524. Up to 818 conditions per place. [2024-01-27 16:16:00,447 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 53 selfloop transitions, 5 changer transitions 1/70 dead transitions. [2024-01-27 16:16:00,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 70 transitions, 464 flow [2024-01-27 16:16:00,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 16:16:00,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 16:16:00,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2024-01-27 16:16:00,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-01-27 16:16:00,448 INFO L175 Difference]: Start difference. First operand has 66 places, 43 transitions, 212 flow. Second operand 4 states and 104 transitions. [2024-01-27 16:16:00,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 70 transitions, 464 flow [2024-01-27 16:16:00,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 70 transitions, 448 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-01-27 16:16:00,453 INFO L231 Difference]: Finished difference. Result has 63 places, 46 transitions, 230 flow [2024-01-27 16:16:00,453 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=230, PETRI_PLACES=63, PETRI_TRANSITIONS=46} [2024-01-27 16:16:00,453 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 18 predicate places. [2024-01-27 16:16:00,453 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 46 transitions, 230 flow [2024-01-27 16:16:00,454 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:16:00,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:16:00,454 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] [2024-01-27 16:16:00,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-27 16:16:00,454 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:16:00,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:16:00,455 INFO L85 PathProgramCache]: Analyzing trace with hash 279366355, now seen corresponding path program 1 times [2024-01-27 16:16:00,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:16:00,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489296876] [2024-01-27 16:16:00,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:16:00,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:16:00,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:16:00,599 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:16:00,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:16:00,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489296876] [2024-01-27 16:16:00,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489296876] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:16:00,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:16:00,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-27 16:16:00,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697005280] [2024-01-27 16:16:00,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:16:00,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 16:16:00,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:16:00,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 16:16:00,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-01-27 16:16:00,607 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-01-27 16:16:00,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 46 transitions, 230 flow. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 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:16:00,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:16:00,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-01-27 16:16:00,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:16:00,985 INFO L124 PetriNetUnfolderBase]: 1124/2029 cut-off events. [2024-01-27 16:16:00,986 INFO L125 PetriNetUnfolderBase]: For 3064/3075 co-relation queries the response was YES. [2024-01-27 16:16:00,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6363 conditions, 2029 events. 1124/2029 cut-off events. For 3064/3075 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 12950 event pairs, 446 based on Foata normal form. 27/1972 useless extension candidates. Maximal degree in co-relation 6337. Up to 861 conditions per place. [2024-01-27 16:16:00,996 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 37 selfloop transitions, 2 changer transitions 48/101 dead transitions. [2024-01-27 16:16:00,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 101 transitions, 711 flow [2024-01-27 16:16:00,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-27 16:16:00,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-27 16:16:00,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 156 transitions. [2024-01-27 16:16:00,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2024-01-27 16:16:00,998 INFO L175 Difference]: Start difference. First operand has 63 places, 46 transitions, 230 flow. Second operand 7 states and 156 transitions. [2024-01-27 16:16:00,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 101 transitions, 711 flow [2024-01-27 16:16:01,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 101 transitions, 697 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-01-27 16:16:01,004 INFO L231 Difference]: Finished difference. Result has 71 places, 46 transitions, 236 flow [2024-01-27 16:16:01,005 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=236, PETRI_PLACES=71, PETRI_TRANSITIONS=46} [2024-01-27 16:16:01,006 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 26 predicate places. [2024-01-27 16:16:01,006 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 46 transitions, 236 flow [2024-01-27 16:16:01,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 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:16:01,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:16:01,007 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] [2024-01-27 16:16:01,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-27 16:16:01,008 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:16:01,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:16:01,008 INFO L85 PathProgramCache]: Analyzing trace with hash 79454045, now seen corresponding path program 2 times [2024-01-27 16:16:01,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:16:01,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511770588] [2024-01-27 16:16:01,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:16:01,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:16:01,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:16:01,146 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:16:01,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:16:01,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511770588] [2024-01-27 16:16:01,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511770588] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:16:01,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:16:01,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 16:16:01,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975606959] [2024-01-27 16:16:01,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:16:01,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 16:16:01,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:16:01,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 16:16:01,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-27 16:16:01,150 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2024-01-27 16:16:01,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 46 transitions, 236 flow. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 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:16:01,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:16:01,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2024-01-27 16:16:01,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:16:01,330 INFO L124 PetriNetUnfolderBase]: 677/1137 cut-off events. [2024-01-27 16:16:01,330 INFO L125 PetriNetUnfolderBase]: For 1871/1887 co-relation queries the response was YES. [2024-01-27 16:16:01,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3600 conditions, 1137 events. 677/1137 cut-off events. For 1871/1887 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5506 event pairs, 35 based on Foata normal form. 64/1185 useless extension candidates. Maximal degree in co-relation 3571. Up to 461 conditions per place. [2024-01-27 16:16:01,337 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 58 selfloop transitions, 8 changer transitions 1/78 dead transitions. [2024-01-27 16:16:01,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 78 transitions, 525 flow [2024-01-27 16:16:01,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 16:16:01,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 16:16:01,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2024-01-27 16:16:01,338 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6717948717948717 [2024-01-27 16:16:01,338 INFO L175 Difference]: Start difference. First operand has 71 places, 46 transitions, 236 flow. Second operand 5 states and 131 transitions. [2024-01-27 16:16:01,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 78 transitions, 525 flow [2024-01-27 16:16:01,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 78 transitions, 501 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-01-27 16:16:01,372 INFO L231 Difference]: Finished difference. Result has 65 places, 46 transitions, 244 flow [2024-01-27 16:16:01,372 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=244, PETRI_PLACES=65, PETRI_TRANSITIONS=46} [2024-01-27 16:16:01,372 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 20 predicate places. [2024-01-27 16:16:01,372 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 46 transitions, 244 flow [2024-01-27 16:16:01,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 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:16:01,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:16:01,373 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] [2024-01-27 16:16:01,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-27 16:16:01,373 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:16:01,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:16:01,374 INFO L85 PathProgramCache]: Analyzing trace with hash 913930428, now seen corresponding path program 1 times [2024-01-27 16:16:01,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:16:01,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034488519] [2024-01-27 16:16:01,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:16:01,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:16:01,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:16:01,497 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:16:01,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:16:01,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034488519] [2024-01-27 16:16:01,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034488519] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:16:01,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:16:01,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 16:16:01,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108893088] [2024-01-27 16:16:01,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:16:01,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 16:16:01,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:16:01,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 16:16:01,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-01-27 16:16:01,503 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2024-01-27 16:16:01,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 46 transitions, 244 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:16:01,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:16:01,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2024-01-27 16:16:01,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:16:01,651 INFO L124 PetriNetUnfolderBase]: 400/682 cut-off events. [2024-01-27 16:16:01,651 INFO L125 PetriNetUnfolderBase]: For 1379/1412 co-relation queries the response was YES. [2024-01-27 16:16:01,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2315 conditions, 682 events. 400/682 cut-off events. For 1379/1412 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2823 event pairs, 24 based on Foata normal form. 40/707 useless extension candidates. Maximal degree in co-relation 2289. Up to 268 conditions per place. [2024-01-27 16:16:01,655 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 47 selfloop transitions, 11 changer transitions 1/70 dead transitions. [2024-01-27 16:16:01,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 70 transitions, 458 flow [2024-01-27 16:16:01,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 16:16:01,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 16:16:01,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 144 transitions. [2024-01-27 16:16:01,656 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6153846153846154 [2024-01-27 16:16:01,657 INFO L175 Difference]: Start difference. First operand has 65 places, 46 transitions, 244 flow. Second operand 6 states and 144 transitions. [2024-01-27 16:16:01,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 70 transitions, 458 flow [2024-01-27 16:16:01,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 70 transitions, 356 flow, removed 22 selfloop flow, removed 14 redundant places. [2024-01-27 16:16:01,661 INFO L231 Difference]: Finished difference. Result has 58 places, 41 transitions, 186 flow [2024-01-27 16:16:01,661 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=186, PETRI_PLACES=58, PETRI_TRANSITIONS=41} [2024-01-27 16:16:01,662 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 13 predicate places. [2024-01-27 16:16:01,662 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 41 transitions, 186 flow [2024-01-27 16:16:01,662 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:16:01,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:16:01,662 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] [2024-01-27 16:16:01,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-27 16:16:01,663 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:16:01,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:16:01,663 INFO L85 PathProgramCache]: Analyzing trace with hash 193802887, now seen corresponding path program 1 times [2024-01-27 16:16:01,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:16:01,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311407421] [2024-01-27 16:16:01,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:16:01,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:16:01,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:16:01,805 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:16:01,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:16:01,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311407421] [2024-01-27 16:16:01,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311407421] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:16:01,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:16:01,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-27 16:16:01,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682035269] [2024-01-27 16:16:01,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:16:01,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 16:16:01,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:16:01,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 16:16:01,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-01-27 16:16:01,816 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-01-27 16:16:01,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 41 transitions, 186 flow. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 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:16:01,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:16:01,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-01-27 16:16:01,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:16:01,974 INFO L124 PetriNetUnfolderBase]: 449/897 cut-off events. [2024-01-27 16:16:01,974 INFO L125 PetriNetUnfolderBase]: For 660/676 co-relation queries the response was YES. [2024-01-27 16:16:01,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2318 conditions, 897 events. 449/897 cut-off events. For 660/676 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4643 event pairs, 155 based on Foata normal form. 8/866 useless extension candidates. Maximal degree in co-relation 2299. Up to 344 conditions per place. [2024-01-27 16:16:01,977 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 24 selfloop transitions, 1 changer transitions 24/66 dead transitions. [2024-01-27 16:16:01,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 66 transitions, 356 flow [2024-01-27 16:16:01,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 16:16:01,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 16:16:01,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 130 transitions. [2024-01-27 16:16:01,978 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2024-01-27 16:16:01,979 INFO L175 Difference]: Start difference. First operand has 58 places, 41 transitions, 186 flow. Second operand 6 states and 130 transitions. [2024-01-27 16:16:01,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 66 transitions, 356 flow [2024-01-27 16:16:01,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 66 transitions, 292 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-01-27 16:16:01,981 INFO L231 Difference]: Finished difference. Result has 59 places, 38 transitions, 129 flow [2024-01-27 16:16:01,982 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=129, PETRI_PLACES=59, PETRI_TRANSITIONS=38} [2024-01-27 16:16:01,982 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 14 predicate places. [2024-01-27 16:16:01,982 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 38 transitions, 129 flow [2024-01-27 16:16:01,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 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:16:01,983 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:16:01,983 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] [2024-01-27 16:16:01,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-27 16:16:01,983 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:16:01,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:16:01,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1875759651, now seen corresponding path program 2 times [2024-01-27 16:16:01,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:16:01,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458360877] [2024-01-27 16:16:01,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:16:01,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:16:02,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:16:02,128 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:16:02,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:16:02,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458360877] [2024-01-27 16:16:02,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458360877] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:16:02,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:16:02,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-27 16:16:02,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21464814] [2024-01-27 16:16:02,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:16:02,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 16:16:02,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:16:02,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 16:16:02,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-01-27 16:16:02,137 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-01-27 16:16:02,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 38 transitions, 129 flow. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 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:16:02,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:16:02,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-01-27 16:16:02,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:16:02,285 INFO L124 PetriNetUnfolderBase]: 362/754 cut-off events. [2024-01-27 16:16:02,285 INFO L125 PetriNetUnfolderBase]: For 165/165 co-relation queries the response was YES. [2024-01-27 16:16:02,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1727 conditions, 754 events. 362/754 cut-off events. For 165/165 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3752 event pairs, 242 based on Foata normal form. 8/718 useless extension candidates. Maximal degree in co-relation 1709. Up to 336 conditions per place. [2024-01-27 16:16:02,288 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 23 selfloop transitions, 2 changer transitions 25/67 dead transitions. [2024-01-27 16:16:02,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 67 transitions, 311 flow [2024-01-27 16:16:02,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-27 16:16:02,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-27 16:16:02,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 149 transitions. [2024-01-27 16:16:02,290 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5457875457875457 [2024-01-27 16:16:02,290 INFO L175 Difference]: Start difference. First operand has 59 places, 38 transitions, 129 flow. Second operand 7 states and 149 transitions. [2024-01-27 16:16:02,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 67 transitions, 311 flow [2024-01-27 16:16:02,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 67 transitions, 285 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-01-27 16:16:02,292 INFO L231 Difference]: Finished difference. Result has 58 places, 38 transitions, 128 flow [2024-01-27 16:16:02,292 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=128, PETRI_PLACES=58, PETRI_TRANSITIONS=38} [2024-01-27 16:16:02,292 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 13 predicate places. [2024-01-27 16:16:02,292 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 38 transitions, 128 flow [2024-01-27 16:16:02,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 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:16:02,293 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:16:02,293 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] [2024-01-27 16:16:02,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-01-27 16:16:02,293 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:16:02,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:16:02,294 INFO L85 PathProgramCache]: Analyzing trace with hash -2030904163, now seen corresponding path program 3 times [2024-01-27 16:16:02,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:16:02,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001908044] [2024-01-27 16:16:02,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:16:02,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:16:02,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 16:16:02,329 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-27 16:16:02,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 16:16:02,393 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-27 16:16:02,393 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-27 16:16:02,394 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-01-27 16:16:02,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-01-27 16:16:02,396 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-01-27 16:16:02,396 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-01-27 16:16:02,397 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-01-27 16:16:02,397 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-01-27 16:16:02,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-01-27 16:16:02,397 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:16:02,402 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-27 16:16:02,403 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-27 16:16:02,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 04:16:02 BasicIcfg [2024-01-27 16:16:02,497 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-27 16:16:02,498 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-01-27 16:16:02,498 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-01-27 16:16:02,498 INFO L274 PluginConnector]: Witness Printer initialized [2024-01-27 16:16:02,498 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:15:54" (3/4) ... [2024-01-27 16:16:02,499 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2024-01-27 16:16:02,578 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-01-27 16:16:02,578 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-01-27 16:16:02,579 INFO L158 Benchmark]: Toolchain (without parser) took 9065.65ms. Allocated memory was 169.9MB in the beginning and 446.7MB in the end (delta: 276.8MB). Free memory was 99.7MB in the beginning and 157.6MB in the end (delta: -57.9MB). Peak memory consumption was 221.0MB. Max. memory is 16.1GB. [2024-01-27 16:16:02,579 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 117.4MB. Free memory is still 78.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 16:16:02,579 INFO L158 Benchmark]: CACSL2BoogieTranslator took 416.29ms. Allocated memory is still 169.9MB. Free memory was 99.5MB in the beginning and 75.1MB in the end (delta: 24.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-01-27 16:16:02,579 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.02ms. Allocated memory is still 169.9MB. Free memory was 75.1MB in the beginning and 72.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 16:16:02,579 INFO L158 Benchmark]: Boogie Preprocessor took 82.31ms. Allocated memory is still 169.9MB. Free memory was 72.4MB in the beginning and 139.6MB in the end (delta: -67.1MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2024-01-27 16:16:02,580 INFO L158 Benchmark]: RCFGBuilder took 681.16ms. Allocated memory is still 169.9MB. Free memory was 139.6MB in the beginning and 55.7MB in the end (delta: 83.9MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. [2024-01-27 16:16:02,580 INFO L158 Benchmark]: TraceAbstraction took 7754.78ms. Allocated memory was 169.9MB in the beginning and 446.7MB in the end (delta: 276.8MB). Free memory was 55.1MB in the beginning and 176.5MB in the end (delta: -121.4MB). Peak memory consumption was 154.5MB. Max. memory is 16.1GB. [2024-01-27 16:16:02,580 INFO L158 Benchmark]: Witness Printer took 80.42ms. Allocated memory is still 446.7MB. Free memory was 176.5MB in the beginning and 157.6MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-01-27 16:16:02,581 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.14ms. Allocated memory is still 117.4MB. Free memory is still 78.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 416.29ms. Allocated memory is still 169.9MB. Free memory was 99.5MB in the beginning and 75.1MB in the end (delta: 24.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.02ms. Allocated memory is still 169.9MB. Free memory was 75.1MB in the beginning and 72.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.31ms. Allocated memory is still 169.9MB. Free memory was 72.4MB in the beginning and 139.6MB in the end (delta: -67.1MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. * RCFGBuilder took 681.16ms. Allocated memory is still 169.9MB. Free memory was 139.6MB in the beginning and 55.7MB in the end (delta: 83.9MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. * TraceAbstraction took 7754.78ms. Allocated memory was 169.9MB in the beginning and 446.7MB in the end (delta: 276.8MB). Free memory was 55.1MB in the beginning and 176.5MB in the end (delta: -121.4MB). Peak memory consumption was 154.5MB. Max. memory is 16.1GB. * Witness Printer took 80.42ms. Allocated memory is still 446.7MB. Free memory was 176.5MB in the beginning and 157.6MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L844] 0 pthread_t t2100; [L845] FCALL, FORK 0 pthread_create(&t2100, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2100={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] EXPR 1 \read(y) [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L767] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L768] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L769] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L770] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L772] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L774] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L775] EXPR 1 \read(y) [L775] 1 __unbuffered_p0_EAX = y [L776] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L776] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L776] 1 y = y$flush_delayed ? y$mem_tmp : y [L777] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L846] 0 pthread_t t2101; [L847] FCALL, FORK 0 pthread_create(&t2101, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2100={6:0}, t2101={7:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L780] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L848] 0 pthread_t t2102; [L792] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L795] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L849] FCALL, FORK 0 pthread_create(&t2102, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2100={6:0}, t2101={7:0}, t2102={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L807] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, 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$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L810] 3 y$w_buff1 = y$w_buff0 [L811] 3 y$w_buff0 = 1 [L812] 3 y$w_buff1_used = y$w_buff0_used [L813] 3 y$w_buff0_used = (_Bool)1 [L814] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L814] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L815] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L816] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L817] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L818] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L819] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, 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$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L822] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, 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$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, 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$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2100={6:0}, t2101={7:0}, t2102={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L853] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L853] RET 0 assume_abort_if_not(main$tmp_guard0) [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L855] EXPR 0 \read(y) [L855] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2100={6:0}, t2101={7:0}, t2102={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L862] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L863] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L863] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L863] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L863] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L863] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L863] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L864] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2100={6:0}, t2101={7:0}, t2102={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L866] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L19] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - UnprovableResult [Line: 19]: 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: 845]: 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: 849]: 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: 847]: 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, 64 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: 7.5s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 566 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 533 mSDsluCounter, 175 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 148 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1706 IncrementalHoareTripleChecker+Invalid, 1740 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 27 mSDtfsCounter, 1706 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=244occurred in iteration=11, InterpolantAutomatonStates: 93, 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.4s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 323 NumberOfCodeBlocks, 323 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 280 ConstructedInterpolants, 0 QuantifiedInterpolants, 1507 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-01-27 16:16:02,608 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