./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe016_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe016_rmo.oepc.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 ef808fc1470b7509ff56eb59d7d443a24f9bd367b94a6fd316176ae1cba1f1f6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 14:18:46,253 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 14:18:46,317 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 14:18:46,324 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 14:18:46,325 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 14:18:46,357 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 14:18:46,358 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 14:18:46,359 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 14:18:46,360 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 14:18:46,360 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 14:18:46,362 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 14:18:46,362 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 14:18:46,363 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 14:18:46,363 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 14:18:46,363 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 14:18:46,366 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 14:18:46,367 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 14:18:46,367 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 14:18:46,367 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 14:18:46,367 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 14:18:46,368 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 14:18:46,368 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 14:18:46,368 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 14:18:46,368 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 14:18:46,369 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 14:18:46,369 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 14:18:46,369 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 14:18:46,369 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 14:18:46,370 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 14:18:46,370 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 14:18:46,370 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 14:18:46,370 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 14:18:46,371 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:18:46,371 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 14:18:46,371 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 14:18:46,371 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 14:18:46,372 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 14:18:46,372 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 14:18:46,372 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 14:18:46,372 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 14:18:46,372 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 14:18:46,373 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 14:18:46,373 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-clean/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-clean/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 -> ef808fc1470b7509ff56eb59d7d443a24f9bd367b94a6fd316176ae1cba1f1f6 [2024-10-11 14:18:46,638 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 14:18:46,663 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 14:18:46,666 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 14:18:46,667 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 14:18:46,668 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 14:18:46,669 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe016_rmo.oepc.i [2024-10-11 14:18:48,044 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 14:18:48,285 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 14:18:48,289 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe016_rmo.oepc.i [2024-10-11 14:18:48,308 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1f85f4aaf/f9a1fd2d06f04f25b2c85ae86cd1ea8c/FLAG473e03d91 [2024-10-11 14:18:48,328 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1f85f4aaf/f9a1fd2d06f04f25b2c85ae86cd1ea8c [2024-10-11 14:18:48,330 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 14:18:48,332 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 14:18:48,333 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 14:18:48,333 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 14:18:48,338 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 14:18:48,338 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:18:48" (1/1) ... [2024-10-11 14:18:48,339 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@474a9324 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:18:48, skipping insertion in model container [2024-10-11 14:18:48,339 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:18:48" (1/1) ... [2024-10-11 14:18:48,387 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 14:18:48,565 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe016_rmo.oepc.i[993,1006] [2024-10-11 14:18:48,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:18:48,816 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 14:18:48,827 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe016_rmo.oepc.i[993,1006] [2024-10-11 14:18:48,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:18:48,927 INFO L204 MainTranslator]: Completed translation [2024-10-11 14:18:48,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:18:48 WrapperNode [2024-10-11 14:18:48,928 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 14:18:48,929 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 14:18:48,929 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 14:18:48,929 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 14:18:48,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:18:48" (1/1) ... [2024-10-11 14:18:48,965 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:18:48" (1/1) ... [2024-10-11 14:18:49,016 INFO L138 Inliner]: procedures = 176, calls = 69, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 174 [2024-10-11 14:18:49,017 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 14:18:49,018 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 14:18:49,018 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 14:18:49,018 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 14:18:49,036 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:18:48" (1/1) ... [2024-10-11 14:18:49,036 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:18:48" (1/1) ... [2024-10-11 14:18:49,043 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:18:48" (1/1) ... [2024-10-11 14:18:49,064 INFO L175 MemorySlicer]: Split 24 memory accesses to 2 slices as follows [2, 22]. 92 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 9 writes are split as follows [0, 9]. [2024-10-11 14:18:49,064 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:18:48" (1/1) ... [2024-10-11 14:18:49,064 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:18:48" (1/1) ... [2024-10-11 14:18:49,075 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:18:48" (1/1) ... [2024-10-11 14:18:49,078 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:18:48" (1/1) ... [2024-10-11 14:18:49,082 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:18:48" (1/1) ... [2024-10-11 14:18:49,086 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:18:48" (1/1) ... [2024-10-11 14:18:49,092 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 14:18:49,093 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 14:18:49,093 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 14:18:49,093 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 14:18:49,094 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:18:48" (1/1) ... [2024-10-11 14:18:49,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:18:49,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:18:49,140 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 14:18:49,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 14:18:49,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 14:18:49,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 14:18:49,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 14:18:49,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 14:18:49,198 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-11 14:18:49,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 14:18:49,198 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-11 14:18:49,199 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-11 14:18:49,199 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-11 14:18:49,199 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-11 14:18:49,199 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-11 14:18:49,199 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-11 14:18:49,199 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-10-11 14:18:49,199 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-10-11 14:18:49,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 14:18:49,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 14:18:49,200 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-11 14:18:49,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 14:18:49,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 14:18:49,203 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 14:18:49,410 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 14:18:49,412 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 14:18:49,887 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 14:18:49,887 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 14:18:50,267 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 14:18:50,267 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 14:18:50,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:18:50 BoogieIcfgContainer [2024-10-11 14:18:50,268 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 14:18:50,272 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 14:18:50,273 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 14:18:50,276 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 14:18:50,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:18:48" (1/3) ... [2024-10-11 14:18:50,277 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@603b96fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:18:50, skipping insertion in model container [2024-10-11 14:18:50,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:18:48" (2/3) ... [2024-10-11 14:18:50,277 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@603b96fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:18:50, skipping insertion in model container [2024-10-11 14:18:50,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:18:50" (3/3) ... [2024-10-11 14:18:50,279 INFO L112 eAbstractionObserver]: Analyzing ICFG safe016_rmo.oepc.i [2024-10-11 14:18:50,296 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 14:18:50,296 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 14:18:50,297 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 14:18:50,366 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 14:18:50,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 45 transitions, 106 flow [2024-10-11 14:18:50,439 INFO L124 PetriNetUnfolderBase]: 1/41 cut-off events. [2024-10-11 14:18:50,439 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 14:18:50,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 41 events. 1/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 79 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2024-10-11 14:18:50,444 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 45 transitions, 106 flow [2024-10-11 14:18:50,447 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 38 transitions, 88 flow [2024-10-11 14:18:50,453 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:18:50,458 INFO L333 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, 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;@4dad5150, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:18:50,458 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-11 14:18:50,470 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 14:18:50,470 INFO L124 PetriNetUnfolderBase]: 0/37 cut-off events. [2024-10-11 14:18:50,470 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 14:18:50,471 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:18:50,471 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:18:50,472 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-11 14:18:50,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:18:50,476 INFO L85 PathProgramCache]: Analyzing trace with hash 367158955, now seen corresponding path program 1 times [2024-10-11 14:18:50,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:18:50,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419860139] [2024-10-11 14:18:50,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:18:50,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:18:50,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:18:51,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:18:51,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:18:51,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419860139] [2024-10-11 14:18:51,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419860139] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:18:51,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:18:51,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:18:51,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796838916] [2024-10-11 14:18:51,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:18:51,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:18:51,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:18:51,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:18:51,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:18:51,407 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 45 [2024-10-11 14:18:51,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 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-10-11 14:18:51,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:18:51,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 45 [2024-10-11 14:18:51,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:18:52,556 INFO L124 PetriNetUnfolderBase]: 2645/4018 cut-off events. [2024-10-11 14:18:52,556 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-10-11 14:18:52,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7836 conditions, 4018 events. 2645/4018 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 26536 event pairs, 715 based on Foata normal form. 120/4117 useless extension candidates. Maximal degree in co-relation 7824. Up to 2617 conditions per place. [2024-10-11 14:18:52,585 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 33 selfloop transitions, 2 changer transitions 35/84 dead transitions. [2024-10-11 14:18:52,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 84 transitions, 323 flow [2024-10-11 14:18:52,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 14:18:52,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-11 14:18:52,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 198 transitions. [2024-10-11 14:18:52,601 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2024-10-11 14:18:52,603 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 88 flow. Second operand 7 states and 198 transitions. [2024-10-11 14:18:52,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 84 transitions, 323 flow [2024-10-11 14:18:52,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 84 transitions, 318 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-11 14:18:52,610 INFO L231 Difference]: Finished difference. Result has 58 places, 38 transitions, 100 flow [2024-10-11 14:18:52,613 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=47, 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=100, PETRI_PLACES=58, PETRI_TRANSITIONS=38} [2024-10-11 14:18:52,618 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 7 predicate places. [2024-10-11 14:18:52,619 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 38 transitions, 100 flow [2024-10-11 14:18:52,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 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-10-11 14:18:52,619 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:18:52,619 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:18:52,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 14:18:52,620 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-11 14:18:52,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:18:52,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1677354316, now seen corresponding path program 1 times [2024-10-11 14:18:52,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:18:52,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399660903] [2024-10-11 14:18:52,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:18:52,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:18:52,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:18:53,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:18:53,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:18:53,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399660903] [2024-10-11 14:18:53,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399660903] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:18:53,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:18:53,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:18:53,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127652206] [2024-10-11 14:18:53,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:18:53,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:18:53,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:18:53,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:18:53,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:18:53,020 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-10-11 14:18:53,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 38 transitions, 100 flow. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:18:53,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:18:53,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-10-11 14:18:53,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:18:55,286 INFO L124 PetriNetUnfolderBase]: 7175/11199 cut-off events. [2024-10-11 14:18:55,287 INFO L125 PetriNetUnfolderBase]: For 1200/1200 co-relation queries the response was YES. [2024-10-11 14:18:55,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23122 conditions, 11199 events. 7175/11199 cut-off events. For 1200/1200 co-relation queries the response was YES. Maximal size of possible extension queue 621. Compared 79726 event pairs, 863 based on Foata normal form. 192/11285 useless extension candidates. Maximal degree in co-relation 23107. Up to 4521 conditions per place. [2024-10-11 14:18:55,341 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 50 selfloop transitions, 4 changer transitions 51/117 dead transitions. [2024-10-11 14:18:55,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 117 transitions, 491 flow [2024-10-11 14:18:55,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 14:18:55,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-11 14:18:55,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 235 transitions. [2024-10-11 14:18:55,344 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6527777777777778 [2024-10-11 14:18:55,344 INFO L175 Difference]: Start difference. First operand has 58 places, 38 transitions, 100 flow. Second operand 8 states and 235 transitions. [2024-10-11 14:18:55,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 117 transitions, 491 flow [2024-10-11 14:18:55,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 117 transitions, 469 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-10-11 14:18:55,420 INFO L231 Difference]: Finished difference. Result has 61 places, 40 transitions, 130 flow [2024-10-11 14:18:55,421 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=88, 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=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=130, PETRI_PLACES=61, PETRI_TRANSITIONS=40} [2024-10-11 14:18:55,421 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 10 predicate places. [2024-10-11 14:18:55,422 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 40 transitions, 130 flow [2024-10-11 14:18:55,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:18:55,423 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:18:55,423 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:18:55,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 14:18:55,424 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-11 14:18:55,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:18:55,425 INFO L85 PathProgramCache]: Analyzing trace with hash 387328421, now seen corresponding path program 1 times [2024-10-11 14:18:55,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:18:55,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087543217] [2024-10-11 14:18:55,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:18:55,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:18:55,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:18:55,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:18:55,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:18:55,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087543217] [2024-10-11 14:18:55,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087543217] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:18:55,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:18:55,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:18:55,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142412446] [2024-10-11 14:18:55,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:18:55,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:18:55,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:18:55,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:18:55,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:18:55,823 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 45 [2024-10-11 14:18:55,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 40 transitions, 130 flow. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:18:55,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:18:55,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 45 [2024-10-11 14:18:55,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:18:56,657 INFO L124 PetriNetUnfolderBase]: 2853/4641 cut-off events. [2024-10-11 14:18:56,658 INFO L125 PetriNetUnfolderBase]: For 2643/2666 co-relation queries the response was YES. [2024-10-11 14:18:56,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10814 conditions, 4641 events. 2853/4641 cut-off events. For 2643/2666 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 31870 event pairs, 1099 based on Foata normal form. 128/4640 useless extension candidates. Maximal degree in co-relation 10797. Up to 2643 conditions per place. [2024-10-11 14:18:56,696 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 37 selfloop transitions, 2 changer transitions 35/91 dead transitions. [2024-10-11 14:18:56,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 91 transitions, 400 flow [2024-10-11 14:18:56,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 14:18:56,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-11 14:18:56,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 209 transitions. [2024-10-11 14:18:56,699 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6634920634920635 [2024-10-11 14:18:56,699 INFO L175 Difference]: Start difference. First operand has 61 places, 40 transitions, 130 flow. Second operand 7 states and 209 transitions. [2024-10-11 14:18:56,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 91 transitions, 400 flow [2024-10-11 14:18:56,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 91 transitions, 383 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-10-11 14:18:56,715 INFO L231 Difference]: Finished difference. Result has 64 places, 40 transitions, 135 flow [2024-10-11 14:18:56,715 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=135, PETRI_PLACES=64, PETRI_TRANSITIONS=40} [2024-10-11 14:18:56,716 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 13 predicate places. [2024-10-11 14:18:56,717 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 40 transitions, 135 flow [2024-10-11 14:18:56,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:18:56,717 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:18:56,718 INFO L204 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-10-11 14:18:56,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 14:18:56,718 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-11 14:18:56,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:18:56,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1664462777, now seen corresponding path program 1 times [2024-10-11 14:18:56,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:18:56,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295326682] [2024-10-11 14:18:56,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:18:56,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:18:56,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:18:57,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:18:57,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:18:57,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295326682] [2024-10-11 14:18:57,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295326682] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:18:57,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:18:57,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 14:18:57,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013270277] [2024-10-11 14:18:57,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:18:57,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:18:57,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:18:57,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:18:57,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:18:57,115 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-10-11 14:18:57,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 40 transitions, 135 flow. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 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-10-11 14:18:57,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:18:57,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-10-11 14:18:57,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:18:58,770 INFO L124 PetriNetUnfolderBase]: 6835/11037 cut-off events. [2024-10-11 14:18:58,771 INFO L125 PetriNetUnfolderBase]: For 6996/7001 co-relation queries the response was YES. [2024-10-11 14:18:58,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25941 conditions, 11037 events. 6835/11037 cut-off events. For 6996/7001 co-relation queries the response was YES. Maximal size of possible extension queue 691. Compared 86179 event pairs, 2143 based on Foata normal form. 227/11189 useless extension candidates. Maximal degree in co-relation 25921. Up to 3493 conditions per place. [2024-10-11 14:18:58,837 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 44 selfloop transitions, 3 changer transitions 84/143 dead transitions. [2024-10-11 14:18:58,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 143 transitions, 681 flow [2024-10-11 14:18:58,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 14:18:58,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-11 14:18:58,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 309 transitions. [2024-10-11 14:18:58,840 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6242424242424243 [2024-10-11 14:18:58,840 INFO L175 Difference]: Start difference. First operand has 64 places, 40 transitions, 135 flow. Second operand 11 states and 309 transitions. [2024-10-11 14:18:58,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 143 transitions, 681 flow [2024-10-11 14:18:58,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 143 transitions, 641 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-10-11 14:18:58,959 INFO L231 Difference]: Finished difference. Result has 73 places, 40 transitions, 150 flow [2024-10-11 14:18:58,960 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=150, PETRI_PLACES=73, PETRI_TRANSITIONS=40} [2024-10-11 14:18:58,961 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 22 predicate places. [2024-10-11 14:18:58,962 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 40 transitions, 150 flow [2024-10-11 14:18:58,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 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-10-11 14:18:58,963 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:18:58,963 INFO L204 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-10-11 14:18:58,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 14:18:58,963 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-11 14:18:58,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:18:58,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1015548210, now seen corresponding path program 1 times [2024-10-11 14:18:58,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:18:58,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162347792] [2024-10-11 14:18:58,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:18:58,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:18:59,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:19:00,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:19:00,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:19:00,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162347792] [2024-10-11 14:19:00,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162347792] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:19:00,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:19:00,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 14:19:00,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320656037] [2024-10-11 14:19:00,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:19:00,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 14:19:00,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:19:00,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 14:19:00,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 14:19:00,375 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-10-11 14:19:00,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 40 transitions, 150 flow. Second operand has 8 states, 8 states have (on average 19.0) internal successors, (152), 8 states have internal predecessors, (152), 0 states have call successors, (0), 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-10-11 14:19:00,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:19:00,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-10-11 14:19:00,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:19:01,416 INFO L124 PetriNetUnfolderBase]: 4160/6724 cut-off events. [2024-10-11 14:19:01,417 INFO L125 PetriNetUnfolderBase]: For 11954/11978 co-relation queries the response was YES. [2024-10-11 14:19:01,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17167 conditions, 6724 events. 4160/6724 cut-off events. For 11954/11978 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 47537 event pairs, 1225 based on Foata normal form. 160/6813 useless extension candidates. Maximal degree in co-relation 17143. Up to 4630 conditions per place. [2024-10-11 14:19:01,447 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 44 selfloop transitions, 6 changer transitions 43/106 dead transitions. [2024-10-11 14:19:01,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 106 transitions, 573 flow [2024-10-11 14:19:01,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 14:19:01,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-11 14:19:01,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 263 transitions. [2024-10-11 14:19:01,449 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5844444444444444 [2024-10-11 14:19:01,449 INFO L175 Difference]: Start difference. First operand has 73 places, 40 transitions, 150 flow. Second operand 10 states and 263 transitions. [2024-10-11 14:19:01,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 106 transitions, 573 flow [2024-10-11 14:19:01,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 106 transitions, 517 flow, removed 23 selfloop flow, removed 9 redundant places. [2024-10-11 14:19:01,478 INFO L231 Difference]: Finished difference. Result has 73 places, 45 transitions, 200 flow [2024-10-11 14:19:01,478 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=200, PETRI_PLACES=73, PETRI_TRANSITIONS=45} [2024-10-11 14:19:01,481 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 22 predicate places. [2024-10-11 14:19:01,481 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 45 transitions, 200 flow [2024-10-11 14:19:01,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.0) internal successors, (152), 8 states have internal predecessors, (152), 0 states have call successors, (0), 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-10-11 14:19:01,482 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:19:01,482 INFO L204 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] [2024-10-11 14:19:01,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 14:19:01,482 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-11 14:19:01,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:19:01,483 INFO L85 PathProgramCache]: Analyzing trace with hash 2009426373, now seen corresponding path program 1 times [2024-10-11 14:19:01,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:19:01,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313157955] [2024-10-11 14:19:01,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:19:01,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:19:01,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:19:02,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:19:02,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:19:02,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313157955] [2024-10-11 14:19:02,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313157955] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:19:02,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:19:02,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 14:19:02,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722937507] [2024-10-11 14:19:02,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:19:02,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 14:19:02,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:19:02,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 14:19:02,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 14:19:02,415 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-10-11 14:19:02,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 45 transitions, 200 flow. Second operand has 9 states, 9 states have (on average 18.88888888888889) internal successors, (170), 9 states have internal predecessors, (170), 0 states have call successors, (0), 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-10-11 14:19:02,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:19:02,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-10-11 14:19:02,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:19:03,905 INFO L124 PetriNetUnfolderBase]: 6074/9916 cut-off events. [2024-10-11 14:19:03,905 INFO L125 PetriNetUnfolderBase]: For 28706/28742 co-relation queries the response was YES. [2024-10-11 14:19:03,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29562 conditions, 9916 events. 6074/9916 cut-off events. For 28706/28742 co-relation queries the response was YES. Maximal size of possible extension queue 649. Compared 76201 event pairs, 2034 based on Foata normal form. 120/9933 useless extension candidates. Maximal degree in co-relation 29537. Up to 4382 conditions per place. [2024-10-11 14:19:03,972 INFO L140 encePairwiseOnDemand]: 33/45 looper letters, 87 selfloop transitions, 21 changer transitions 21/142 dead transitions. [2024-10-11 14:19:03,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 142 transitions, 854 flow [2024-10-11 14:19:03,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 14:19:03,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-11 14:19:03,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 293 transitions. [2024-10-11 14:19:03,974 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6511111111111111 [2024-10-11 14:19:03,974 INFO L175 Difference]: Start difference. First operand has 73 places, 45 transitions, 200 flow. Second operand 10 states and 293 transitions. [2024-10-11 14:19:03,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 142 transitions, 854 flow [2024-10-11 14:19:04,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 142 transitions, 794 flow, removed 30 selfloop flow, removed 6 redundant places. [2024-10-11 14:19:04,147 INFO L231 Difference]: Finished difference. Result has 77 places, 61 transitions, 372 flow [2024-10-11 14:19:04,147 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=372, PETRI_PLACES=77, PETRI_TRANSITIONS=61} [2024-10-11 14:19:04,148 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 26 predicate places. [2024-10-11 14:19:04,149 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 61 transitions, 372 flow [2024-10-11 14:19:04,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.88888888888889) internal successors, (170), 9 states have internal predecessors, (170), 0 states have call successors, (0), 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-10-11 14:19:04,150 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:19:04,150 INFO L204 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] [2024-10-11 14:19:04,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 14:19:04,150 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-11 14:19:04,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:19:04,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1100185245, now seen corresponding path program 2 times [2024-10-11 14:19:04,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:19:04,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964460779] [2024-10-11 14:19:04,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:19:04,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:19:04,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:19:04,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:19:04,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:19:04,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964460779] [2024-10-11 14:19:04,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964460779] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:19:04,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:19:04,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 14:19:04,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404454097] [2024-10-11 14:19:04,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:19:04,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 14:19:04,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:19:04,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 14:19:04,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 14:19:04,670 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-10-11 14:19:04,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 61 transitions, 372 flow. Second operand has 7 states, 7 states have (on average 19.428571428571427) internal successors, (136), 7 states have internal predecessors, (136), 0 states have call successors, (0), 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-10-11 14:19:04,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:19:04,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-10-11 14:19:04,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:19:06,440 INFO L124 PetriNetUnfolderBase]: 6277/10138 cut-off events. [2024-10-11 14:19:06,440 INFO L125 PetriNetUnfolderBase]: For 22222/22273 co-relation queries the response was YES. [2024-10-11 14:19:06,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31349 conditions, 10138 events. 6277/10138 cut-off events. For 22222/22273 co-relation queries the response was YES. Maximal size of possible extension queue 677. Compared 77771 event pairs, 1924 based on Foata normal form. 108/10102 useless extension candidates. Maximal degree in co-relation 31321. Up to 4334 conditions per place. [2024-10-11 14:19:06,505 INFO L140 encePairwiseOnDemand]: 33/45 looper letters, 58 selfloop transitions, 24 changer transitions 34/129 dead transitions. [2024-10-11 14:19:06,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 129 transitions, 908 flow [2024-10-11 14:19:06,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 14:19:06,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-11 14:19:06,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 247 transitions. [2024-10-11 14:19:06,507 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6098765432098765 [2024-10-11 14:19:06,508 INFO L175 Difference]: Start difference. First operand has 77 places, 61 transitions, 372 flow. Second operand 9 states and 247 transitions. [2024-10-11 14:19:06,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 129 transitions, 908 flow [2024-10-11 14:19:06,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 129 transitions, 870 flow, removed 19 selfloop flow, removed 2 redundant places. [2024-10-11 14:19:06,602 INFO L231 Difference]: Finished difference. Result has 87 places, 68 transitions, 506 flow [2024-10-11 14:19:06,602 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=506, PETRI_PLACES=87, PETRI_TRANSITIONS=68} [2024-10-11 14:19:06,603 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 36 predicate places. [2024-10-11 14:19:06,603 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 68 transitions, 506 flow [2024-10-11 14:19:06,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.428571428571427) internal successors, (136), 7 states have internal predecessors, (136), 0 states have call successors, (0), 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-10-11 14:19:06,604 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:19:06,604 INFO L204 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] [2024-10-11 14:19:06,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 14:19:06,604 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-11 14:19:06,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:19:06,605 INFO L85 PathProgramCache]: Analyzing trace with hash 2078012065, now seen corresponding path program 3 times [2024-10-11 14:19:06,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:19:06,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889057664] [2024-10-11 14:19:06,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:19:06,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:19:06,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:19:07,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:19:07,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:19:07,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889057664] [2024-10-11 14:19:07,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889057664] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:19:07,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:19:07,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 14:19:07,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003378771] [2024-10-11 14:19:07,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:19:07,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 14:19:07,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:19:07,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 14:19:07,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 14:19:07,656 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-10-11 14:19:07,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 68 transitions, 506 flow. Second operand has 9 states, 9 states have (on average 18.88888888888889) internal successors, (170), 9 states have internal predecessors, (170), 0 states have call successors, (0), 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-10-11 14:19:07,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:19:07,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-10-11 14:19:07,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:19:09,221 INFO L124 PetriNetUnfolderBase]: 6636/10886 cut-off events. [2024-10-11 14:19:09,221 INFO L125 PetriNetUnfolderBase]: For 30174/30214 co-relation queries the response was YES. [2024-10-11 14:19:09,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37853 conditions, 10886 events. 6636/10886 cut-off events. For 30174/30214 co-relation queries the response was YES. Maximal size of possible extension queue 751. Compared 85391 event pairs, 1602 based on Foata normal form. 122/10925 useless extension candidates. Maximal degree in co-relation 37819. Up to 4744 conditions per place. [2024-10-11 14:19:09,295 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 103 selfloop transitions, 20 changer transitions 26/162 dead transitions. [2024-10-11 14:19:09,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 162 transitions, 1237 flow [2024-10-11 14:19:09,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 14:19:09,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-11 14:19:09,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 317 transitions. [2024-10-11 14:19:09,298 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6404040404040404 [2024-10-11 14:19:09,298 INFO L175 Difference]: Start difference. First operand has 87 places, 68 transitions, 506 flow. Second operand 11 states and 317 transitions. [2024-10-11 14:19:09,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 162 transitions, 1237 flow [2024-10-11 14:19:09,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 162 transitions, 1192 flow, removed 15 selfloop flow, removed 6 redundant places. [2024-10-11 14:19:09,450 INFO L231 Difference]: Finished difference. Result has 90 places, 67 transitions, 514 flow [2024-10-11 14:19:09,450 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=514, PETRI_PLACES=90, PETRI_TRANSITIONS=67} [2024-10-11 14:19:09,450 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 39 predicate places. [2024-10-11 14:19:09,451 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 67 transitions, 514 flow [2024-10-11 14:19:09,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.88888888888889) internal successors, (170), 9 states have internal predecessors, (170), 0 states have call successors, (0), 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-10-11 14:19:09,452 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:19:09,452 INFO L204 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] [2024-10-11 14:19:09,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 14:19:09,456 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-11 14:19:09,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:19:09,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1498362453, now seen corresponding path program 4 times [2024-10-11 14:19:09,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:19:09,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784099421] [2024-10-11 14:19:09,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:19:09,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:19:09,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:19:10,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:19:10,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:19:10,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784099421] [2024-10-11 14:19:10,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784099421] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:19:10,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:19:10,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 14:19:10,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770024745] [2024-10-11 14:19:10,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:19:10,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 14:19:10,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:19:10,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 14:19:10,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 14:19:10,182 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-10-11 14:19:10,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 67 transitions, 514 flow. Second operand has 8 states, 8 states have (on average 19.125) internal successors, (153), 8 states have internal predecessors, (153), 0 states have call successors, (0), 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-10-11 14:19:10,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:19:10,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-10-11 14:19:10,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:19:11,639 INFO L124 PetriNetUnfolderBase]: 6716/10788 cut-off events. [2024-10-11 14:19:11,640 INFO L125 PetriNetUnfolderBase]: For 35821/35872 co-relation queries the response was YES. [2024-10-11 14:19:11,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38446 conditions, 10788 events. 6716/10788 cut-off events. For 35821/35872 co-relation queries the response was YES. Maximal size of possible extension queue 700. Compared 83112 event pairs, 1476 based on Foata normal form. 126/10787 useless extension candidates. Maximal degree in co-relation 38413. Up to 3249 conditions per place. [2024-10-11 14:19:11,706 INFO L140 encePairwiseOnDemand]: 33/45 looper letters, 70 selfloop transitions, 25 changer transitions 48/156 dead transitions. [2024-10-11 14:19:11,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 156 transitions, 1260 flow [2024-10-11 14:19:11,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 14:19:11,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-11 14:19:11,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 328 transitions. [2024-10-11 14:19:11,708 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6074074074074074 [2024-10-11 14:19:11,709 INFO L175 Difference]: Start difference. First operand has 90 places, 67 transitions, 514 flow. Second operand 12 states and 328 transitions. [2024-10-11 14:19:11,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 156 transitions, 1260 flow [2024-10-11 14:19:11,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 156 transitions, 1190 flow, removed 14 selfloop flow, removed 9 redundant places. [2024-10-11 14:19:11,806 INFO L231 Difference]: Finished difference. Result has 97 places, 68 transitions, 559 flow [2024-10-11 14:19:11,806 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=559, PETRI_PLACES=97, PETRI_TRANSITIONS=68} [2024-10-11 14:19:11,807 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 46 predicate places. [2024-10-11 14:19:11,807 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 68 transitions, 559 flow [2024-10-11 14:19:11,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.125) internal successors, (153), 8 states have internal predecessors, (153), 0 states have call successors, (0), 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-10-11 14:19:11,808 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:19:11,809 INFO L204 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-10-11 14:19:11,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 14:19:11,809 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-11 14:19:11,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:19:11,809 INFO L85 PathProgramCache]: Analyzing trace with hash 156312391, now seen corresponding path program 1 times [2024-10-11 14:19:11,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:19:11,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676604789] [2024-10-11 14:19:11,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:19:11,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:19:11,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:19:11,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:19:11,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:19:11,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676604789] [2024-10-11 14:19:11,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676604789] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:19:11,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:19:11,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:19:11,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249299520] [2024-10-11 14:19:11,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:19:11,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:19:11,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:19:11,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:19:11,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:19:11,998 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-10-11 14:19:11,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 68 transitions, 559 flow. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 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-10-11 14:19:12,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:19:12,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-10-11 14:19:12,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:19:15,455 INFO L124 PetriNetUnfolderBase]: 23867/35069 cut-off events. [2024-10-11 14:19:15,455 INFO L125 PetriNetUnfolderBase]: For 81070/82972 co-relation queries the response was YES. [2024-10-11 14:19:15,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106531 conditions, 35069 events. 23867/35069 cut-off events. For 81070/82972 co-relation queries the response was YES. Maximal size of possible extension queue 1810. Compared 255684 event pairs, 3876 based on Foata normal form. 1488/36022 useless extension candidates. Maximal degree in co-relation 106493. Up to 18771 conditions per place. [2024-10-11 14:19:15,870 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 104 selfloop transitions, 6 changer transitions 0/130 dead transitions. [2024-10-11 14:19:15,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 130 transitions, 1265 flow [2024-10-11 14:19:15,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:19:15,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 14:19:15,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2024-10-11 14:19:15,871 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6833333333333333 [2024-10-11 14:19:15,871 INFO L175 Difference]: Start difference. First operand has 97 places, 68 transitions, 559 flow. Second operand 4 states and 123 transitions. [2024-10-11 14:19:15,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 130 transitions, 1265 flow [2024-10-11 14:19:16,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 130 transitions, 1134 flow, removed 11 selfloop flow, removed 11 redundant places. [2024-10-11 14:19:16,174 INFO L231 Difference]: Finished difference. Result has 85 places, 73 transitions, 532 flow [2024-10-11 14:19:16,174 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=532, PETRI_PLACES=85, PETRI_TRANSITIONS=73} [2024-10-11 14:19:16,175 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 34 predicate places. [2024-10-11 14:19:16,175 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 73 transitions, 532 flow [2024-10-11 14:19:16,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 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-10-11 14:19:16,175 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:19:16,175 INFO L204 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-10-11 14:19:16,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 14:19:16,176 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-11 14:19:16,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:19:16,176 INFO L85 PathProgramCache]: Analyzing trace with hash 513183746, now seen corresponding path program 1 times [2024-10-11 14:19:16,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:19:16,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080769885] [2024-10-11 14:19:16,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:19:16,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:19:16,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:19:16,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:19:16,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:19:16,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080769885] [2024-10-11 14:19:16,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080769885] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:19:16,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:19:16,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:19:16,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668269783] [2024-10-11 14:19:16,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:19:16,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:19:16,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:19:16,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:19:16,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:19:16,401 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-10-11 14:19:16,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 73 transitions, 532 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-10-11 14:19:16,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:19:16,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-10-11 14:19:16,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:19:20,015 INFO L124 PetriNetUnfolderBase]: 21621/32115 cut-off events. [2024-10-11 14:19:20,015 INFO L125 PetriNetUnfolderBase]: For 57103/59101 co-relation queries the response was YES. [2024-10-11 14:19:20,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102352 conditions, 32115 events. 21621/32115 cut-off events. For 57103/59101 co-relation queries the response was YES. Maximal size of possible extension queue 1701. Compared 233180 event pairs, 1930 based on Foata normal form. 1507/33182 useless extension candidates. Maximal degree in co-relation 102319. Up to 13618 conditions per place. [2024-10-11 14:19:20,175 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 118 selfloop transitions, 10 changer transitions 3/151 dead transitions. [2024-10-11 14:19:20,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 151 transitions, 1332 flow [2024-10-11 14:19:20,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:19:20,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 14:19:20,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 158 transitions. [2024-10-11 14:19:20,177 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7022222222222222 [2024-10-11 14:19:20,177 INFO L175 Difference]: Start difference. First operand has 85 places, 73 transitions, 532 flow. Second operand 5 states and 158 transitions. [2024-10-11 14:19:20,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 151 transitions, 1332 flow [2024-10-11 14:19:20,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 151 transitions, 1329 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 14:19:20,215 INFO L231 Difference]: Finished difference. Result has 90 places, 78 transitions, 597 flow [2024-10-11 14:19:20,215 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=597, PETRI_PLACES=90, PETRI_TRANSITIONS=78} [2024-10-11 14:19:20,215 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 39 predicate places. [2024-10-11 14:19:20,216 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 78 transitions, 597 flow [2024-10-11 14:19:20,216 INFO L472 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-10-11 14:19:20,216 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:19:20,216 INFO L204 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] [2024-10-11 14:19:20,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 14:19:20,216 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-11 14:19:20,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:19:20,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1624115537, now seen corresponding path program 1 times [2024-10-11 14:19:20,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:19:20,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774466837] [2024-10-11 14:19:20,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:19:20,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:19:20,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:19:20,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:19:20,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:19:20,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774466837] [2024-10-11 14:19:20,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774466837] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:19:20,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:19:20,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:19:20,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340382466] [2024-10-11 14:19:20,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:19:20,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:19:20,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:19:20,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:19:20,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:19:20,505 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-10-11 14:19:20,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 78 transitions, 597 flow. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 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-10-11 14:19:20,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:19:20,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-10-11 14:19:20,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:19:23,511 INFO L124 PetriNetUnfolderBase]: 17661/26319 cut-off events. [2024-10-11 14:19:23,512 INFO L125 PetriNetUnfolderBase]: For 64377/66533 co-relation queries the response was YES. [2024-10-11 14:19:23,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93107 conditions, 26319 events. 17661/26319 cut-off events. For 64377/66533 co-relation queries the response was YES. Maximal size of possible extension queue 1442. Compared 187287 event pairs, 1036 based on Foata normal form. 1257/27224 useless extension candidates. Maximal degree in co-relation 93071. Up to 8790 conditions per place. [2024-10-11 14:19:23,608 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 119 selfloop transitions, 14 changer transitions 9/162 dead transitions. [2024-10-11 14:19:23,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 162 transitions, 1435 flow [2024-10-11 14:19:23,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:19:23,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 14:19:23,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 191 transitions. [2024-10-11 14:19:23,609 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7074074074074074 [2024-10-11 14:19:23,609 INFO L175 Difference]: Start difference. First operand has 90 places, 78 transitions, 597 flow. Second operand 6 states and 191 transitions. [2024-10-11 14:19:23,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 162 transitions, 1435 flow [2024-10-11 14:19:23,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 162 transitions, 1419 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-10-11 14:19:23,650 INFO L231 Difference]: Finished difference. Result has 95 places, 80 transitions, 639 flow [2024-10-11 14:19:23,651 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=639, PETRI_PLACES=95, PETRI_TRANSITIONS=80} [2024-10-11 14:19:23,651 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 44 predicate places. [2024-10-11 14:19:23,651 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 80 transitions, 639 flow [2024-10-11 14:19:23,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 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-10-11 14:19:23,652 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:19:23,652 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:19:23,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 14:19:23,652 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-11 14:19:23,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:19:23,653 INFO L85 PathProgramCache]: Analyzing trace with hash -795886268, now seen corresponding path program 1 times [2024-10-11 14:19:23,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:19:23,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30133497] [2024-10-11 14:19:23,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:19:23,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:19:23,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:19:23,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:19:23,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:19:23,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30133497] [2024-10-11 14:19:23,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30133497] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:19:23,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:19:23,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 14:19:23,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128784568] [2024-10-11 14:19:23,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:19:23,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 14:19:23,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:19:23,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 14:19:23,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 14:19:23,899 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2024-10-11 14:19:23,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 80 transitions, 639 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-10-11 14:19:23,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:19:23,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2024-10-11 14:19:23,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:19:26,533 INFO L124 PetriNetUnfolderBase]: 15616/23151 cut-off events. [2024-10-11 14:19:26,533 INFO L125 PetriNetUnfolderBase]: For 83212/85434 co-relation queries the response was YES. [2024-10-11 14:19:26,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89791 conditions, 23151 events. 15616/23151 cut-off events. For 83212/85434 co-relation queries the response was YES. Maximal size of possible extension queue 1439. Compared 165050 event pairs, 936 based on Foata normal form. 732/23473 useless extension candidates. Maximal degree in co-relation 89753. Up to 8784 conditions per place. [2024-10-11 14:19:26,617 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 70 selfloop transitions, 18 changer transitions 53/152 dead transitions. [2024-10-11 14:19:26,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 152 transitions, 1329 flow [2024-10-11 14:19:26,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 14:19:26,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-11 14:19:26,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 204 transitions. [2024-10-11 14:19:26,618 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6476190476190476 [2024-10-11 14:19:26,618 INFO L175 Difference]: Start difference. First operand has 95 places, 80 transitions, 639 flow. Second operand 7 states and 204 transitions. [2024-10-11 14:19:26,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 152 transitions, 1329 flow [2024-10-11 14:19:26,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 152 transitions, 1217 flow, removed 26 selfloop flow, removed 8 redundant places. [2024-10-11 14:19:26,861 INFO L231 Difference]: Finished difference. Result has 95 places, 52 transitions, 343 flow [2024-10-11 14:19:26,862 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=343, PETRI_PLACES=95, PETRI_TRANSITIONS=52} [2024-10-11 14:19:26,862 INFO L277 CegarLoopForPetriNet]: 51 programPoint places, 44 predicate places. [2024-10-11 14:19:26,862 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 52 transitions, 343 flow [2024-10-11 14:19:26,862 INFO L472 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-10-11 14:19:26,862 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:19:26,863 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:19:26,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 14:19:26,863 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-11 14:19:26,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:19:26,863 INFO L85 PathProgramCache]: Analyzing trace with hash 631202986, now seen corresponding path program 1 times [2024-10-11 14:19:26,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:19:26,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989654210] [2024-10-11 14:19:26,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:19:26,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:19:26,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:19:26,967 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 14:19:27,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:19:27,100 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 14:19:27,101 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 14:19:27,102 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-10-11 14:19:27,104 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2024-10-11 14:19:27,105 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-10-11 14:19:27,105 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-10-11 14:19:27,105 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-10-11 14:19:27,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 14:19:27,105 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:19:27,219 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 14:19:27,220 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 14:19:27,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:19:27 BasicIcfg [2024-10-11 14:19:27,228 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 14:19:27,229 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 14:19:27,229 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 14:19:27,229 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 14:19:27,229 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:18:50" (3/4) ... [2024-10-11 14:19:27,231 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-11 14:19:27,347 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 14:19:27,349 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 14:19:27,350 INFO L158 Benchmark]: Toolchain (without parser) took 39018.39ms. Allocated memory was 138.4MB in the beginning and 9.6GB in the end (delta: 9.5GB). Free memory was 83.0MB in the beginning and 8.4GB in the end (delta: -8.3GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-10-11 14:19:27,350 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 138.4MB. Free memory is still 110.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 14:19:27,350 INFO L158 Benchmark]: CACSL2BoogieTranslator took 595.30ms. Allocated memory was 138.4MB in the beginning and 192.9MB in the end (delta: 54.5MB). Free memory was 82.9MB in the beginning and 149.6MB in the end (delta: -66.7MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. [2024-10-11 14:19:27,351 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.96ms. Allocated memory is still 192.9MB. Free memory was 149.6MB in the beginning and 147.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 14:19:27,351 INFO L158 Benchmark]: Boogie Preprocessor took 74.26ms. Allocated memory is still 192.9MB. Free memory was 147.5MB in the beginning and 143.3MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 14:19:27,351 INFO L158 Benchmark]: RCFGBuilder took 1175.19ms. Allocated memory is still 192.9MB. Free memory was 142.2MB in the beginning and 111.8MB in the end (delta: 30.5MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2024-10-11 14:19:27,351 INFO L158 Benchmark]: TraceAbstraction took 36956.44ms. Allocated memory was 192.9MB in the beginning and 9.6GB in the end (delta: 9.4GB). Free memory was 111.8MB in the beginning and 8.4GB in the end (delta: -8.3GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-10-11 14:19:27,351 INFO L158 Benchmark]: Witness Printer took 120.75ms. Allocated memory is still 9.6GB. Free memory was 8.4GB in the beginning and 8.4GB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-11 14:19:27,352 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.17ms. Allocated memory is still 138.4MB. Free memory is still 110.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 595.30ms. Allocated memory was 138.4MB in the beginning and 192.9MB in the end (delta: 54.5MB). Free memory was 82.9MB in the beginning and 149.6MB in the end (delta: -66.7MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.96ms. Allocated memory is still 192.9MB. Free memory was 149.6MB in the beginning and 147.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.26ms. Allocated memory is still 192.9MB. Free memory was 147.5MB in the beginning and 143.3MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1175.19ms. Allocated memory is still 192.9MB. Free memory was 142.2MB in the beginning and 111.8MB in the end (delta: 30.5MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. * TraceAbstraction took 36956.44ms. Allocated memory was 192.9MB in the beginning and 9.6GB in the end (delta: 9.4GB). Free memory was 111.8MB in the beginning and 8.4GB in the end (delta: -8.3GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 120.75ms. Allocated memory is still 9.6GB. Free memory was 8.4GB in the beginning and 8.4GB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. 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: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p2_EAX = 0; [L734] 0 _Bool main$tmp_guard0; [L735] 0 _Bool main$tmp_guard1; [L737] 0 int x = 0; [L739] 0 int y = 0; [L739] 0 int y = 0; [L740] 0 _Bool y$flush_delayed; [L741] 0 int y$mem_tmp; [L742] 0 _Bool y$r_buff0_thd0; [L743] 0 _Bool y$r_buff0_thd1; [L744] 0 _Bool y$r_buff0_thd2; [L745] 0 _Bool y$r_buff0_thd3; [L746] 0 _Bool y$r_buff0_thd4; [L747] 0 _Bool y$r_buff1_thd0; [L748] 0 _Bool y$r_buff1_thd1; [L749] 0 _Bool y$r_buff1_thd2; [L750] 0 _Bool y$r_buff1_thd3; [L751] 0 _Bool y$r_buff1_thd4; [L752] 0 _Bool y$read_delayed; [L753] 0 int *y$read_delayed_var; [L754] 0 int y$w_buff0; [L755] 0 _Bool y$w_buff0_used; [L756] 0 int y$w_buff1; [L757] 0 _Bool y$w_buff1_used; [L758] 0 _Bool weak$$choice0; [L759] 0 _Bool weak$$choice1; [L760] 0 _Bool weak$$choice2; [L851] 0 pthread_t t2161; [L852] FCALL, FORK 0 pthread_create(&t2161, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __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_buff0_thd4=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$r_buff1_thd4=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_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2161=-3, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 y$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(y) [L767] 1 y$mem_tmp = y [L768] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L768] EXPR 1 \read(y) [L768] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L768] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L769] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L770] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L771] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L772] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L774] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L776] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L777] EXPR 1 \read(y) [L777] 1 __unbuffered_p0_EAX = y [L778] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L778] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L778] 1 y = y$flush_delayed ? y$mem_tmp : y [L779] 1 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __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_buff0_thd4=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$r_buff1_thd4=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_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L853] 0 pthread_t t2162; [L854] FCALL, FORK 0 pthread_create(&t2162, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __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_buff0_thd4=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$r_buff1_thd4=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_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2161=-3, t2162=-2, weak$$choice0=1, weak$$choice1=0, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L855] 0 pthread_t t2163; [L856] FCALL, FORK 0 pthread_create(&t2163, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __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_buff0_thd4=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$r_buff1_thd4=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_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2161=-3, t2162=-2, t2163=-1, weak$$choice0=1, weak$$choice1=0, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L782] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __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_buff0_thd4=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$r_buff1_thd4=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_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L794] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __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_buff0_thd4=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$r_buff1_thd4=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_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L806] 3 __unbuffered_p2_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __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_buff0_thd4=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$r_buff1_thd4=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_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L809] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __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_buff0_thd4=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$r_buff1_thd4=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_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L857] 0 pthread_t t2164; [L858] FCALL, FORK 0 pthread_create(&t2164, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __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_buff0_thd4=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$r_buff1_thd4=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_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2161=-3, t2162=-2, t2163=-1, t2164=0, weak$$choice0=1, weak$$choice1=0, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L812] 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) [L812] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L812] EXPR 3 \read(y) [L812] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L812] 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) [L812] 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) [L813] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L814] 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 [L815] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L816] 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 [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __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_buff0_thd4=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$r_buff1_thd4=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_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L826] 4 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __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_buff0_thd4=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$r_buff1_thd4=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_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=1, weak$$choice1=0, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L829] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L829] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L829] EXPR 4 \read(y) [L829] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L829] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L829] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L830] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L831] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L832] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L833] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __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_buff0_thd4=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$r_buff1_thd4=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_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=1, weak$$choice1=0, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L787] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __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_buff0_thd4=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$r_buff1_thd4=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_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=1, weak$$choice1=0, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __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_buff0_thd4=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$r_buff1_thd4=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_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=1, weak$$choice1=0, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L819] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0: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_buff0_thd4=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$r_buff1_thd4=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_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=1, weak$$choice1=0, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L836] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __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_buff0_thd4=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$r_buff1_thd4=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_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=1, weak$$choice1=0, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __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_buff0_thd4=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$r_buff1_thd4=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_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2161=-3, t2162=-2, t2163=-1, t2164=0, weak$$choice0=1, weak$$choice1=0, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 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) [L864] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L864] EXPR 0 \read(y) [L864] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L864] 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) [L864] 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) [L865] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L866] 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 [L867] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L868] 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 [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __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_buff0_thd4=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$r_buff1_thd4=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_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2161=-3, t2162=-2, t2163=-1, t2164=0, weak$$choice0=1, weak$$choice1=0, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L871] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 0 y$flush_delayed = weak$$choice2 [L874] EXPR 0 \read(y) [L874] 0 y$mem_tmp = y [L875] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L875] EXPR 0 \read(y) [L875] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L875] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L876] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L877] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L878] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L879] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L881] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L883] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L883] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L883] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L883] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L884] EXPR 0 x == 2 && y == 2 [L884] EXPR 0 x == 2 && y == 2 [L884] EXPR 0 \read(y) [L884] EXPR 0 x == 2 && y == 2 [L884] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 2) [L885] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L885] EXPR 0 \read(y) [L885] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L885] 0 y = y$flush_delayed ? y$mem_tmp : y [L886] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __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_buff0_thd4=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$r_buff1_thd4=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=2, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2161=-3, t2162=-2, t2163=-1, t2164=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __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_buff0_thd4=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$r_buff1_thd4=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=2, __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=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L19] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __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_buff0_thd4=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$r_buff1_thd4=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=2, __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=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - UnprovableResult [Line: 854]: 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: 852]: 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: 858]: 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: 856]: 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 9 procedures, 75 locations, 5 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: 36.7s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 28.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1137 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1102 mSDsluCounter, 316 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 248 mSDsCounter, 71 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2895 IncrementalHoareTripleChecker+Invalid, 2966 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 71 mSolverCounterUnsat, 68 mSDtfsCounter, 2895 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 130 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=639occurred in iteration=12, InterpolantAutomatonStates: 107, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 332 NumberOfCodeBlocks, 332 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 285 ConstructedInterpolants, 0 QuantifiedInterpolants, 2204 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-11 14:19:27,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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