./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b046eb92ec2f4af5c767436762d7e86376926c2222092f8f03ea795d781fd943 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 19:15:33,631 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 19:15:33,703 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 19:15:33,709 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 19:15:33,710 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 19:15:33,737 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 19:15:33,738 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 19:15:33,738 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 19:15:33,739 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 19:15:33,741 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 19:15:33,741 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 19:15:33,742 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 19:15:33,742 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 19:15:33,744 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 19:15:33,744 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 19:15:33,745 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 19:15:33,745 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 19:15:33,745 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 19:15:33,745 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 19:15:33,745 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 19:15:33,746 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 19:15:33,746 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 19:15:33,746 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 19:15:33,747 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 19:15:33,747 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 19:15:33,747 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 19:15:33,747 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 19:15:33,748 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 19:15:33,748 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 19:15:33,748 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 19:15:33,748 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 19:15:33,748 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 19:15:33,749 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 19:15:33,749 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 19:15:33,749 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 19:15:33,749 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 19:15:33,749 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 19:15:33,750 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 19:15:33,750 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 19:15:33,750 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 19:15:33,750 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 19:15:33,751 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 19:15:33,751 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b046eb92ec2f4af5c767436762d7e86376926c2222092f8f03ea795d781fd943 [2024-11-16 19:15:34,066 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 19:15:34,094 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 19:15:34,098 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 19:15:34,100 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 19:15:34,100 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 19:15:34,101 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-16 19:15:35,517 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 19:15:35,808 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 19:15:35,811 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-16 19:15:35,833 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35f5b6d1d/cb99d0b8d6e84ff0b5431bfacfba0dee/FLAGeb1dae42d [2024-11-16 19:15:35,851 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35f5b6d1d/cb99d0b8d6e84ff0b5431bfacfba0dee [2024-11-16 19:15:35,857 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 19:15:35,858 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 19:15:35,861 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 19:15:35,861 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 19:15:35,867 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 19:15:35,868 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:15:35" (1/1) ... [2024-11-16 19:15:35,869 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79892181 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:15:35, skipping insertion in model container [2024-11-16 19:15:35,869 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:15:35" (1/1) ... [2024-11-16 19:15:35,919 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 19:15:36,125 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2024-11-16 19:15:36,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 19:15:36,333 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 19:15:36,343 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2024-11-16 19:15:36,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 19:15:36,453 INFO L204 MainTranslator]: Completed translation [2024-11-16 19:15:36,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:15:36 WrapperNode [2024-11-16 19:15:36,454 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 19:15:36,455 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 19:15:36,455 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 19:15:36,455 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 19:15:36,461 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:15:36" (1/1) ... [2024-11-16 19:15:36,476 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:15:36" (1/1) ... [2024-11-16 19:15:36,504 INFO L138 Inliner]: procedures = 175, calls = 40, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 132 [2024-11-16 19:15:36,505 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 19:15:36,506 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 19:15:36,506 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 19:15:36,506 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 19:15:36,519 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:15:36" (1/1) ... [2024-11-16 19:15:36,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:15:36" (1/1) ... [2024-11-16 19:15:36,526 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:15:36" (1/1) ... [2024-11-16 19:15:36,554 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 19:15:36,554 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:15:36" (1/1) ... [2024-11-16 19:15:36,557 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:15:36" (1/1) ... [2024-11-16 19:15:36,569 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:15:36" (1/1) ... [2024-11-16 19:15:36,574 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:15:36" (1/1) ... [2024-11-16 19:15:36,577 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:15:36" (1/1) ... [2024-11-16 19:15:36,578 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:15:36" (1/1) ... [2024-11-16 19:15:36,584 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 19:15:36,587 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 19:15:36,587 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 19:15:36,588 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 19:15:36,588 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:15:36" (1/1) ... [2024-11-16 19:15:36,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 19:15:36,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 19:15:36,627 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 19:15:36,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 19:15:36,683 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-16 19:15:36,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 19:15:36,684 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-16 19:15:36,684 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-16 19:15:36,685 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-16 19:15:36,685 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-16 19:15:36,685 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-16 19:15:36,686 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-16 19:15:36,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 19:15:36,686 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-16 19:15:36,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 19:15:36,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 19:15:36,689 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-16 19:15:36,873 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 19:15:36,874 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 19:15:37,158 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-16 19:15:37,158 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 19:15:37,377 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 19:15:37,378 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 19:15:37,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:15:37 BoogieIcfgContainer [2024-11-16 19:15:37,378 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 19:15:37,383 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 19:15:37,383 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 19:15:37,386 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 19:15:37,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 07:15:35" (1/3) ... [2024-11-16 19:15:37,387 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49f7603d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:15:37, skipping insertion in model container [2024-11-16 19:15:37,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:15:36" (2/3) ... [2024-11-16 19:15:37,388 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49f7603d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:15:37, skipping insertion in model container [2024-11-16 19:15:37,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:15:37" (3/3) ... [2024-11-16 19:15:37,390 INFO L112 eAbstractionObserver]: Analyzing ICFG safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-16 19:15:37,407 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 19:15:37,408 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-16 19:15:37,408 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-16 19:15:37,466 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-16 19:15:37,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 38 transitions, 88 flow [2024-11-16 19:15:37,540 INFO L124 PetriNetUnfolderBase]: 1/35 cut-off events. [2024-11-16 19:15:37,541 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 19:15:37,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 35 events. 1/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2024-11-16 19:15:37,545 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 38 transitions, 88 flow [2024-11-16 19:15:37,551 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 35 transitions, 79 flow [2024-11-16 19:15:37,564 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 19:15:37,573 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;@2c6eca2b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 19:15:37,574 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-16 19:15:37,578 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 19:15:37,579 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-11-16 19:15:37,580 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 19:15:37,580 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:15:37,581 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-16 19:15:37,581 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:15:37,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:15:37,586 INFO L85 PathProgramCache]: Analyzing trace with hash 10960483, now seen corresponding path program 1 times [2024-11-16 19:15:37,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:15:37,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286064176] [2024-11-16 19:15:37,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:15:37,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:15:37,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:15:38,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:15:38,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:15:38,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286064176] [2024-11-16 19:15:38,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286064176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:15:38,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:15:38,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-16 19:15:38,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244640531] [2024-11-16 19:15:38,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:15:38,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 19:15:38,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:15:38,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 19:15:38,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 19:15:38,104 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 38 [2024-11-16 19:15:38,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 79 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:15:38,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:15:38,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 38 [2024-11-16 19:15:38,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:15:39,012 INFO L124 PetriNetUnfolderBase]: 3925/5677 cut-off events. [2024-11-16 19:15:39,012 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-11-16 19:15:39,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11374 conditions, 5677 events. 3925/5677 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 31271 event pairs, 420 based on Foata normal form. 180/5849 useless extension candidates. Maximal degree in co-relation 11363. Up to 4916 conditions per place. [2024-11-16 19:15:39,055 INFO L140 encePairwiseOnDemand]: 34/38 looper letters, 45 selfloop transitions, 2 changer transitions 2/54 dead transitions. [2024-11-16 19:15:39,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 54 transitions, 221 flow [2024-11-16 19:15:39,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 19:15:39,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 19:15:39,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2024-11-16 19:15:39,067 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-11-16 19:15:39,068 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 79 flow. Second operand 3 states and 76 transitions. [2024-11-16 19:15:39,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 54 transitions, 221 flow [2024-11-16 19:15:39,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 54 transitions, 216 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-16 19:15:39,075 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 74 flow [2024-11-16 19:15:39,079 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2024-11-16 19:15:39,085 INFO L277 CegarLoopForPetriNet]: 44 programPoint places, -2 predicate places. [2024-11-16 19:15:39,085 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 74 flow [2024-11-16 19:15:39,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:15:39,086 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:15:39,086 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:15:39,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 19:15:39,086 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:15:39,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:15:39,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1789702802, now seen corresponding path program 1 times [2024-11-16 19:15:39,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:15:39,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885652872] [2024-11-16 19:15:39,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:15:39,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:15:39,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:15:40,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:15:40,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:15:40,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885652872] [2024-11-16 19:15:40,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885652872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:15:40,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:15:40,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 19:15:40,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030643328] [2024-11-16 19:15:40,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:15:40,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 19:15:40,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:15:40,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 19:15:40,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 19:15:40,317 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2024-11-16 19:15:40,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 74 flow. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:15:40,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:15:40,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2024-11-16 19:15:40,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:15:41,825 INFO L124 PetriNetUnfolderBase]: 5773/8468 cut-off events. [2024-11-16 19:15:41,826 INFO L125 PetriNetUnfolderBase]: For 348/348 co-relation queries the response was YES. [2024-11-16 19:15:41,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17197 conditions, 8468 events. 5773/8468 cut-off events. For 348/348 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 48212 event pairs, 941 based on Foata normal form. 0/8272 useless extension candidates. Maximal degree in co-relation 17187. Up to 4875 conditions per place. [2024-11-16 19:15:41,867 INFO L140 encePairwiseOnDemand]: 26/38 looper letters, 53 selfloop transitions, 10 changer transitions 97/164 dead transitions. [2024-11-16 19:15:41,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 164 transitions, 678 flow [2024-11-16 19:15:41,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 19:15:41,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-16 19:15:41,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 247 transitions. [2024-11-16 19:15:41,871 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2024-11-16 19:15:41,871 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 74 flow. Second operand 12 states and 247 transitions. [2024-11-16 19:15:41,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 164 transitions, 678 flow [2024-11-16 19:15:41,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 164 transitions, 662 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 19:15:41,876 INFO L231 Difference]: Finished difference. Result has 59 places, 39 transitions, 167 flow [2024-11-16 19:15:41,876 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=167, PETRI_PLACES=59, PETRI_TRANSITIONS=39} [2024-11-16 19:15:41,877 INFO L277 CegarLoopForPetriNet]: 44 programPoint places, 15 predicate places. [2024-11-16 19:15:41,877 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 39 transitions, 167 flow [2024-11-16 19:15:41,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:15:41,877 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:15:41,878 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:15:41,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 19:15:41,878 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:15:41,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:15:41,878 INFO L85 PathProgramCache]: Analyzing trace with hash -761522449, now seen corresponding path program 1 times [2024-11-16 19:15:41,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:15:41,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450865486] [2024-11-16 19:15:41,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:15:41,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:15:41,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:15:42,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:15:42,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:15:42,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450865486] [2024-11-16 19:15:42,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450865486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:15:42,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:15:42,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 19:15:42,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630215497] [2024-11-16 19:15:42,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:15:42,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 19:15:42,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:15:42,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 19:15:42,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 19:15:42,180 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2024-11-16 19:15:42,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 39 transitions, 167 flow. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:15:42,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:15:42,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2024-11-16 19:15:42,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:15:43,122 INFO L124 PetriNetUnfolderBase]: 4440/6600 cut-off events. [2024-11-16 19:15:43,122 INFO L125 PetriNetUnfolderBase]: For 11477/11480 co-relation queries the response was YES. [2024-11-16 19:15:43,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21317 conditions, 6600 events. 4440/6600 cut-off events. For 11477/11480 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 34947 event pairs, 812 based on Foata normal form. 192/6783 useless extension candidates. Maximal degree in co-relation 21298. Up to 4646 conditions per place. [2024-11-16 19:15:43,171 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 51 selfloop transitions, 3 changer transitions 61/119 dead transitions. [2024-11-16 19:15:43,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 119 transitions, 767 flow [2024-11-16 19:15:43,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 19:15:43,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-16 19:15:43,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 140 transitions. [2024-11-16 19:15:43,173 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2024-11-16 19:15:43,173 INFO L175 Difference]: Start difference. First operand has 59 places, 39 transitions, 167 flow. Second operand 7 states and 140 transitions. [2024-11-16 19:15:43,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 119 transitions, 767 flow [2024-11-16 19:15:43,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 119 transitions, 715 flow, removed 26 selfloop flow, removed 5 redundant places. [2024-11-16 19:15:43,250 INFO L231 Difference]: Finished difference. Result has 56 places, 39 transitions, 170 flow [2024-11-16 19:15:43,254 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=170, PETRI_PLACES=56, PETRI_TRANSITIONS=39} [2024-11-16 19:15:43,255 INFO L277 CegarLoopForPetriNet]: 44 programPoint places, 12 predicate places. [2024-11-16 19:15:43,255 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 39 transitions, 170 flow [2024-11-16 19:15:43,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:15:43,255 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:15:43,256 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:15:43,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 19:15:43,256 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:15:43,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:15:43,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1424697072, now seen corresponding path program 1 times [2024-11-16 19:15:43,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:15:43,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166031584] [2024-11-16 19:15:43,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:15:43,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:15:43,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:15:43,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:15:43,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:15:43,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166031584] [2024-11-16 19:15:43,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166031584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:15:43,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:15:43,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 19:15:43,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081242077] [2024-11-16 19:15:43,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:15:43,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 19:15:43,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:15:43,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 19:15:43,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 19:15:43,824 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2024-11-16 19:15:43,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 39 transitions, 170 flow. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:15:43,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:15:43,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2024-11-16 19:15:43,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:15:44,863 INFO L124 PetriNetUnfolderBase]: 4155/6186 cut-off events. [2024-11-16 19:15:44,864 INFO L125 PetriNetUnfolderBase]: For 8568/8568 co-relation queries the response was YES. [2024-11-16 19:15:44,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19186 conditions, 6186 events. 4155/6186 cut-off events. For 8568/8568 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 32691 event pairs, 1611 based on Foata normal form. 138/6321 useless extension candidates. Maximal degree in co-relation 19165. Up to 5096 conditions per place. [2024-11-16 19:15:44,905 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 47 selfloop transitions, 3 changer transitions 43/97 dead transitions. [2024-11-16 19:15:44,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 97 transitions, 586 flow [2024-11-16 19:15:44,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 19:15:44,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-16 19:15:44,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2024-11-16 19:15:44,907 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48872180451127817 [2024-11-16 19:15:44,907 INFO L175 Difference]: Start difference. First operand has 56 places, 39 transitions, 170 flow. Second operand 7 states and 130 transitions. [2024-11-16 19:15:44,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 97 transitions, 586 flow [2024-11-16 19:15:44,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 97 transitions, 562 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-11-16 19:15:44,950 INFO L231 Difference]: Finished difference. Result has 57 places, 41 transitions, 191 flow [2024-11-16 19:15:44,950 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=191, PETRI_PLACES=57, PETRI_TRANSITIONS=41} [2024-11-16 19:15:44,952 INFO L277 CegarLoopForPetriNet]: 44 programPoint places, 13 predicate places. [2024-11-16 19:15:44,953 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 41 transitions, 191 flow [2024-11-16 19:15:44,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:15:44,954 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:15:44,954 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:15:44,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 19:15:44,954 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:15:44,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:15:44,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1932154461, now seen corresponding path program 1 times [2024-11-16 19:15:44,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:15:44,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974271262] [2024-11-16 19:15:44,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:15:44,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:15:44,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:15:45,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:15:45,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:15:45,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974271262] [2024-11-16 19:15:45,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974271262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:15:45,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:15:45,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 19:15:45,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888762408] [2024-11-16 19:15:45,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:15:45,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 19:15:45,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:15:45,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 19:15:45,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 19:15:45,213 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2024-11-16 19:15:45,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 41 transitions, 191 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:15:45,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:15:45,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2024-11-16 19:15:45,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:15:46,284 INFO L124 PetriNetUnfolderBase]: 6117/8977 cut-off events. [2024-11-16 19:15:46,285 INFO L125 PetriNetUnfolderBase]: For 13797/13803 co-relation queries the response was YES. [2024-11-16 19:15:46,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29618 conditions, 8977 events. 6117/8977 cut-off events. For 13797/13803 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 50079 event pairs, 833 based on Foata normal form. 160/9133 useless extension candidates. Maximal degree in co-relation 29596. Up to 4321 conditions per place. [2024-11-16 19:15:46,339 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 57 selfloop transitions, 5 changer transitions 48/114 dead transitions. [2024-11-16 19:15:46,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 114 transitions, 751 flow [2024-11-16 19:15:46,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 19:15:46,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 19:15:46,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 131 transitions. [2024-11-16 19:15:46,341 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5745614035087719 [2024-11-16 19:15:46,341 INFO L175 Difference]: Start difference. First operand has 57 places, 41 transitions, 191 flow. Second operand 6 states and 131 transitions. [2024-11-16 19:15:46,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 114 transitions, 751 flow [2024-11-16 19:15:46,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 114 transitions, 738 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-11-16 19:15:46,380 INFO L231 Difference]: Finished difference. Result has 58 places, 41 transitions, 204 flow [2024-11-16 19:15:46,380 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=204, PETRI_PLACES=58, PETRI_TRANSITIONS=41} [2024-11-16 19:15:46,381 INFO L277 CegarLoopForPetriNet]: 44 programPoint places, 14 predicate places. [2024-11-16 19:15:46,381 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 41 transitions, 204 flow [2024-11-16 19:15:46,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:15:46,382 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:15:46,382 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:15:46,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 19:15:46,382 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:15:46,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:15:46,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1545853489, now seen corresponding path program 2 times [2024-11-16 19:15:46,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:15:46,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082574423] [2024-11-16 19:15:46,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:15:46,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:15:46,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:15:46,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:15:46,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:15:46,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082574423] [2024-11-16 19:15:46,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082574423] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:15:46,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:15:46,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 19:15:46,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196277855] [2024-11-16 19:15:46,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:15:46,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 19:15:46,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:15:46,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 19:15:46,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 19:15:46,648 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2024-11-16 19:15:46,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 41 transitions, 204 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:15:46,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:15:46,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2024-11-16 19:15:46,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:15:48,363 INFO L124 PetriNetUnfolderBase]: 7643/11282 cut-off events. [2024-11-16 19:15:48,364 INFO L125 PetriNetUnfolderBase]: For 22287/22295 co-relation queries the response was YES. [2024-11-16 19:15:48,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37845 conditions, 11282 events. 7643/11282 cut-off events. For 22287/22295 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 64969 event pairs, 1667 based on Foata normal form. 265/11539 useless extension candidates. Maximal degree in co-relation 37821. Up to 3496 conditions per place. [2024-11-16 19:15:48,451 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 52 selfloop transitions, 4 changer transitions 99/159 dead transitions. [2024-11-16 19:15:48,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 159 transitions, 1052 flow [2024-11-16 19:15:48,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 19:15:48,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-16 19:15:48,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 226 transitions. [2024-11-16 19:15:48,454 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5406698564593302 [2024-11-16 19:15:48,454 INFO L175 Difference]: Start difference. First operand has 58 places, 41 transitions, 204 flow. Second operand 11 states and 226 transitions. [2024-11-16 19:15:48,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 159 transitions, 1052 flow [2024-11-16 19:15:48,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 159 transitions, 1007 flow, removed 15 selfloop flow, removed 6 redundant places. [2024-11-16 19:15:48,536 INFO L231 Difference]: Finished difference. Result has 69 places, 40 transitions, 208 flow [2024-11-16 19:15:48,537 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=208, PETRI_PLACES=69, PETRI_TRANSITIONS=40} [2024-11-16 19:15:48,537 INFO L277 CegarLoopForPetriNet]: 44 programPoint places, 25 predicate places. [2024-11-16 19:15:48,538 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 40 transitions, 208 flow [2024-11-16 19:15:48,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:15:48,538 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:15:48,538 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:15:48,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 19:15:48,538 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:15:48,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:15:48,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1674266787, now seen corresponding path program 1 times [2024-11-16 19:15:48,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:15:48,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925802504] [2024-11-16 19:15:48,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:15:48,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:15:48,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:15:48,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:15:48,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:15:48,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925802504] [2024-11-16 19:15:48,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925802504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:15:48,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:15:48,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 19:15:48,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794837104] [2024-11-16 19:15:48,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:15:48,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 19:15:48,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:15:48,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 19:15:48,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-16 19:15:48,919 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2024-11-16 19:15:48,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 40 transitions, 208 flow. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:15:48,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:15:48,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2024-11-16 19:15:48,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:15:49,777 INFO L124 PetriNetUnfolderBase]: 4859/7407 cut-off events. [2024-11-16 19:15:49,778 INFO L125 PetriNetUnfolderBase]: For 20314/20314 co-relation queries the response was YES. [2024-11-16 19:15:49,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25589 conditions, 7407 events. 4859/7407 cut-off events. For 20314/20314 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 40708 event pairs, 2017 based on Foata normal form. 111/7516 useless extension candidates. Maximal degree in co-relation 25561. Up to 6077 conditions per place. [2024-11-16 19:15:49,837 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 56 selfloop transitions, 8 changer transitions 43/111 dead transitions. [2024-11-16 19:15:49,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 111 transitions, 781 flow [2024-11-16 19:15:49,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 19:15:49,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-16 19:15:49,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-11-16 19:15:49,839 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4967105263157895 [2024-11-16 19:15:49,840 INFO L175 Difference]: Start difference. First operand has 69 places, 40 transitions, 208 flow. Second operand 8 states and 151 transitions. [2024-11-16 19:15:49,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 111 transitions, 781 flow [2024-11-16 19:15:49,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 111 transitions, 727 flow, removed 24 selfloop flow, removed 9 redundant places. [2024-11-16 19:15:49,893 INFO L231 Difference]: Finished difference. Result has 64 places, 44 transitions, 253 flow [2024-11-16 19:15:49,893 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=253, PETRI_PLACES=64, PETRI_TRANSITIONS=44} [2024-11-16 19:15:49,895 INFO L277 CegarLoopForPetriNet]: 44 programPoint places, 20 predicate places. [2024-11-16 19:15:49,896 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 44 transitions, 253 flow [2024-11-16 19:15:49,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:15:49,896 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:15:49,896 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:15:49,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 19:15:49,897 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:15:49,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:15:49,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1290830269, now seen corresponding path program 2 times [2024-11-16 19:15:49,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:15:49,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712721023] [2024-11-16 19:15:49,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:15:49,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:15:49,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:15:50,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:15:50,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:15:50,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712721023] [2024-11-16 19:15:50,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712721023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:15:50,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:15:50,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 19:15:50,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899881645] [2024-11-16 19:15:50,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:15:50,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 19:15:50,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:15:50,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 19:15:50,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-16 19:15:50,456 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2024-11-16 19:15:50,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 44 transitions, 253 flow. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:15:50,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:15:50,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2024-11-16 19:15:50,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:15:51,253 INFO L124 PetriNetUnfolderBase]: 4751/7235 cut-off events. [2024-11-16 19:15:51,253 INFO L125 PetriNetUnfolderBase]: For 18248/18248 co-relation queries the response was YES. [2024-11-16 19:15:51,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25551 conditions, 7235 events. 4751/7235 cut-off events. For 18248/18248 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 39493 event pairs, 1957 based on Foata normal form. 111/7344 useless extension candidates. Maximal degree in co-relation 25525. Up to 6029 conditions per place. [2024-11-16 19:15:51,301 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 53 selfloop transitions, 8 changer transitions 43/108 dead transitions. [2024-11-16 19:15:51,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 108 transitions, 772 flow [2024-11-16 19:15:51,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 19:15:51,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-16 19:15:51,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-11-16 19:15:51,303 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4868421052631579 [2024-11-16 19:15:51,303 INFO L175 Difference]: Start difference. First operand has 64 places, 44 transitions, 253 flow. Second operand 8 states and 148 transitions. [2024-11-16 19:15:51,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 108 transitions, 772 flow [2024-11-16 19:15:51,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 108 transitions, 724 flow, removed 21 selfloop flow, removed 5 redundant places. [2024-11-16 19:15:51,359 INFO L231 Difference]: Finished difference. Result has 67 places, 44 transitions, 252 flow [2024-11-16 19:15:51,359 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=252, PETRI_PLACES=67, PETRI_TRANSITIONS=44} [2024-11-16 19:15:51,360 INFO L277 CegarLoopForPetriNet]: 44 programPoint places, 23 predicate places. [2024-11-16 19:15:51,360 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 44 transitions, 252 flow [2024-11-16 19:15:51,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:15:51,364 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:15:51,364 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:15:51,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 19:15:51,364 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:15:51,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:15:51,365 INFO L85 PathProgramCache]: Analyzing trace with hash -6668238, now seen corresponding path program 1 times [2024-11-16 19:15:51,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:15:51,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400436042] [2024-11-16 19:15:51,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:15:51,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:15:51,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:15:52,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:15:52,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:15:52,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400436042] [2024-11-16 19:15:52,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400436042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:15:52,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:15:52,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 19:15:52,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703680996] [2024-11-16 19:15:52,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:15:52,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 19:15:52,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:15:52,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 19:15:52,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 19:15:52,447 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2024-11-16 19:15:52,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 44 transitions, 252 flow. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:15:52,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:15:52,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2024-11-16 19:15:52,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:15:53,207 INFO L124 PetriNetUnfolderBase]: 5090/7726 cut-off events. [2024-11-16 19:15:53,207 INFO L125 PetriNetUnfolderBase]: For 19945/19945 co-relation queries the response was YES. [2024-11-16 19:15:53,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27438 conditions, 7726 events. 5090/7726 cut-off events. For 19945/19945 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 42315 event pairs, 1671 based on Foata normal form. 118/7842 useless extension candidates. Maximal degree in co-relation 27410. Up to 6382 conditions per place. [2024-11-16 19:15:53,256 INFO L140 encePairwiseOnDemand]: 26/38 looper letters, 60 selfloop transitions, 11 changer transitions 34/109 dead transitions. [2024-11-16 19:15:53,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 109 transitions, 796 flow [2024-11-16 19:15:53,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 19:15:53,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 19:15:53,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2024-11-16 19:15:53,258 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5526315789473685 [2024-11-16 19:15:53,259 INFO L175 Difference]: Start difference. First operand has 67 places, 44 transitions, 252 flow. Second operand 6 states and 126 transitions. [2024-11-16 19:15:53,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 109 transitions, 796 flow [2024-11-16 19:15:53,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 109 transitions, 766 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-11-16 19:15:53,313 INFO L231 Difference]: Finished difference. Result has 64 places, 51 transitions, 336 flow [2024-11-16 19:15:53,313 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=336, PETRI_PLACES=64, PETRI_TRANSITIONS=51} [2024-11-16 19:15:53,315 INFO L277 CegarLoopForPetriNet]: 44 programPoint places, 20 predicate places. [2024-11-16 19:15:53,315 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 51 transitions, 336 flow [2024-11-16 19:15:53,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:15:53,317 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:15:53,317 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:15:53,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 19:15:53,317 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:15:53,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:15:53,317 INFO L85 PathProgramCache]: Analyzing trace with hash 127697390, now seen corresponding path program 2 times [2024-11-16 19:15:53,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:15:53,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823324467] [2024-11-16 19:15:53,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:15:53,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:15:53,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:15:53,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:15:53,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:15:53,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823324467] [2024-11-16 19:15:53,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823324467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:15:53,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:15:53,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 19:15:53,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128899486] [2024-11-16 19:15:53,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:15:53,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 19:15:53,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:15:53,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 19:15:53,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 19:15:53,455 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 38 [2024-11-16 19:15:53,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 51 transitions, 336 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:15:53,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:15:53,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 38 [2024-11-16 19:15:53,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:15:54,004 INFO L124 PetriNetUnfolderBase]: 4044/6319 cut-off events. [2024-11-16 19:15:54,005 INFO L125 PetriNetUnfolderBase]: For 17954/17957 co-relation queries the response was YES. [2024-11-16 19:15:54,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22655 conditions, 6319 events. 4044/6319 cut-off events. For 17954/17957 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 35712 event pairs, 579 based on Foata normal form. 294/6608 useless extension candidates. Maximal degree in co-relation 22628. Up to 3440 conditions per place. [2024-11-16 19:15:54,034 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 80 selfloop transitions, 5 changer transitions 12/101 dead transitions. [2024-11-16 19:15:54,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 101 transitions, 873 flow [2024-11-16 19:15:54,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 19:15:54,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-16 19:15:54,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2024-11-16 19:15:54,039 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6052631578947368 [2024-11-16 19:15:54,039 INFO L175 Difference]: Start difference. First operand has 64 places, 51 transitions, 336 flow. Second operand 4 states and 92 transitions. [2024-11-16 19:15:54,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 101 transitions, 873 flow [2024-11-16 19:15:54,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 101 transitions, 806 flow, removed 21 selfloop flow, removed 4 redundant places. [2024-11-16 19:15:54,058 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 319 flow [2024-11-16 19:15:54,058 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=319, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2024-11-16 19:15:54,059 INFO L277 CegarLoopForPetriNet]: 44 programPoint places, 19 predicate places. [2024-11-16 19:15:54,059 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 319 flow [2024-11-16 19:15:54,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:15:54,059 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:15:54,060 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:15:54,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 19:15:54,060 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:15:54,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:15:54,062 INFO L85 PathProgramCache]: Analyzing trace with hash -855207215, now seen corresponding path program 1 times [2024-11-16 19:15:54,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:15:54,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441959139] [2024-11-16 19:15:54,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:15:54,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:15:54,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:15:54,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:15:54,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:15:54,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441959139] [2024-11-16 19:15:54,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441959139] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:15:54,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:15:54,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 19:15:54,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34213744] [2024-11-16 19:15:54,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:15:54,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 19:15:54,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:15:54,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 19:15:54,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-16 19:15:54,959 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2024-11-16 19:15:54,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 319 flow. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:15:54,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:15:54,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2024-11-16 19:15:54,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:15:55,799 INFO L124 PetriNetUnfolderBase]: 3891/6036 cut-off events. [2024-11-16 19:15:55,799 INFO L125 PetriNetUnfolderBase]: For 16082/16082 co-relation queries the response was YES. [2024-11-16 19:15:55,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23133 conditions, 6036 events. 3891/6036 cut-off events. For 16082/16082 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 32426 event pairs, 1765 based on Foata normal form. 56/6090 useless extension candidates. Maximal degree in co-relation 23106. Up to 5057 conditions per place. [2024-11-16 19:15:55,834 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 69 selfloop transitions, 17 changer transitions 51/141 dead transitions. [2024-11-16 19:15:55,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 141 transitions, 1158 flow [2024-11-16 19:15:55,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 19:15:55,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-16 19:15:55,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 188 transitions. [2024-11-16 19:15:55,836 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.44976076555023925 [2024-11-16 19:15:55,836 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 319 flow. Second operand 11 states and 188 transitions. [2024-11-16 19:15:55,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 141 transitions, 1158 flow [2024-11-16 19:15:55,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 141 transitions, 1135 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-11-16 19:15:55,856 INFO L231 Difference]: Finished difference. Result has 79 places, 60 transitions, 492 flow [2024-11-16 19:15:55,856 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=492, PETRI_PLACES=79, PETRI_TRANSITIONS=60} [2024-11-16 19:15:55,857 INFO L277 CegarLoopForPetriNet]: 44 programPoint places, 35 predicate places. [2024-11-16 19:15:55,857 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 60 transitions, 492 flow [2024-11-16 19:15:55,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:15:55,858 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:15:55,858 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:15:55,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 19:15:55,858 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:15:55,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:15:55,860 INFO L85 PathProgramCache]: Analyzing trace with hash -2022820531, now seen corresponding path program 2 times [2024-11-16 19:15:55,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:15:55,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543585442] [2024-11-16 19:15:55,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:15:55,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:15:55,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:15:56,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:15:56,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:15:56,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543585442] [2024-11-16 19:15:56,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543585442] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:15:56,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:15:56,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 19:15:56,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232430029] [2024-11-16 19:15:56,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:15:56,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 19:15:56,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:15:56,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 19:15:56,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-16 19:15:56,951 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2024-11-16 19:15:56,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 60 transitions, 492 flow. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:15:56,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:15:56,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2024-11-16 19:15:56,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:15:57,611 INFO L124 PetriNetUnfolderBase]: 3815/5962 cut-off events. [2024-11-16 19:15:57,611 INFO L125 PetriNetUnfolderBase]: For 36982/36982 co-relation queries the response was YES. [2024-11-16 19:15:57,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27025 conditions, 5962 events. 3815/5962 cut-off events. For 36982/36982 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 32332 event pairs, 2124 based on Foata normal form. 96/6056 useless extension candidates. Maximal degree in co-relation 26990. Up to 5040 conditions per place. [2024-11-16 19:15:57,649 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 71 selfloop transitions, 9 changer transitions 38/122 dead transitions. [2024-11-16 19:15:57,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 122 transitions, 1264 flow [2024-11-16 19:15:57,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 19:15:57,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-16 19:15:57,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2024-11-16 19:15:57,650 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4605263157894737 [2024-11-16 19:15:57,650 INFO L175 Difference]: Start difference. First operand has 79 places, 60 transitions, 492 flow. Second operand 8 states and 140 transitions. [2024-11-16 19:15:57,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 122 transitions, 1264 flow [2024-11-16 19:15:57,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 122 transitions, 1225 flow, removed 17 selfloop flow, removed 3 redundant places. [2024-11-16 19:15:57,697 INFO L231 Difference]: Finished difference. Result has 83 places, 66 transitions, 595 flow [2024-11-16 19:15:57,697 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=595, PETRI_PLACES=83, PETRI_TRANSITIONS=66} [2024-11-16 19:15:57,699 INFO L277 CegarLoopForPetriNet]: 44 programPoint places, 39 predicate places. [2024-11-16 19:15:57,699 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 66 transitions, 595 flow [2024-11-16 19:15:57,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:15:57,699 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:15:57,700 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:15:57,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 19:15:57,700 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:15:57,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:15:57,700 INFO L85 PathProgramCache]: Analyzing trace with hash -730910933, now seen corresponding path program 1 times [2024-11-16 19:15:57,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:15:57,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934650624] [2024-11-16 19:15:57,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:15:57,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:15:57,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:15:57,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:15:57,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:15:57,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934650624] [2024-11-16 19:15:57,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934650624] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:15:57,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:15:57,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 19:15:57,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739057677] [2024-11-16 19:15:57,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:15:57,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 19:15:57,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:15:57,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 19:15:57,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 19:15:57,872 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 38 [2024-11-16 19:15:57,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 66 transitions, 595 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:15:57,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:15:57,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 38 [2024-11-16 19:15:57,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:15:58,386 INFO L124 PetriNetUnfolderBase]: 2409/3872 cut-off events. [2024-11-16 19:15:58,387 INFO L125 PetriNetUnfolderBase]: For 29926/29929 co-relation queries the response was YES. [2024-11-16 19:15:58,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17530 conditions, 3872 events. 2409/3872 cut-off events. For 29926/29929 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 20420 event pairs, 267 based on Foata normal form. 228/4095 useless extension candidates. Maximal degree in co-relation 17490. Up to 1253 conditions per place. [2024-11-16 19:15:58,416 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 98 selfloop transitions, 8 changer transitions 11/121 dead transitions. [2024-11-16 19:15:58,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 121 transitions, 1387 flow [2024-11-16 19:15:58,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 19:15:58,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-16 19:15:58,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 115 transitions. [2024-11-16 19:15:58,418 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6052631578947368 [2024-11-16 19:15:58,418 INFO L175 Difference]: Start difference. First operand has 83 places, 66 transitions, 595 flow. Second operand 5 states and 115 transitions. [2024-11-16 19:15:58,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 121 transitions, 1387 flow [2024-11-16 19:15:58,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 121 transitions, 1325 flow, removed 26 selfloop flow, removed 5 redundant places. [2024-11-16 19:15:58,446 INFO L231 Difference]: Finished difference. Result has 80 places, 64 transitions, 562 flow [2024-11-16 19:15:58,446 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=562, PETRI_PLACES=80, PETRI_TRANSITIONS=64} [2024-11-16 19:15:58,447 INFO L277 CegarLoopForPetriNet]: 44 programPoint places, 36 predicate places. [2024-11-16 19:15:58,448 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 64 transitions, 562 flow [2024-11-16 19:15:58,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:15:58,448 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:15:58,448 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] [2024-11-16 19:15:58,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 19:15:58,448 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:15:58,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:15:58,449 INFO L85 PathProgramCache]: Analyzing trace with hash 318102746, now seen corresponding path program 1 times [2024-11-16 19:15:58,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:15:58,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396409281] [2024-11-16 19:15:58,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:15:58,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:15:58,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:15:58,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:15:58,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:15:58,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396409281] [2024-11-16 19:15:58,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396409281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:15:58,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:15:58,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 19:15:58,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680716012] [2024-11-16 19:15:58,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:15:58,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 19:15:58,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:15:58,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 19:15:58,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-16 19:15:58,677 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 38 [2024-11-16 19:15:58,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 64 transitions, 562 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:15:58,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:15:58,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 38 [2024-11-16 19:15:58,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:15:58,964 INFO L124 PetriNetUnfolderBase]: 1392/2265 cut-off events. [2024-11-16 19:15:58,964 INFO L125 PetriNetUnfolderBase]: For 16026/16029 co-relation queries the response was YES. [2024-11-16 19:15:58,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10325 conditions, 2265 events. 1392/2265 cut-off events. For 16026/16029 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 11114 event pairs, 176 based on Foata normal form. 88/2348 useless extension candidates. Maximal degree in co-relation 10286. Up to 824 conditions per place. [2024-11-16 19:15:58,976 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 63 selfloop transitions, 11 changer transitions 32/110 dead transitions. [2024-11-16 19:15:58,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 110 transitions, 1168 flow [2024-11-16 19:15:58,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 19:15:58,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 19:15:58,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2024-11-16 19:15:58,977 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5131578947368421 [2024-11-16 19:15:58,977 INFO L175 Difference]: Start difference. First operand has 80 places, 64 transitions, 562 flow. Second operand 6 states and 117 transitions. [2024-11-16 19:15:58,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 110 transitions, 1168 flow [2024-11-16 19:15:59,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 110 transitions, 1012 flow, removed 60 selfloop flow, removed 10 redundant places. [2024-11-16 19:15:59,011 INFO L231 Difference]: Finished difference. Result has 77 places, 47 transitions, 348 flow [2024-11-16 19:15:59,012 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=348, PETRI_PLACES=77, PETRI_TRANSITIONS=47} [2024-11-16 19:15:59,012 INFO L277 CegarLoopForPetriNet]: 44 programPoint places, 33 predicate places. [2024-11-16 19:15:59,012 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 47 transitions, 348 flow [2024-11-16 19:15:59,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:15:59,013 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:15:59,013 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:15:59,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 19:15:59,013 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:15:59,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:15:59,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1524585572, now seen corresponding path program 1 times [2024-11-16 19:15:59,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:15:59,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333105873] [2024-11-16 19:15:59,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:15:59,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:15:59,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:16:00,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:16:00,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:16:00,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333105873] [2024-11-16 19:16:00,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333105873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:16:00,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:16:00,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 19:16:00,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387545611] [2024-11-16 19:16:00,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:16:00,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 19:16:00,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:16:00,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 19:16:00,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-16 19:16:00,332 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2024-11-16 19:16:00,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 47 transitions, 348 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:16:00,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:16:00,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2024-11-16 19:16:00,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:16:00,751 INFO L124 PetriNetUnfolderBase]: 779/1259 cut-off events. [2024-11-16 19:16:00,751 INFO L125 PetriNetUnfolderBase]: For 6374/6374 co-relation queries the response was YES. [2024-11-16 19:16:00,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5373 conditions, 1259 events. 779/1259 cut-off events. For 6374/6374 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4988 event pairs, 186 based on Foata normal form. 8/1267 useless extension candidates. Maximal degree in co-relation 5339. Up to 789 conditions per place. [2024-11-16 19:16:00,757 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 54 selfloop transitions, 11 changer transitions 15/84 dead transitions. [2024-11-16 19:16:00,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 84 transitions, 717 flow [2024-11-16 19:16:00,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 19:16:00,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-16 19:16:00,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions. [2024-11-16 19:16:00,758 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.41353383458646614 [2024-11-16 19:16:00,758 INFO L175 Difference]: Start difference. First operand has 77 places, 47 transitions, 348 flow. Second operand 7 states and 110 transitions. [2024-11-16 19:16:00,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 84 transitions, 717 flow [2024-11-16 19:16:00,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 84 transitions, 509 flow, removed 62 selfloop flow, removed 20 redundant places. [2024-11-16 19:16:00,768 INFO L231 Difference]: Finished difference. Result has 65 places, 48 transitions, 273 flow [2024-11-16 19:16:00,768 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=273, PETRI_PLACES=65, PETRI_TRANSITIONS=48} [2024-11-16 19:16:00,770 INFO L277 CegarLoopForPetriNet]: 44 programPoint places, 21 predicate places. [2024-11-16 19:16:00,770 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 48 transitions, 273 flow [2024-11-16 19:16:00,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:16:00,771 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:16:00,771 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:16:00,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 19:16:00,771 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:16:00,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:16:00,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1017953954, now seen corresponding path program 2 times [2024-11-16 19:16:00,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:16:00,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859465528] [2024-11-16 19:16:00,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:16:00,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:16:00,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:16:02,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:16:02,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:16:02,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859465528] [2024-11-16 19:16:02,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859465528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:16:02,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:16:02,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 19:16:02,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257624080] [2024-11-16 19:16:02,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:16:02,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 19:16:02,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:16:02,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 19:16:02,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-16 19:16:02,164 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2024-11-16 19:16:02,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 48 transitions, 273 flow. Second operand has 11 states, 11 states have (on average 9.181818181818182) internal successors, (101), 11 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:16:02,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:16:02,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2024-11-16 19:16:02,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:16:02,688 INFO L124 PetriNetUnfolderBase]: 911/1487 cut-off events. [2024-11-16 19:16:02,690 INFO L125 PetriNetUnfolderBase]: For 2304/2304 co-relation queries the response was YES. [2024-11-16 19:16:02,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4665 conditions, 1487 events. 911/1487 cut-off events. For 2304/2304 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6239 event pairs, 244 based on Foata normal form. 8/1495 useless extension candidates. Maximal degree in co-relation 4643. Up to 657 conditions per place. [2024-11-16 19:16:02,696 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 48 selfloop transitions, 5 changer transitions 44/101 dead transitions. [2024-11-16 19:16:02,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 101 transitions, 667 flow [2024-11-16 19:16:02,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 19:16:02,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-16 19:16:02,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 137 transitions. [2024-11-16 19:16:02,699 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.40058479532163743 [2024-11-16 19:16:02,699 INFO L175 Difference]: Start difference. First operand has 65 places, 48 transitions, 273 flow. Second operand 9 states and 137 transitions. [2024-11-16 19:16:02,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 101 transitions, 667 flow [2024-11-16 19:16:02,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 101 transitions, 652 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-11-16 19:16:02,704 INFO L231 Difference]: Finished difference. Result has 71 places, 44 transitions, 241 flow [2024-11-16 19:16:02,705 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=241, PETRI_PLACES=71, PETRI_TRANSITIONS=44} [2024-11-16 19:16:02,706 INFO L277 CegarLoopForPetriNet]: 44 programPoint places, 27 predicate places. [2024-11-16 19:16:02,706 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 44 transitions, 241 flow [2024-11-16 19:16:02,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.181818181818182) internal successors, (101), 11 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:16:02,706 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:16:02,707 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:16:02,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 19:16:02,707 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:16:02,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:16:02,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1036873878, now seen corresponding path program 3 times [2024-11-16 19:16:02,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:16:02,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236896431] [2024-11-16 19:16:02,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:16:02,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:16:02,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 19:16:02,754 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 19:16:02,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 19:16:02,830 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 19:16:02,830 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 19:16:02,832 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-11-16 19:16:02,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-11-16 19:16:02,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-11-16 19:16:02,835 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-16 19:16:02,836 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-11-16 19:16:02,836 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-11-16 19:16:02,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-16 19:16:02,836 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-16 19:16:02,926 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-16 19:16:02,926 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 19:16:02,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 07:16:02 BasicIcfg [2024-11-16 19:16:02,931 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 19:16:02,932 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 19:16:02,932 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 19:16:02,932 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 19:16:02,933 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:15:37" (3/4) ... [2024-11-16 19:16:02,933 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-16 19:16:03,022 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 19:16:03,022 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 19:16:03,022 INFO L158 Benchmark]: Toolchain (without parser) took 27164.32ms. Allocated memory was 161.5MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 126.2MB in the beginning and 941.7MB in the end (delta: -815.5MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2024-11-16 19:16:03,023 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 104.9MB. Free memory is still 75.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 19:16:03,023 INFO L158 Benchmark]: CACSL2BoogieTranslator took 593.91ms. Allocated memory is still 161.5MB. Free memory was 126.2MB in the beginning and 100.2MB in the end (delta: 26.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-16 19:16:03,025 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.06ms. Allocated memory is still 161.5MB. Free memory was 100.2MB in the beginning and 97.0MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 19:16:03,026 INFO L158 Benchmark]: Boogie Preprocessor took 78.21ms. Allocated memory is still 161.5MB. Free memory was 97.0MB in the beginning and 93.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 19:16:03,026 INFO L158 Benchmark]: IcfgBuilder took 790.97ms. Allocated memory is still 161.5MB. Free memory was 93.9MB in the beginning and 81.8MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 19:16:03,026 INFO L158 Benchmark]: TraceAbstraction took 25548.42ms. Allocated memory was 161.5MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 81.8MB in the beginning and 953.3MB in the end (delta: -871.4MB). Peak memory consumption was 948.9MB. Max. memory is 16.1GB. [2024-11-16 19:16:03,026 INFO L158 Benchmark]: Witness Printer took 90.15ms. Allocated memory is still 2.0GB. Free memory was 952.2MB in the beginning and 941.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-16 19:16:03,028 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.11ms. Allocated memory is still 104.9MB. Free memory is still 75.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 593.91ms. Allocated memory is still 161.5MB. Free memory was 126.2MB in the beginning and 100.2MB in the end (delta: 26.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.06ms. Allocated memory is still 161.5MB. Free memory was 100.2MB in the beginning and 97.0MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.21ms. Allocated memory is still 161.5MB. Free memory was 97.0MB in the beginning and 93.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 790.97ms. Allocated memory is still 161.5MB. Free memory was 93.9MB in the beginning and 81.8MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 25548.42ms. Allocated memory was 161.5MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 81.8MB in the beginning and 953.3MB in the end (delta: -871.4MB). Peak memory consumption was 948.9MB. Max. memory is 16.1GB. * Witness Printer took 90.15ms. Allocated memory is still 2.0GB. Free memory was 952.2MB in the beginning and 941.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L813] 0 pthread_t t2177; [L814] FCALL, FORK 0 pthread_create(&t2177, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2177=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L815] 0 pthread_t t2178; [L816] FCALL, FORK 0 pthread_create(&t2178, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2177=-2, t2178=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L817] 0 pthread_t t2179; [L818] FCALL, FORK 0 pthread_create(&t2179, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2177=-2, t2178=-1, t2179=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L739] 1 y$w_buff1 = y$w_buff0 [L740] 1 y$w_buff0 = 2 [L741] 1 y$w_buff1_used = y$w_buff0_used [L742] 1 y$w_buff0_used = (_Bool)1 [L743] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L743] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L744] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L745] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L746] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L747] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L751] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L768] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L785] 3 __unbuffered_p2_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L788] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177=-2, t2178=-1, t2179=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177=-2, t2178=-1, t2179=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177=-2, t2178=-1, t2179=0, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L846] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - 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: 816]: 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: 814]: 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: 818]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 62 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 25.3s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 14.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1064 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1062 mSDsluCounter, 18 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18 mSDsCounter, 113 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3449 IncrementalHoareTripleChecker+Invalid, 3562 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 113 mSolverCounterUnsat, 0 mSDtfsCounter, 3449 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 143 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=595occurred in iteration=12, InterpolantAutomatonStates: 118, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 344 NumberOfCodeBlocks, 344 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 300 ConstructedInterpolants, 0 QuantifiedInterpolants, 2775 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-16 19:16:03,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE