./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/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 390a12f9f7a5c311c1cdcecac54987f654ebac30db2fbb7661324a5599d93cf6 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 09:26:04,260 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 09:26:04,309 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 09:26:04,313 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 09:26:04,314 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 09:26:04,336 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 09:26:04,336 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 09:26:04,337 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 09:26:04,338 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 09:26:04,339 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 09:26:04,339 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 09:26:04,340 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 09:26:04,340 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 09:26:04,342 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 09:26:04,342 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 09:26:04,342 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 09:26:04,342 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 09:26:04,343 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 09:26:04,343 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 09:26:04,343 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 09:26:04,343 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 09:26:04,346 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 09:26:04,346 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 09:26:04,346 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 09:26:04,346 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 09:26:04,347 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 09:26:04,347 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 09:26:04,347 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 09:26:04,347 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 09:26:04,347 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 09:26:04,347 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 09:26:04,348 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 09:26:04,348 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 09:26:04,348 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 09:26:04,348 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 09:26:04,348 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 09:26:04,348 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 09:26:04,349 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 09:26:04,349 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 09:26:04,350 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 09:26:04,350 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 09:26:04,351 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 09:26:04,351 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 390a12f9f7a5c311c1cdcecac54987f654ebac30db2fbb7661324a5599d93cf6 [2024-11-20 09:26:04,583 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 09:26:04,603 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 09:26:04,605 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 09:26:04,606 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 09:26:04,607 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 09:26:04,607 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2024-11-20 09:26:05,879 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 09:26:06,071 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 09:26:06,071 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2024-11-20 09:26:06,087 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41db4a8c3/3e01dfcfd52449ac80f188b363854505/FLAG15ccc104f [2024-11-20 09:26:06,104 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41db4a8c3/3e01dfcfd52449ac80f188b363854505 [2024-11-20 09:26:06,107 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 09:26:06,108 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 09:26:06,111 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 09:26:06,112 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 09:26:06,116 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 09:26:06,117 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:26:06" (1/1) ... [2024-11-20 09:26:06,119 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55efbff6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:26:06, skipping insertion in model container [2024-11-20 09:26:06,119 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:26:06" (1/1) ... [2024-11-20 09:26:06,173 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 09:26:06,339 WARN L250 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/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i[1019,1032] [2024-11-20 09:26:06,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 09:26:06,490 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 09:26:06,504 WARN L250 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/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i[1019,1032] [2024-11-20 09:26:06,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 09:26:06,583 INFO L204 MainTranslator]: Completed translation [2024-11-20 09:26:06,584 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:26:06 WrapperNode [2024-11-20 09:26:06,584 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 09:26:06,587 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 09:26:06,587 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 09:26:06,588 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 09:26:06,593 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:26:06" (1/1) ... [2024-11-20 09:26:06,606 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:26:06" (1/1) ... [2024-11-20 09:26:06,630 INFO L138 Inliner]: procedures = 175, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 115 [2024-11-20 09:26:06,630 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 09:26:06,631 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 09:26:06,631 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 09:26:06,633 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 09:26:06,645 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:26:06" (1/1) ... [2024-11-20 09:26:06,645 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:26:06" (1/1) ... [2024-11-20 09:26:06,648 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:26:06" (1/1) ... [2024-11-20 09:26:06,668 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 09:26:06,669 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:26:06" (1/1) ... [2024-11-20 09:26:06,669 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:26:06" (1/1) ... [2024-11-20 09:26:06,675 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:26:06" (1/1) ... [2024-11-20 09:26:06,681 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:26:06" (1/1) ... [2024-11-20 09:26:06,683 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:26:06" (1/1) ... [2024-11-20 09:26:06,687 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:26:06" (1/1) ... [2024-11-20 09:26:06,690 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 09:26:06,691 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 09:26:06,691 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 09:26:06,691 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 09:26:06,692 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:26:06" (1/1) ... [2024-11-20 09:26:06,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 09:26:06,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 09:26:06,727 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 09:26:06,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 09:26:06,771 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-20 09:26:06,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 09:26:06,773 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-20 09:26:06,773 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-20 09:26:06,773 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-20 09:26:06,773 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-20 09:26:06,773 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-20 09:26:06,773 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-20 09:26:06,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 09:26:06,773 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-20 09:26:06,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 09:26:06,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 09:26:06,775 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-20 09:26:06,877 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 09:26:06,878 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 09:26:07,141 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-20 09:26:07,141 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 09:26:07,294 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 09:26:07,294 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-20 09:26:07,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:26:07 BoogieIcfgContainer [2024-11-20 09:26:07,295 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 09:26:07,296 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 09:26:07,296 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 09:26:07,302 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 09:26:07,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:26:06" (1/3) ... [2024-11-20 09:26:07,303 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29799179 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:26:07, skipping insertion in model container [2024-11-20 09:26:07,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:26:06" (2/3) ... [2024-11-20 09:26:07,303 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29799179 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:26:07, skipping insertion in model container [2024-11-20 09:26:07,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:26:07" (3/3) ... [2024-11-20 09:26:07,304 INFO L112 eAbstractionObserver]: Analyzing ICFG safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2024-11-20 09:26:07,318 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 09:26:07,318 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-20 09:26:07,318 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-20 09:26:07,364 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-20 09:26:07,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 39 transitions, 90 flow [2024-11-20 09:26:07,420 INFO L124 PetriNetUnfolderBase]: 1/36 cut-off events. [2024-11-20 09:26:07,420 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 09:26:07,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 36 events. 1/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 70 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2024-11-20 09:26:07,423 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 39 transitions, 90 flow [2024-11-20 09:26:07,427 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 36 transitions, 81 flow [2024-11-20 09:26:07,438 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 09:26:07,443 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;@70aadfae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 09:26:07,444 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-20 09:26:07,450 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-20 09:26:07,450 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2024-11-20 09:26:07,450 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 09:26:07,450 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:26:07,451 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-20 09:26:07,451 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-20 09:26:07,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:26:07,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1699796907, now seen corresponding path program 1 times [2024-11-20 09:26:07,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:26:07,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956035452] [2024-11-20 09:26:07,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:26:07,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:26:07,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:26:07,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:26:07,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:26:07,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956035452] [2024-11-20 09:26:07,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956035452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:26:07,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:26:07,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-20 09:26:07,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630649420] [2024-11-20 09:26:07,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:26:07,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 09:26:07,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:26:07,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 09:26:07,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 09:26:07,845 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 39 [2024-11-20 09:26:07,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:26:07,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:26:07,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 39 [2024-11-20 09:26:07,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:26:08,146 INFO L124 PetriNetUnfolderBase]: 453/866 cut-off events. [2024-11-20 09:26:08,147 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-20 09:26:08,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1603 conditions, 866 events. 453/866 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5081 event pairs, 144 based on Foata normal form. 36/875 useless extension candidates. Maximal degree in co-relation 1592. Up to 562 conditions per place. [2024-11-20 09:26:08,157 INFO L140 encePairwiseOnDemand]: 35/39 looper letters, 25 selfloop transitions, 2 changer transitions 2/45 dead transitions. [2024-11-20 09:26:08,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 160 flow [2024-11-20 09:26:08,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 09:26:08,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 09:26:08,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2024-11-20 09:26:08,166 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7606837606837606 [2024-11-20 09:26:08,168 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 81 flow. Second operand 3 states and 89 transitions. [2024-11-20 09:26:08,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 160 flow [2024-11-20 09:26:08,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 45 transitions, 156 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-20 09:26:08,172 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 76 flow [2024-11-20 09:26:08,174 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2024-11-20 09:26:08,176 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, -2 predicate places. [2024-11-20 09:26:08,176 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 76 flow [2024-11-20 09:26:08,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:26:08,177 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:26:08,177 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:26:08,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 09:26:08,177 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-20 09:26:08,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:26:08,178 INFO L85 PathProgramCache]: Analyzing trace with hash -152578652, now seen corresponding path program 1 times [2024-11-20 09:26:08,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:26:08,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375343299] [2024-11-20 09:26:08,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:26:08,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:26:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:26:08,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:26:08,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:26:08,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375343299] [2024-11-20 09:26:08,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375343299] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:26:08,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:26:08,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 09:26:08,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463822558] [2024-11-20 09:26:08,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:26:08,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 09:26:08,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:26:08,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 09:26:08,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 09:26:08,377 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2024-11-20 09:26:08,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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-11-20 09:26:08,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:26:08,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2024-11-20 09:26:08,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:26:08,620 INFO L124 PetriNetUnfolderBase]: 1065/1923 cut-off events. [2024-11-20 09:26:08,620 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2024-11-20 09:26:08,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3707 conditions, 1923 events. 1065/1923 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 12174 event pairs, 147 based on Foata normal form. 80/1901 useless extension candidates. Maximal degree in co-relation 3697. Up to 865 conditions per place. [2024-11-20 09:26:08,647 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 38 selfloop transitions, 5 changer transitions 1/56 dead transitions. [2024-11-20 09:26:08,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 56 transitions, 218 flow [2024-11-20 09:26:08,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 09:26:08,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-20 09:26:08,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2024-11-20 09:26:08,649 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6794871794871795 [2024-11-20 09:26:08,649 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 76 flow. Second operand 4 states and 106 transitions. [2024-11-20 09:26:08,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 56 transitions, 218 flow [2024-11-20 09:26:08,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 56 transitions, 210 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 09:26:08,651 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 106 flow [2024-11-20 09:26:08,652 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=106, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2024-11-20 09:26:08,653 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 0 predicate places. [2024-11-20 09:26:08,653 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 106 flow [2024-11-20 09:26:08,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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-11-20 09:26:08,653 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:26:08,654 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:26:08,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 09:26:08,654 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-20 09:26:08,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:26:08,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1583944500, now seen corresponding path program 1 times [2024-11-20 09:26:08,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:26:08,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407025705] [2024-11-20 09:26:08,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:26:08,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:26:08,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:26:08,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:26:08,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:26:08,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407025705] [2024-11-20 09:26:08,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407025705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:26:08,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:26:08,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 09:26:08,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772428679] [2024-11-20 09:26:08,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:26:08,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 09:26:08,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:26:08,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 09:26:08,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 09:26:08,915 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2024-11-20 09:26:08,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 106 flow. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:26:08,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:26:08,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2024-11-20 09:26:08,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:26:09,134 INFO L124 PetriNetUnfolderBase]: 741/1331 cut-off events. [2024-11-20 09:26:09,134 INFO L125 PetriNetUnfolderBase]: For 354/354 co-relation queries the response was YES. [2024-11-20 09:26:09,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3021 conditions, 1331 events. 741/1331 cut-off events. For 354/354 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 7437 event pairs, 73 based on Foata normal form. 68/1336 useless extension candidates. Maximal degree in co-relation 3009. Up to 417 conditions per place. [2024-11-20 09:26:09,139 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 48 selfloop transitions, 8 changer transitions 1/69 dead transitions. [2024-11-20 09:26:09,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 69 transitions, 307 flow [2024-11-20 09:26:09,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 09:26:09,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-20 09:26:09,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2024-11-20 09:26:09,141 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6871794871794872 [2024-11-20 09:26:09,141 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 106 flow. Second operand 5 states and 134 transitions. [2024-11-20 09:26:09,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 69 transitions, 307 flow [2024-11-20 09:26:09,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 69 transitions, 297 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-20 09:26:09,143 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 146 flow [2024-11-20 09:26:09,143 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=146, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2024-11-20 09:26:09,144 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 4 predicate places. [2024-11-20 09:26:09,144 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 146 flow [2024-11-20 09:26:09,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:26:09,144 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:26:09,144 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-11-20 09:26:09,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 09:26:09,144 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-20 09:26:09,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:26:09,145 INFO L85 PathProgramCache]: Analyzing trace with hash -680536806, now seen corresponding path program 1 times [2024-11-20 09:26:09,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:26:09,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352532844] [2024-11-20 09:26:09,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:26:09,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:26:09,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:26:09,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:26:09,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:26:09,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352532844] [2024-11-20 09:26:09,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352532844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:26:09,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:26:09,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 09:26:09,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123981460] [2024-11-20 09:26:09,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:26:09,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 09:26:09,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:26:09,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 09:26:09,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-20 09:26:09,426 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2024-11-20 09:26:09,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 146 flow. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 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-11-20 09:26:09,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:26:09,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2024-11-20 09:26:09,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:26:09,591 INFO L124 PetriNetUnfolderBase]: 465/799 cut-off events. [2024-11-20 09:26:09,591 INFO L125 PetriNetUnfolderBase]: For 680/680 co-relation queries the response was YES. [2024-11-20 09:26:09,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2091 conditions, 799 events. 465/799 cut-off events. For 680/680 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3658 event pairs, 59 based on Foata normal form. 36/802 useless extension candidates. Maximal degree in co-relation 2077. Up to 268 conditions per place. [2024-11-20 09:26:09,595 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 42 selfloop transitions, 11 changer transitions 1/66 dead transitions. [2024-11-20 09:26:09,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 66 transitions, 318 flow [2024-11-20 09:26:09,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 09:26:09,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 09:26:09,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 146 transitions. [2024-11-20 09:26:09,598 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6239316239316239 [2024-11-20 09:26:09,598 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 146 flow. Second operand 6 states and 146 transitions. [2024-11-20 09:26:09,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 66 transitions, 318 flow [2024-11-20 09:26:09,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 66 transitions, 293 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-20 09:26:09,603 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 160 flow [2024-11-20 09:26:09,603 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=160, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2024-11-20 09:26:09,605 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places. [2024-11-20 09:26:09,605 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 160 flow [2024-11-20 09:26:09,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 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-11-20 09:26:09,605 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:26:09,605 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] [2024-11-20 09:26:09,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 09:26:09,606 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-20 09:26:09,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:26:09,606 INFO L85 PathProgramCache]: Analyzing trace with hash 125502859, now seen corresponding path program 1 times [2024-11-20 09:26:09,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:26:09,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596956652] [2024-11-20 09:26:09,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:26:09,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:26:09,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:26:09,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:26:09,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:26:09,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596956652] [2024-11-20 09:26:09,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596956652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:26:09,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:26:09,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 09:26:09,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267791461] [2024-11-20 09:26:09,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:26:09,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 09:26:09,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:26:09,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 09:26:09,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 09:26:09,947 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-11-20 09:26:09,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 160 flow. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 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-11-20 09:26:09,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:26:09,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-11-20 09:26:09,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:26:10,164 INFO L124 PetriNetUnfolderBase]: 804/1497 cut-off events. [2024-11-20 09:26:10,165 INFO L125 PetriNetUnfolderBase]: For 698/715 co-relation queries the response was YES. [2024-11-20 09:26:10,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3490 conditions, 1497 events. 804/1497 cut-off events. For 698/715 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8364 event pairs, 195 based on Foata normal form. 8/1454 useless extension candidates. Maximal degree in co-relation 3475. Up to 543 conditions per place. [2024-11-20 09:26:10,172 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 34 selfloop transitions, 4 changer transitions 15/70 dead transitions. [2024-11-20 09:26:10,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 70 transitions, 340 flow [2024-11-20 09:26:10,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 09:26:10,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 09:26:10,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 138 transitions. [2024-11-20 09:26:10,175 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5897435897435898 [2024-11-20 09:26:10,175 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 160 flow. Second operand 6 states and 138 transitions. [2024-11-20 09:26:10,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 70 transitions, 340 flow [2024-11-20 09:26:10,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 70 transitions, 276 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-11-20 09:26:10,183 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 132 flow [2024-11-20 09:26:10,183 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=132, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2024-11-20 09:26:10,183 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 8 predicate places. [2024-11-20 09:26:10,184 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 132 flow [2024-11-20 09:26:10,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 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-11-20 09:26:10,184 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:26:10,184 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] [2024-11-20 09:26:10,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 09:26:10,184 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-20 09:26:10,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:26:10,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1716419513, now seen corresponding path program 2 times [2024-11-20 09:26:10,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:26:10,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251081259] [2024-11-20 09:26:10,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:26:10,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:26:10,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:26:11,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:26:11,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:26:11,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251081259] [2024-11-20 09:26:11,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251081259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:26:11,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:26:11,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 09:26:11,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353022685] [2024-11-20 09:26:11,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:26:11,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 09:26:11,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:26:11,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 09:26:11,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-20 09:26:11,503 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2024-11-20 09:26:11,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 132 flow. Second operand has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 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-11-20 09:26:11,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:26:11,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2024-11-20 09:26:11,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:26:12,074 INFO L124 PetriNetUnfolderBase]: 1058/1908 cut-off events. [2024-11-20 09:26:12,074 INFO L125 PetriNetUnfolderBase]: For 208/208 co-relation queries the response was YES. [2024-11-20 09:26:12,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4192 conditions, 1908 events. 1058/1908 cut-off events. For 208/208 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 10991 event pairs, 243 based on Foata normal form. 16/1844 useless extension candidates. Maximal degree in co-relation 4177. Up to 685 conditions per place. [2024-11-20 09:26:12,080 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 39 selfloop transitions, 12 changer transitions 41/108 dead transitions. [2024-11-20 09:26:12,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 108 transitions, 498 flow [2024-11-20 09:26:12,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 09:26:12,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-20 09:26:12,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 263 transitions. [2024-11-20 09:26:12,081 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5187376725838264 [2024-11-20 09:26:12,081 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 132 flow. Second operand 13 states and 263 transitions. [2024-11-20 09:26:12,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 108 transitions, 498 flow [2024-11-20 09:26:12,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 108 transitions, 468 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-11-20 09:26:12,084 INFO L231 Difference]: Finished difference. Result has 69 places, 49 transitions, 217 flow [2024-11-20 09:26:12,084 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=217, PETRI_PLACES=69, PETRI_TRANSITIONS=49} [2024-11-20 09:26:12,086 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 24 predicate places. [2024-11-20 09:26:12,086 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 49 transitions, 217 flow [2024-11-20 09:26:12,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 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-11-20 09:26:12,086 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:26:12,086 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] [2024-11-20 09:26:12,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 09:26:12,086 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-20 09:26:12,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:26:12,087 INFO L85 PathProgramCache]: Analyzing trace with hash 200658009, now seen corresponding path program 3 times [2024-11-20 09:26:12,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:26:12,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585987016] [2024-11-20 09:26:12,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:26:12,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:26:12,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:26:12,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:26:12,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:26:12,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585987016] [2024-11-20 09:26:12,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585987016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:26:12,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:26:12,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 09:26:12,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082999953] [2024-11-20 09:26:12,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:26:12,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 09:26:12,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:26:12,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 09:26:12,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 09:26:12,304 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-11-20 09:26:12,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 49 transitions, 217 flow. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 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-11-20 09:26:12,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:26:12,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-11-20 09:26:12,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:26:12,662 INFO L124 PetriNetUnfolderBase]: 1134/2172 cut-off events. [2024-11-20 09:26:12,662 INFO L125 PetriNetUnfolderBase]: For 874/884 co-relation queries the response was YES. [2024-11-20 09:26:12,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5036 conditions, 2172 events. 1134/2172 cut-off events. For 874/884 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 13646 event pairs, 320 based on Foata normal form. 32/2118 useless extension candidates. Maximal degree in co-relation 5013. Up to 480 conditions per place. [2024-11-20 09:26:12,671 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 25 selfloop transitions, 2 changer transitions 60/104 dead transitions. [2024-11-20 09:26:12,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 104 transitions, 541 flow [2024-11-20 09:26:12,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 09:26:12,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-20 09:26:12,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 237 transitions. [2024-11-20 09:26:12,673 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5524475524475524 [2024-11-20 09:26:12,673 INFO L175 Difference]: Start difference. First operand has 69 places, 49 transitions, 217 flow. Second operand 11 states and 237 transitions. [2024-11-20 09:26:12,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 104 transitions, 541 flow [2024-11-20 09:26:12,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 104 transitions, 489 flow, removed 22 selfloop flow, removed 8 redundant places. [2024-11-20 09:26:12,681 INFO L231 Difference]: Finished difference. Result has 73 places, 39 transitions, 154 flow [2024-11-20 09:26:12,682 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=154, PETRI_PLACES=73, PETRI_TRANSITIONS=39} [2024-11-20 09:26:12,683 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 28 predicate places. [2024-11-20 09:26:12,683 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 39 transitions, 154 flow [2024-11-20 09:26:12,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 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-11-20 09:26:12,683 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:26:12,683 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] [2024-11-20 09:26:12,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 09:26:12,684 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-20 09:26:12,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:26:12,684 INFO L85 PathProgramCache]: Analyzing trace with hash 280236441, now seen corresponding path program 4 times [2024-11-20 09:26:12,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:26:12,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324497833] [2024-11-20 09:26:12,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:26:12,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:26:12,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:26:13,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:26:13,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:26:13,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324497833] [2024-11-20 09:26:13,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324497833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:26:13,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:26:13,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 09:26:13,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148594121] [2024-11-20 09:26:13,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:26:13,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 09:26:13,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:26:13,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 09:26:13,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-20 09:26:13,388 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 39 [2024-11-20 09:26:13,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 39 transitions, 154 flow. Second operand has 9 states, 9 states have (on average 18.77777777777778) internal successors, (169), 9 states have internal predecessors, (169), 0 states have call successors, (0), 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-11-20 09:26:13,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:26:13,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 39 [2024-11-20 09:26:13,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:26:13,653 INFO L124 PetriNetUnfolderBase]: 309/626 cut-off events. [2024-11-20 09:26:13,654 INFO L125 PetriNetUnfolderBase]: For 245/245 co-relation queries the response was YES. [2024-11-20 09:26:13,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1428 conditions, 626 events. 309/626 cut-off events. For 245/245 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2869 event pairs, 118 based on Foata normal form. 8/589 useless extension candidates. Maximal degree in co-relation 1403. Up to 236 conditions per place. [2024-11-20 09:26:13,657 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 25 selfloop transitions, 4 changer transitions 21/70 dead transitions. [2024-11-20 09:26:13,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 70 transitions, 336 flow [2024-11-20 09:26:13,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 09:26:13,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-20 09:26:13,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 204 transitions. [2024-11-20 09:26:13,658 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5811965811965812 [2024-11-20 09:26:13,658 INFO L175 Difference]: Start difference. First operand has 73 places, 39 transitions, 154 flow. Second operand 9 states and 204 transitions. [2024-11-20 09:26:13,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 70 transitions, 336 flow [2024-11-20 09:26:13,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 70 transitions, 282 flow, removed 20 selfloop flow, removed 16 redundant places. [2024-11-20 09:26:13,660 INFO L231 Difference]: Finished difference. Result has 61 places, 40 transitions, 139 flow [2024-11-20 09:26:13,660 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=139, PETRI_PLACES=61, PETRI_TRANSITIONS=40} [2024-11-20 09:26:13,661 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 16 predicate places. [2024-11-20 09:26:13,661 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 40 transitions, 139 flow [2024-11-20 09:26:13,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.77777777777778) internal successors, (169), 9 states have internal predecessors, (169), 0 states have call successors, (0), 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-11-20 09:26:13,661 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:26:13,662 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] [2024-11-20 09:26:13,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 09:26:13,662 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-20 09:26:13,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:26:13,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1388240625, now seen corresponding path program 5 times [2024-11-20 09:26:13,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:26:13,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617823017] [2024-11-20 09:26:13,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:26:13,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:26:13,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:26:13,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:26:13,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:26:13,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617823017] [2024-11-20 09:26:13,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617823017] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:26:13,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:26:13,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 09:26:13,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209331628] [2024-11-20 09:26:13,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:26:13,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 09:26:13,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:26:13,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 09:26:13,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-20 09:26:13,903 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2024-11-20 09:26:13,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 40 transitions, 139 flow. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:26:13,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:26:13,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2024-11-20 09:26:13,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:26:14,062 INFO L124 PetriNetUnfolderBase]: 450/875 cut-off events. [2024-11-20 09:26:14,062 INFO L125 PetriNetUnfolderBase]: For 203/203 co-relation queries the response was YES. [2024-11-20 09:26:14,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1988 conditions, 875 events. 450/875 cut-off events. For 203/203 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4339 event pairs, 229 based on Foata normal form. 8/831 useless extension candidates. Maximal degree in co-relation 1970. Up to 328 conditions per place. [2024-11-20 09:26:14,066 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 24 selfloop transitions, 4 changer transitions 23/67 dead transitions. [2024-11-20 09:26:14,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 67 transitions, 321 flow [2024-11-20 09:26:14,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 09:26:14,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-20 09:26:14,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 141 transitions. [2024-11-20 09:26:14,067 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5164835164835165 [2024-11-20 09:26:14,068 INFO L175 Difference]: Start difference. First operand has 61 places, 40 transitions, 139 flow. Second operand 7 states and 141 transitions. [2024-11-20 09:26:14,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 67 transitions, 321 flow [2024-11-20 09:26:14,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 67 transitions, 302 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-11-20 09:26:14,069 INFO L231 Difference]: Finished difference. Result has 60 places, 39 transitions, 138 flow [2024-11-20 09:26:14,069 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=138, PETRI_PLACES=60, PETRI_TRANSITIONS=39} [2024-11-20 09:26:14,070 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 15 predicate places. [2024-11-20 09:26:14,070 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 39 transitions, 138 flow [2024-11-20 09:26:14,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:26:14,070 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:26:14,071 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] [2024-11-20 09:26:14,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 09:26:14,072 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-20 09:26:14,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:26:14,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1513453611, now seen corresponding path program 6 times [2024-11-20 09:26:14,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:26:14,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762058949] [2024-11-20 09:26:14,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:26:14,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:26:14,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 09:26:14,112 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 09:26:14,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 09:26:14,189 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 09:26:14,189 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 09:26:14,191 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-11-20 09:26:14,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-11-20 09:26:14,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-11-20 09:26:14,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-20 09:26:14,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-11-20 09:26:14,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-11-20 09:26:14,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 09:26:14,196 INFO L407 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1] [2024-11-20 09:26:14,273 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-20 09:26:14,273 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 09:26:14,279 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 09:26:14 BasicIcfg [2024-11-20 09:26:14,280 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 09:26:14,280 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 09:26:14,280 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 09:26:14,280 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 09:26:14,281 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:26:07" (3/4) ... [2024-11-20 09:26:14,281 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-20 09:26:14,352 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-20 09:26:14,352 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 09:26:14,353 INFO L158 Benchmark]: Toolchain (without parser) took 8244.92ms. Allocated memory was 190.8MB in the beginning and 371.2MB in the end (delta: 180.4MB). Free memory was 134.2MB in the beginning and 171.3MB in the end (delta: -37.1MB). Peak memory consumption was 144.1MB. Max. memory is 16.1GB. [2024-11-20 09:26:14,353 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 125.8MB. Free memory is still 98.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 09:26:14,353 INFO L158 Benchmark]: CACSL2BoogieTranslator took 475.35ms. Allocated memory is still 190.8MB. Free memory was 134.2MB in the beginning and 108.3MB in the end (delta: 25.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-20 09:26:14,354 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.67ms. Allocated memory is still 190.8MB. Free memory was 108.3MB in the beginning and 105.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 09:26:14,354 INFO L158 Benchmark]: Boogie Preprocessor took 59.34ms. Allocated memory is still 190.8MB. Free memory was 105.6MB in the beginning and 102.4MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 09:26:14,354 INFO L158 Benchmark]: RCFGBuilder took 604.07ms. Allocated memory is still 190.8MB. Free memory was 102.4MB in the beginning and 142.5MB in the end (delta: -40.1MB). Peak memory consumption was 43.9MB. Max. memory is 16.1GB. [2024-11-20 09:26:14,354 INFO L158 Benchmark]: TraceAbstraction took 6983.54ms. Allocated memory was 190.8MB in the beginning and 371.2MB in the end (delta: 180.4MB). Free memory was 142.5MB in the beginning and 182.8MB in the end (delta: -40.4MB). Peak memory consumption was 140.0MB. Max. memory is 16.1GB. [2024-11-20 09:26:14,354 INFO L158 Benchmark]: Witness Printer took 72.58ms. Allocated memory is still 371.2MB. Free memory was 182.8MB in the beginning and 171.3MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-20 09:26:14,360 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.12ms. Allocated memory is still 125.8MB. Free memory is still 98.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 475.35ms. Allocated memory is still 190.8MB. Free memory was 134.2MB in the beginning and 108.3MB in the end (delta: 25.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.67ms. Allocated memory is still 190.8MB. Free memory was 108.3MB in the beginning and 105.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.34ms. Allocated memory is still 190.8MB. Free memory was 105.6MB in the beginning and 102.4MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 604.07ms. Allocated memory is still 190.8MB. Free memory was 102.4MB in the beginning and 142.5MB in the end (delta: -40.1MB). Peak memory consumption was 43.9MB. Max. memory is 16.1GB. * TraceAbstraction took 6983.54ms. Allocated memory was 190.8MB in the beginning and 371.2MB in the end (delta: 180.4MB). Free memory was 142.5MB in the beginning and 182.8MB in the end (delta: -40.4MB). Peak memory consumption was 140.0MB. Max. memory is 16.1GB. * Witness Printer took 72.58ms. Allocated memory is still 371.2MB. Free memory was 182.8MB in the beginning and 171.3MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L829] 0 pthread_t t1828; [L830] FCALL, FORK 0 pthread_create(&t1828, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1828=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L831] 0 pthread_t t1829; [L832] FCALL, FORK 0 pthread_create(&t1829, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1828=-1, t1829=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 1 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L833] 0 pthread_t t1830; [L834] FCALL, FORK 0 pthread_create(&t1830, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1828=-1, t1829=0, t1830=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L784] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L801] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L804] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L744] 1 __unbuffered_p0_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L807] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L808] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L809] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L810] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L811] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EBX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L787] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L788] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L790] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L814] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1828=-1, t1829=0, t1830=1, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L841] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L842] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L843] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L844] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1828=-1, t1829=0, t1830=1, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L847] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1828=-1, t1829=0, t1830=1, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L19] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 830]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 832]: 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: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 64 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.8s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 486 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 462 mSDsluCounter, 216 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 187 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1317 IncrementalHoareTripleChecker+Invalid, 1361 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 29 mSDtfsCounter, 1317 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=217occurred in iteration=6, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 237 NumberOfCodeBlocks, 237 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 199 ConstructedInterpolants, 0 QuantifiedInterpolants, 1458 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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-11-20 09:26:14,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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