./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/mix037_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix037_power.oepc_pso.oepc_rmo.oepc.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 82646a2180350347ed217a12e2836ec5fdce4b0371f5e0f7afa776fd6812fa0f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 14:15:59,120 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 14:15:59,196 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 14:15:59,201 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 14:15:59,203 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 14:15:59,234 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 14:15:59,236 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 14:15:59,237 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 14:15:59,237 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 14:15:59,239 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 14:15:59,239 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 14:15:59,240 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 14:15:59,240 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 14:15:59,241 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 14:15:59,242 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 14:15:59,243 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 14:15:59,243 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 14:15:59,243 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 14:15:59,243 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 14:15:59,244 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 14:15:59,244 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 14:15:59,244 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 14:15:59,247 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 14:15:59,248 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 14:15:59,248 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 14:15:59,248 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 14:15:59,248 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 14:15:59,249 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 14:15:59,249 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 14:15:59,249 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 14:15:59,249 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 14:15:59,249 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 14:15:59,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:15:59,250 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 14:15:59,270 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 14:15:59,270 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 14:15:59,270 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 14:15:59,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 14:15:59,271 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 14:15:59,271 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 14:15:59,271 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 14:15:59,275 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 14:15:59,275 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 82646a2180350347ed217a12e2836ec5fdce4b0371f5e0f7afa776fd6812fa0f [2024-10-11 14:15:59,523 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 14:15:59,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 14:15:59,549 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 14:15:59,550 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 14:15:59,551 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 14:15:59,552 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix037_power.oepc_pso.oepc_rmo.oepc.i [2024-10-11 14:16:01,019 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 14:16:01,256 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 14:16:01,257 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix037_power.oepc_pso.oepc_rmo.oepc.i [2024-10-11 14:16:01,275 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6ca3b19a3/7efec25c85d647cd8379f6000d3ae5c3/FLAG2be40f89f [2024-10-11 14:16:01,288 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6ca3b19a3/7efec25c85d647cd8379f6000d3ae5c3 [2024-10-11 14:16:01,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 14:16:01,292 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 14:16:01,294 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 14:16:01,295 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 14:16:01,302 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 14:16:01,302 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:16:01" (1/1) ... [2024-10-11 14:16:01,303 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@210b820d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:16:01, skipping insertion in model container [2024-10-11 14:16:01,303 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:16:01" (1/1) ... [2024-10-11 14:16:01,353 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 14:16:01,551 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix037_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2024-10-11 14:16:01,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:16:01,800 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 14:16:01,814 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix037_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2024-10-11 14:16:01,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:16:01,928 INFO L204 MainTranslator]: Completed translation [2024-10-11 14:16:01,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:16:01 WrapperNode [2024-10-11 14:16:01,929 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 14:16:01,930 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 14:16:01,931 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 14:16:01,931 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 14:16:01,940 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:16:01" (1/1) ... [2024-10-11 14:16:01,963 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:16:01" (1/1) ... [2024-10-11 14:16:02,005 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2024-10-11 14:16:02,005 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 14:16:02,006 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 14:16:02,006 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 14:16:02,006 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 14:16:02,020 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:16:01" (1/1) ... [2024-10-11 14:16:02,021 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:16:01" (1/1) ... [2024-10-11 14:16:02,028 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:16:01" (1/1) ... [2024-10-11 14:16:02,064 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-10-11 14:16:02,065 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:16:01" (1/1) ... [2024-10-11 14:16:02,065 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:16:01" (1/1) ... [2024-10-11 14:16:02,075 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:16:01" (1/1) ... [2024-10-11 14:16:02,081 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:16:01" (1/1) ... [2024-10-11 14:16:02,083 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:16:01" (1/1) ... [2024-10-11 14:16:02,089 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:16:01" (1/1) ... [2024-10-11 14:16:02,092 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 14:16:02,097 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 14:16:02,097 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 14:16:02,097 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 14:16:02,098 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:16:01" (1/1) ... [2024-10-11 14:16:02,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:16:02,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:16:02,132 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 14:16:02,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 14:16:02,223 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-11 14:16:02,223 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 14:16:02,223 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-11 14:16:02,223 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-11 14:16:02,223 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-11 14:16:02,224 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-11 14:16:02,224 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-11 14:16:02,225 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-11 14:16:02,225 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-10-11 14:16:02,225 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-10-11 14:16:02,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 14:16:02,226 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-11 14:16:02,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 14:16:02,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 14:16:02,228 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 14:16:02,371 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 14:16:02,372 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 14:16:02,732 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 14:16:02,733 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 14:16:02,952 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 14:16:02,952 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 14:16:02,953 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:16:02 BoogieIcfgContainer [2024-10-11 14:16:02,953 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 14:16:02,955 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 14:16:02,956 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 14:16:02,959 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 14:16:02,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:16:01" (1/3) ... [2024-10-11 14:16:02,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16503da8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:16:02, skipping insertion in model container [2024-10-11 14:16:02,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:16:01" (2/3) ... [2024-10-11 14:16:02,961 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16503da8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:16:02, skipping insertion in model container [2024-10-11 14:16:02,962 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:16:02" (3/3) ... [2024-10-11 14:16:02,963 INFO L112 eAbstractionObserver]: Analyzing ICFG mix037_power.oepc_pso.oepc_rmo.oepc.i [2024-10-11 14:16:02,982 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 14:16:02,982 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 14:16:02,982 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 14:16:03,046 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 14:16:03,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 50 transitions, 116 flow [2024-10-11 14:16:03,127 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2024-10-11 14:16:03,127 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 14:16:03,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 46 events. 1/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 93 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2024-10-11 14:16:03,134 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 50 transitions, 116 flow [2024-10-11 14:16:03,138 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 46 transitions, 104 flow [2024-10-11 14:16:03,152 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:16:03,162 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;@4a64b6a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:16:03,163 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-11 14:16:03,169 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 14:16:03,170 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-10-11 14:16:03,170 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 14:16:03,170 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:16:03,171 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-10-11 14:16:03,171 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-11 14:16:03,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:16:03,178 INFO L85 PathProgramCache]: Analyzing trace with hash 12056438, now seen corresponding path program 1 times [2024-10-11 14:16:03,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:16:03,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203008262] [2024-10-11 14:16:03,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:16:03,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:16:03,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:16:03,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:16:03,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:16:03,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203008262] [2024-10-11 14:16:03,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203008262] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:16:03,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:16:03,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 14:16:03,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141629593] [2024-10-11 14:16:03,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:16:03,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:16:03,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:16:03,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:16:03,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:16:03,730 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 50 [2024-10-11 14:16:03,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:16:03,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:16:03,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 50 [2024-10-11 14:16:03,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:16:04,672 INFO L124 PetriNetUnfolderBase]: 2495/3975 cut-off events. [2024-10-11 14:16:04,672 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-10-11 14:16:04,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7551 conditions, 3975 events. 2495/3975 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 25027 event pairs, 1647 based on Foata normal form. 135/4039 useless extension candidates. Maximal degree in co-relation 7539. Up to 2779 conditions per place. [2024-10-11 14:16:04,710 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 37 selfloop transitions, 2 changer transitions 2/62 dead transitions. [2024-10-11 14:16:04,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 62 transitions, 227 flow [2024-10-11 14:16:04,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:16:04,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 14:16:04,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2024-10-11 14:16:04,722 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7933333333333333 [2024-10-11 14:16:04,723 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 119 transitions. [2024-10-11 14:16:04,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 62 transitions, 227 flow [2024-10-11 14:16:04,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 62 transitions, 220 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-11 14:16:04,729 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 98 flow [2024-10-11 14:16:04,734 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2024-10-11 14:16:04,738 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2024-10-11 14:16:04,740 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 98 flow [2024-10-11 14:16:04,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:16:04,741 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:16:04,741 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:16:04,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 14:16:04,742 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-11 14:16:04,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:16:04,743 INFO L85 PathProgramCache]: Analyzing trace with hash -2058737664, now seen corresponding path program 1 times [2024-10-11 14:16:04,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:16:04,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128546382] [2024-10-11 14:16:04,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:16:04,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:16:04,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:16:04,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:16:04,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:16:04,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128546382] [2024-10-11 14:16:04,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128546382] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:16:04,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:16:04,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:16:04,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716358857] [2024-10-11 14:16:04,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:16:05,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:16:05,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:16:05,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:16:05,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:16:05,012 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2024-10-11 14:16:05,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:16:05,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:16:05,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2024-10-11 14:16:05,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:16:06,605 INFO L124 PetriNetUnfolderBase]: 7779/12179 cut-off events. [2024-10-11 14:16:06,605 INFO L125 PetriNetUnfolderBase]: For 554/554 co-relation queries the response was YES. [2024-10-11 14:16:06,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23595 conditions, 12179 events. 7779/12179 cut-off events. For 554/554 co-relation queries the response was YES. Maximal size of possible extension queue 711. Compared 87349 event pairs, 1033 based on Foata normal form. 400/11957 useless extension candidates. Maximal degree in co-relation 23585. Up to 5841 conditions per place. [2024-10-11 14:16:06,678 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 52 selfloop transitions, 6 changer transitions 1/75 dead transitions. [2024-10-11 14:16:06,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 75 transitions, 290 flow [2024-10-11 14:16:06,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:16:06,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 14:16:06,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2024-10-11 14:16:06,681 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.705 [2024-10-11 14:16:06,681 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 98 flow. Second operand 4 states and 141 transitions. [2024-10-11 14:16:06,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 75 transitions, 290 flow [2024-10-11 14:16:06,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 75 transitions, 282 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 14:16:06,686 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 136 flow [2024-10-11 14:16:06,687 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2024-10-11 14:16:06,688 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, -1 predicate places. [2024-10-11 14:16:06,688 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 136 flow [2024-10-11 14:16:06,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:16:06,689 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:16:06,689 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:16:06,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 14:16:06,690 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-11 14:16:06,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:16:06,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1906851282, now seen corresponding path program 1 times [2024-10-11 14:16:06,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:16:06,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808615818] [2024-10-11 14:16:06,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:16:06,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:16:06,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:16:06,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:16:06,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:16:06,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808615818] [2024-10-11 14:16:06,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808615818] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:16:06,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:16:06,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:16:06,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749826858] [2024-10-11 14:16:06,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:16:06,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:16:06,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:16:06,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:16:06,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:16:06,988 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2024-10-11 14:16:06,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:16:06,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:16:06,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2024-10-11 14:16:06,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:16:08,529 INFO L124 PetriNetUnfolderBase]: 6075/9479 cut-off events. [2024-10-11 14:16:08,530 INFO L125 PetriNetUnfolderBase]: For 2276/2276 co-relation queries the response was YES. [2024-10-11 14:16:08,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21263 conditions, 9479 events. 6075/9479 cut-off events. For 2276/2276 co-relation queries the response was YES. Maximal size of possible extension queue 534. Compared 63907 event pairs, 451 based on Foata normal form. 364/9402 useless extension candidates. Maximal degree in co-relation 21251. Up to 3681 conditions per place. [2024-10-11 14:16:08,585 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 67 selfloop transitions, 10 changer transitions 1/94 dead transitions. [2024-10-11 14:16:08,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 94 transitions, 415 flow [2024-10-11 14:16:08,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:16:08,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 14:16:08,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 180 transitions. [2024-10-11 14:16:08,588 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.72 [2024-10-11 14:16:08,588 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 136 flow. Second operand 5 states and 180 transitions. [2024-10-11 14:16:08,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 94 transitions, 415 flow [2024-10-11 14:16:08,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 94 transitions, 404 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-11 14:16:08,598 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 188 flow [2024-10-11 14:16:08,598 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=188, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2024-10-11 14:16:08,599 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 3 predicate places. [2024-10-11 14:16:08,599 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 188 flow [2024-10-11 14:16:08,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:16:08,600 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:16:08,600 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:16:08,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 14:16:08,601 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-11 14:16:08,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:16:08,601 INFO L85 PathProgramCache]: Analyzing trace with hash -15923201, now seen corresponding path program 1 times [2024-10-11 14:16:08,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:16:08,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193015477] [2024-10-11 14:16:08,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:16:08,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:16:08,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:16:08,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-10-11 14:16:08,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:16:08,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193015477] [2024-10-11 14:16:08,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193015477] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:16:08,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:16:08,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:16:08,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533662930] [2024-10-11 14:16:08,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:16:08,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:16:08,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:16:08,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:16:08,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:16:08,897 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2024-10-11 14:16:08,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 188 flow. Second operand has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:16:08,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:16:08,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2024-10-11 14:16:08,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:16:09,898 INFO L124 PetriNetUnfolderBase]: 4027/6127 cut-off events. [2024-10-11 14:16:09,899 INFO L125 PetriNetUnfolderBase]: For 4654/4654 co-relation queries the response was YES. [2024-10-11 14:16:09,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15577 conditions, 6127 events. 4027/6127 cut-off events. For 4654/4654 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 35955 event pairs, 289 based on Foata normal form. 244/6113 useless extension candidates. Maximal degree in co-relation 15563. Up to 1788 conditions per place. [2024-10-11 14:16:09,935 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 80 selfloop transitions, 14 changer transitions 1/111 dead transitions. [2024-10-11 14:16:09,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 111 transitions, 546 flow [2024-10-11 14:16:09,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:16:09,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 14:16:09,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 217 transitions. [2024-10-11 14:16:09,939 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7233333333333334 [2024-10-11 14:16:09,939 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 188 flow. Second operand 6 states and 217 transitions. [2024-10-11 14:16:09,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 111 transitions, 546 flow [2024-10-11 14:16:09,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 111 transitions, 516 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-10-11 14:16:09,966 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 238 flow [2024-10-11 14:16:09,967 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=238, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2024-10-11 14:16:09,967 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 6 predicate places. [2024-10-11 14:16:09,968 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 238 flow [2024-10-11 14:16:09,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:16:09,968 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:16:09,968 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:16:09,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 14:16:09,969 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-11 14:16:09,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:16:09,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1398788504, now seen corresponding path program 1 times [2024-10-11 14:16:09,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:16:09,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662185614] [2024-10-11 14:16:09,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:16:09,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:16:10,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:16:10,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:16:10,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:16:10,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662185614] [2024-10-11 14:16:10,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662185614] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:16:10,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:16:10,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 14:16:10,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583791372] [2024-10-11 14:16:10,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:16:10,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 14:16:10,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:16:10,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 14:16:10,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 14:16:10,393 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2024-10-11 14:16:10,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 238 flow. Second operand has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:16:10,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:16:10,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2024-10-11 14:16:10,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:16:11,258 INFO L124 PetriNetUnfolderBase]: 2863/4175 cut-off events. [2024-10-11 14:16:11,259 INFO L125 PetriNetUnfolderBase]: For 5022/5022 co-relation queries the response was YES. [2024-10-11 14:16:11,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11602 conditions, 4175 events. 2863/4175 cut-off events. For 5022/5022 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 21757 event pairs, 231 based on Foata normal form. 96/4100 useless extension candidates. Maximal degree in co-relation 11587. Up to 1316 conditions per place. [2024-10-11 14:16:11,295 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 71 selfloop transitions, 18 changer transitions 1/106 dead transitions. [2024-10-11 14:16:11,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 106 transitions, 536 flow [2024-10-11 14:16:11,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 14:16:11,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-11 14:16:11,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 232 transitions. [2024-10-11 14:16:11,297 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6628571428571428 [2024-10-11 14:16:11,298 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 238 flow. Second operand 7 states and 232 transitions. [2024-10-11 14:16:11,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 106 transitions, 536 flow [2024-10-11 14:16:11,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 106 transitions, 490 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-10-11 14:16:11,332 INFO L231 Difference]: Finished difference. Result has 67 places, 55 transitions, 248 flow [2024-10-11 14:16:11,332 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=248, PETRI_PLACES=67, PETRI_TRANSITIONS=55} [2024-10-11 14:16:11,334 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 9 predicate places. [2024-10-11 14:16:11,335 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 248 flow [2024-10-11 14:16:11,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:16:11,335 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:16:11,336 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:16:11,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 14:16:11,336 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-11 14:16:11,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:16:11,338 INFO L85 PathProgramCache]: Analyzing trace with hash 2052048850, now seen corresponding path program 1 times [2024-10-11 14:16:11,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:16:11,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877535249] [2024-10-11 14:16:11,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:16:11,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:16:11,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:16:13,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:16:13,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:16:13,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877535249] [2024-10-11 14:16:13,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877535249] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:16:13,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:16:13,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 14:16:13,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923157926] [2024-10-11 14:16:13,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:16:13,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 14:16:13,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:16:13,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 14:16:13,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-11 14:16:13,477 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 50 [2024-10-11 14:16:13,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 248 flow. Second operand has 10 states, 10 states have (on average 20.5) internal successors, (205), 10 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:16:13,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:16:13,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 50 [2024-10-11 14:16:13,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:16:15,685 INFO L124 PetriNetUnfolderBase]: 11762/17969 cut-off events. [2024-10-11 14:16:15,686 INFO L125 PetriNetUnfolderBase]: For 7563/7973 co-relation queries the response was YES. [2024-10-11 14:16:15,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42291 conditions, 17969 events. 11762/17969 cut-off events. For 7563/7973 co-relation queries the response was YES. Maximal size of possible extension queue 886. Compared 124033 event pairs, 2520 based on Foata normal form. 16/17400 useless extension candidates. Maximal degree in co-relation 42275. Up to 4915 conditions per place. [2024-10-11 14:16:15,886 INFO L140 encePairwiseOnDemand]: 35/50 looper letters, 116 selfloop transitions, 29 changer transitions 14/185 dead transitions. [2024-10-11 14:16:15,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 185 transitions, 888 flow [2024-10-11 14:16:15,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 14:16:15,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-11 14:16:15,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 358 transitions. [2024-10-11 14:16:15,889 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6509090909090909 [2024-10-11 14:16:15,889 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 248 flow. Second operand 11 states and 358 transitions. [2024-10-11 14:16:15,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 185 transitions, 888 flow [2024-10-11 14:16:16,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 185 transitions, 762 flow, removed 32 selfloop flow, removed 10 redundant places. [2024-10-11 14:16:16,114 INFO L231 Difference]: Finished difference. Result has 76 places, 85 transitions, 375 flow [2024-10-11 14:16:16,114 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=375, PETRI_PLACES=76, PETRI_TRANSITIONS=85} [2024-10-11 14:16:16,116 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 18 predicate places. [2024-10-11 14:16:16,117 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 85 transitions, 375 flow [2024-10-11 14:16:16,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 20.5) internal successors, (205), 10 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:16:16,118 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:16:16,118 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:16:16,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 14:16:16,118 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-11 14:16:16,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:16:16,119 INFO L85 PathProgramCache]: Analyzing trace with hash -495964046, now seen corresponding path program 2 times [2024-10-11 14:16:16,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:16:16,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789069350] [2024-10-11 14:16:16,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:16:16,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:16:16,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:16:16,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:16:16,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:16:16,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789069350] [2024-10-11 14:16:16,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789069350] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:16:16,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:16:16,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 14:16:16,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794876963] [2024-10-11 14:16:16,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:16:16,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:16:16,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:16:16,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:16:16,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:16:16,632 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 50 [2024-10-11 14:16:16,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 85 transitions, 375 flow. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:16:16,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:16:16,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 50 [2024-10-11 14:16:16,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:16:19,646 INFO L124 PetriNetUnfolderBase]: 18780/28999 cut-off events. [2024-10-11 14:16:19,646 INFO L125 PetriNetUnfolderBase]: For 29269/29287 co-relation queries the response was YES. [2024-10-11 14:16:19,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79752 conditions, 28999 events. 18780/28999 cut-off events. For 29269/29287 co-relation queries the response was YES. Maximal size of possible extension queue 1487. Compared 217072 event pairs, 2069 based on Foata normal form. 26/27784 useless extension candidates. Maximal degree in co-relation 79732. Up to 10412 conditions per place. [2024-10-11 14:16:19,903 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 88 selfloop transitions, 41 changer transitions 13/167 dead transitions. [2024-10-11 14:16:19,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 167 transitions, 1026 flow [2024-10-11 14:16:19,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 14:16:19,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-11 14:16:19,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 207 transitions. [2024-10-11 14:16:19,905 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5914285714285714 [2024-10-11 14:16:19,905 INFO L175 Difference]: Start difference. First operand has 76 places, 85 transitions, 375 flow. Second operand 7 states and 207 transitions. [2024-10-11 14:16:19,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 167 transitions, 1026 flow [2024-10-11 14:16:20,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 167 transitions, 1020 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-10-11 14:16:20,034 INFO L231 Difference]: Finished difference. Result has 83 places, 112 transitions, 720 flow [2024-10-11 14:16:20,034 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=720, PETRI_PLACES=83, PETRI_TRANSITIONS=112} [2024-10-11 14:16:20,035 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 25 predicate places. [2024-10-11 14:16:20,035 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 112 transitions, 720 flow [2024-10-11 14:16:20,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:16:20,036 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:16:20,036 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:16:20,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 14:16:20,036 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-11 14:16:20,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:16:20,037 INFO L85 PathProgramCache]: Analyzing trace with hash -454716850, now seen corresponding path program 3 times [2024-10-11 14:16:20,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:16:20,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780404437] [2024-10-11 14:16:20,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:16:20,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:16:20,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:16:21,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:16:21,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:16:21,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780404437] [2024-10-11 14:16:21,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780404437] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:16:21,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:16:21,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 14:16:21,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33786989] [2024-10-11 14:16:21,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:16:21,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 14:16:21,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:16:21,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 14:16:21,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-11 14:16:21,134 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 50 [2024-10-11 14:16:21,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 112 transitions, 720 flow. Second operand has 9 states, 9 states have (on average 25.22222222222222) internal successors, (227), 9 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:16:21,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:16:21,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 50 [2024-10-11 14:16:21,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:16:23,973 INFO L124 PetriNetUnfolderBase]: 17850/29757 cut-off events. [2024-10-11 14:16:23,974 INFO L125 PetriNetUnfolderBase]: For 20083/21355 co-relation queries the response was YES. [2024-10-11 14:16:24,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75070 conditions, 29757 events. 17850/29757 cut-off events. For 20083/21355 co-relation queries the response was YES. Maximal size of possible extension queue 1901. Compared 258659 event pairs, 4909 based on Foata normal form. 574/27827 useless extension candidates. Maximal degree in co-relation 75045. Up to 8793 conditions per place. [2024-10-11 14:16:24,209 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 77 selfloop transitions, 14 changer transitions 31/186 dead transitions. [2024-10-11 14:16:24,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 186 transitions, 1229 flow [2024-10-11 14:16:24,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 14:16:24,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-11 14:16:24,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 293 transitions. [2024-10-11 14:16:24,211 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6511111111111111 [2024-10-11 14:16:24,211 INFO L175 Difference]: Start difference. First operand has 83 places, 112 transitions, 720 flow. Second operand 9 states and 293 transitions. [2024-10-11 14:16:24,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 186 transitions, 1229 flow [2024-10-11 14:16:24,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 186 transitions, 1223 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-10-11 14:16:24,280 INFO L231 Difference]: Finished difference. Result has 93 places, 112 transitions, 758 flow [2024-10-11 14:16:24,281 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=716, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=758, PETRI_PLACES=93, PETRI_TRANSITIONS=112} [2024-10-11 14:16:24,281 INFO L277 CegarLoopForPetriNet]: 58 programPoint places, 35 predicate places. [2024-10-11 14:16:24,282 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 112 transitions, 758 flow [2024-10-11 14:16:24,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 25.22222222222222) internal successors, (227), 9 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:16:24,282 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:16:24,282 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:16:24,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 14:16:24,283 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-11 14:16:24,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:16:24,283 INFO L85 PathProgramCache]: Analyzing trace with hash -323775688, now seen corresponding path program 4 times [2024-10-11 14:16:24,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:16:24,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125068712] [2024-10-11 14:16:24,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:16:24,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:16:24,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:16:24,368 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 14:16:24,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:16:24,530 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 14:16:24,531 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 14:16:24,532 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-10-11 14:16:24,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-10-11 14:16:24,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-10-11 14:16:24,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-10-11 14:16:24,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-10-11 14:16:24,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-10-11 14:16:24,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-10-11 14:16:24,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 14:16:24,535 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-10-11 14:16:24,637 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 14:16:24,637 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 14:16:24,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:16:24 BasicIcfg [2024-10-11 14:16:24,642 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 14:16:24,643 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 14:16:24,643 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 14:16:24,643 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 14:16:24,644 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:16:02" (3/4) ... [2024-10-11 14:16:24,644 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-11 14:16:24,749 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 14:16:24,749 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 14:16:24,750 INFO L158 Benchmark]: Toolchain (without parser) took 23457.60ms. Allocated memory was 157.3MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 100.3MB in the beginning and 994.7MB in the end (delta: -894.4MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-10-11 14:16:24,750 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 157.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 14:16:24,750 INFO L158 Benchmark]: CACSL2BoogieTranslator took 634.74ms. Allocated memory is still 157.3MB. Free memory was 100.3MB in the beginning and 73.6MB in the end (delta: 26.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-11 14:16:24,751 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.28ms. Allocated memory is still 157.3MB. Free memory was 73.6MB in the beginning and 71.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 14:16:24,751 INFO L158 Benchmark]: Boogie Preprocessor took 86.19ms. Allocated memory is still 157.3MB. Free memory was 71.0MB in the beginning and 67.1MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 14:16:24,751 INFO L158 Benchmark]: RCFGBuilder took 856.39ms. Allocated memory was 157.3MB in the beginning and 241.2MB in the end (delta: 83.9MB). Free memory was 67.1MB in the beginning and 157.5MB in the end (delta: -90.4MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2024-10-11 14:16:24,751 INFO L158 Benchmark]: TraceAbstraction took 21687.02ms. Allocated memory was 241.2MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 156.5MB in the beginning and 1.0GB in the end (delta: -858.1MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-10-11 14:16:24,752 INFO L158 Benchmark]: Witness Printer took 106.54ms. Allocated memory is still 2.2GB. Free memory was 1.0GB in the beginning and 994.7MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 14:16:24,754 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.19ms. Allocated memory is still 157.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 634.74ms. Allocated memory is still 157.3MB. Free memory was 100.3MB in the beginning and 73.6MB in the end (delta: 26.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.28ms. Allocated memory is still 157.3MB. Free memory was 73.6MB in the beginning and 71.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.19ms. Allocated memory is still 157.3MB. Free memory was 71.0MB in the beginning and 67.1MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 856.39ms. Allocated memory was 157.3MB in the beginning and 241.2MB in the end (delta: 83.9MB). Free memory was 67.1MB in the beginning and 157.5MB in the end (delta: -90.4MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. * TraceAbstraction took 21687.02ms. Allocated memory was 241.2MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 156.5MB in the beginning and 1.0GB in the end (delta: -858.1MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 106.54ms. Allocated memory is still 2.2GB. Free memory was 1.0GB in the beginning and 994.7MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool b$flush_delayed; [L724] 0 int b$mem_tmp; [L725] 0 _Bool b$r_buff0_thd0; [L726] 0 _Bool b$r_buff0_thd1; [L727] 0 _Bool b$r_buff0_thd2; [L728] 0 _Bool b$r_buff0_thd3; [L729] 0 _Bool b$r_buff0_thd4; [L730] 0 _Bool b$r_buff1_thd0; [L731] 0 _Bool b$r_buff1_thd1; [L732] 0 _Bool b$r_buff1_thd2; [L733] 0 _Bool b$r_buff1_thd3; [L734] 0 _Bool b$r_buff1_thd4; [L735] 0 _Bool b$read_delayed; [L736] 0 int *b$read_delayed_var; [L737] 0 int b$w_buff0; [L738] 0 _Bool b$w_buff0_used; [L739] 0 int b$w_buff1; [L740] 0 _Bool b$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t969; [L872] FCALL, FORK 0 pthread_create(&t969, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t969=-4, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t970; [L874] FCALL, FORK 0 pthread_create(&t970, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t969=-4, t970=-3, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t971; [L876] FCALL, FORK 0 pthread_create(&t971, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t969=-4, t970=-3, t971=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t972; [L878] FCALL, FORK 0 pthread_create(&t972, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t969=-4, t970=-3, t971=-2, t972=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 b$w_buff1 = b$w_buff0 [L755] 1 b$w_buff0 = 1 [L756] 1 b$w_buff1_used = b$w_buff0_used [L757] 1 b$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L759] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L760] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L761] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L762] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L763] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L764] 1 b$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L804] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L807] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L824] 4 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L827] 4 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L830] 4 __unbuffered_p3_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 b$flush_delayed = weak$$choice2 [L836] 4 b$mem_tmp = b [L837] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L838] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L839] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L840] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L841] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L843] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = b [L845] 4 b = b$flush_delayed ? b$mem_tmp : b [L846] 4 b$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z=1] [L810] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L811] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L812] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L813] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L814] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z=1] [L770] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L771] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L772] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L773] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L774] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z=1] [L790] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L791] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L792] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L793] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z=1] [L849] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L850] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L851] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L852] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L853] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z=1] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z=1] [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z=1] [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z=1] [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t969=-4, t970=-3, t971=-2, t972=-1, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z=1] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L885] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L886] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L887] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L888] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t969=-4, t970=-3, t971=-2, t972=-1, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z=1] [L891] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t969=-4, t970=-3, t971=-2, t972=-1, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z=1] [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z=1] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 878]: 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: 874]: 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: 872]: 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: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 85 locations, 7 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: 21.5s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 15.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 739 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 712 mSDsluCounter, 337 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 296 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1458 IncrementalHoareTripleChecker+Invalid, 1522 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 41 mSDtfsCounter, 1458 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=758occurred in iteration=8, InterpolantAutomatonStates: 52, 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.7s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 250 NumberOfCodeBlocks, 250 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 204 ConstructedInterpolants, 0 QuantifiedInterpolants, 1609 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-11 14:16:24,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE