./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.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 798582ee4a09ede0f5c496225fe921dfd53b0dfd5ded797f7106b8b9ef24e798 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 09:24:47,482 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 09:24:47,560 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 09:24:47,564 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 09:24:47,565 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 09:24:47,599 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 09:24:47,600 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 09:24:47,602 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 09:24:47,603 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 09:24:47,603 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 09:24:47,604 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 09:24:47,604 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 09:24:47,605 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 09:24:47,606 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 09:24:47,608 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 09:24:47,609 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 09:24:47,609 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 09:24:47,609 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 09:24:47,609 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 09:24:47,610 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 09:24:47,610 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 09:24:47,614 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 09:24:47,614 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 09:24:47,615 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 09:24:47,615 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 09:24:47,615 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 09:24:47,615 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 09:24:47,616 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 09:24:47,616 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 09:24:47,616 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 09:24:47,616 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 09:24:47,617 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 09:24:47,617 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 09:24:47,617 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 09:24:47,617 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 09:24:47,618 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 09:24:47,618 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 09:24:47,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 09:24:47,618 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 09:24:47,618 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 09:24:47,619 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 09:24:47,619 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 09:24:47,620 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 -> 798582ee4a09ede0f5c496225fe921dfd53b0dfd5ded797f7106b8b9ef24e798 [2024-11-20 09:24:47,870 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 09:24:47,898 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 09:24:47,902 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 09:24:47,904 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 09:24:47,905 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 09:24:47,907 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i [2024-11-20 09:24:49,391 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 09:24:49,676 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 09:24:49,676 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i [2024-11-20 09:24:49,700 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bb018b84/7f9a6bc9c9cf4a06a3d5d52b149a8bcd/FLAG33c704520 [2024-11-20 09:24:49,714 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bb018b84/7f9a6bc9c9cf4a06a3d5d52b149a8bcd [2024-11-20 09:24:49,716 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 09:24:49,717 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 09:24:49,718 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 09:24:49,718 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 09:24:49,724 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 09:24:49,725 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:24:49" (1/1) ... [2024-11-20 09:24:49,726 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35a6921d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:24:49, skipping insertion in model container [2024-11-20 09:24:49,726 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:24:49" (1/1) ... [2024-11-20 09:24:49,780 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 09:24:50,014 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/mix051_tso.oepc.i[949,962] [2024-11-20 09:24:50,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 09:24:50,318 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 09:24:50,333 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/mix051_tso.oepc.i[949,962] [2024-11-20 09:24:50,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 09:24:50,439 INFO L204 MainTranslator]: Completed translation [2024-11-20 09:24:50,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:24:50 WrapperNode [2024-11-20 09:24:50,440 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 09:24:50,441 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 09:24:50,442 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 09:24:50,442 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 09:24:50,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:24:50" (1/1) ... [2024-11-20 09:24:50,477 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:24:50" (1/1) ... [2024-11-20 09:24:50,520 INFO L138 Inliner]: procedures = 176, calls = 51, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2024-11-20 09:24:50,524 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 09:24:50,525 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 09:24:50,525 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 09:24:50,526 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 09:24:50,540 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:24:50" (1/1) ... [2024-11-20 09:24:50,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:24:50" (1/1) ... [2024-11-20 09:24:50,547 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:24:50" (1/1) ... [2024-11-20 09:24:50,579 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 09:24:50,580 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:24:50" (1/1) ... [2024-11-20 09:24:50,580 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:24:50" (1/1) ... [2024-11-20 09:24:50,593 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:24:50" (1/1) ... [2024-11-20 09:24:50,600 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:24:50" (1/1) ... [2024-11-20 09:24:50,603 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:24:50" (1/1) ... [2024-11-20 09:24:50,609 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:24:50" (1/1) ... [2024-11-20 09:24:50,612 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 09:24:50,617 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 09:24:50,617 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 09:24:50,617 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 09:24:50,618 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:24:50" (1/1) ... [2024-11-20 09:24:50,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 09:24:50,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 09:24:50,657 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 09:24:50,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 09:24:50,720 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-20 09:24:50,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 09:24:50,723 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-20 09:24:50,723 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-20 09:24:50,723 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-20 09:24:50,723 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-20 09:24:50,723 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-20 09:24:50,725 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-20 09:24:50,725 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-20 09:24:50,725 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-20 09:24:50,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 09:24:50,726 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-20 09:24:50,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 09:24:50,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 09:24:50,728 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-20 09:24:50,884 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 09:24:50,887 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 09:24:51,278 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-20 09:24:51,279 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 09:24:51,529 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 09:24:51,529 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-20 09:24:51,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:24:51 BoogieIcfgContainer [2024-11-20 09:24:51,530 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 09:24:51,533 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 09:24:51,533 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 09:24:51,537 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 09:24:51,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:24:49" (1/3) ... [2024-11-20 09:24:51,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c340ebf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:24:51, skipping insertion in model container [2024-11-20 09:24:51,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:24:50" (2/3) ... [2024-11-20 09:24:51,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c340ebf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:24:51, skipping insertion in model container [2024-11-20 09:24:51,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:24:51" (3/3) ... [2024-11-20 09:24:51,541 INFO L112 eAbstractionObserver]: Analyzing ICFG mix051_tso.oepc.i [2024-11-20 09:24:51,563 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 09:24:51,564 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-20 09:24:51,564 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-20 09:24:51,633 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-20 09:24:51,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 48 transitions, 112 flow [2024-11-20 09:24:51,718 INFO L124 PetriNetUnfolderBase]: 1/44 cut-off events. [2024-11-20 09:24:51,718 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 09:24:51,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 44 events. 1/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 92 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2024-11-20 09:24:51,724 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 48 transitions, 112 flow [2024-11-20 09:24:51,730 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 44 transitions, 100 flow [2024-11-20 09:24:51,743 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 09:24:51,752 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;@3c338271, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 09:24:51,753 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-20 09:24:51,760 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-20 09:24:51,760 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2024-11-20 09:24:51,760 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 09:24:51,760 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:24:51,761 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-20 09:24:51,762 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-20 09:24:51,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:24:51,768 INFO L85 PathProgramCache]: Analyzing trace with hash -996313560, now seen corresponding path program 1 times [2024-11-20 09:24:51,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:24:51,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753183328] [2024-11-20 09:24:51,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:24:51,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:24:51,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:24:52,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:24:52,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:24:52,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753183328] [2024-11-20 09:24:52,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753183328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:24:52,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:24:52,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-20 09:24:52,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540951050] [2024-11-20 09:24:52,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:24:52,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 09:24:52,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:24:52,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 09:24:52,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 09:24:52,518 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 48 [2024-11-20 09:24:52,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 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-20 09:24:52,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:24:52,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 48 [2024-11-20 09:24:52,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:24:53,372 INFO L124 PetriNetUnfolderBase]: 2160/3608 cut-off events. [2024-11-20 09:24:53,372 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2024-11-20 09:24:53,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6737 conditions, 3608 events. 2160/3608 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 24770 event pairs, 384 based on Foata normal form. 108/3632 useless extension candidates. Maximal degree in co-relation 6725. Up to 2416 conditions per place. [2024-11-20 09:24:53,414 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 35 selfloop transitions, 2 changer transitions 2/58 dead transitions. [2024-11-20 09:24:53,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 58 transitions, 212 flow [2024-11-20 09:24:53,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 09:24:53,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 09:24:53,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2024-11-20 09:24:53,430 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7708333333333334 [2024-11-20 09:24:53,432 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 100 flow. Second operand 3 states and 111 transitions. [2024-11-20 09:24:53,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 58 transitions, 212 flow [2024-11-20 09:24:53,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 58 transitions, 206 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-20 09:24:53,442 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 94 flow [2024-11-20 09:24:53,445 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2024-11-20 09:24:53,452 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, -3 predicate places. [2024-11-20 09:24:53,452 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 94 flow [2024-11-20 09:24:53,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 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-20 09:24:53,453 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:24:53,453 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:24:53,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 09:24:53,454 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-20 09:24:53,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:24:53,456 INFO L85 PathProgramCache]: Analyzing trace with hash 998320935, now seen corresponding path program 1 times [2024-11-20 09:24:53,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:24:53,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097022402] [2024-11-20 09:24:53,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:24:53,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:24:53,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:24:54,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:24:54,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:24:54,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097022402] [2024-11-20 09:24:54,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097022402] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:24:54,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:24:54,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 09:24:54,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566466522] [2024-11-20 09:24:54,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:24:54,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 09:24:54,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:24:54,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 09:24:54,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 09:24:54,408 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2024-11-20 09:24:54,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 94 flow. Second operand has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:24:54,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:24:54,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2024-11-20 09:24:54,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:24:55,645 INFO L124 PetriNetUnfolderBase]: 4352/6814 cut-off events. [2024-11-20 09:24:55,645 INFO L125 PetriNetUnfolderBase]: For 392/392 co-relation queries the response was YES. [2024-11-20 09:24:55,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13385 conditions, 6814 events. 4352/6814 cut-off events. For 392/392 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 48899 event pairs, 983 based on Foata normal form. 0/6656 useless extension candidates. Maximal degree in co-relation 13375. Up to 3913 conditions per place. [2024-11-20 09:24:55,687 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 36 selfloop transitions, 3 changer transitions 48/103 dead transitions. [2024-11-20 09:24:55,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 103 transitions, 410 flow [2024-11-20 09:24:55,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 09:24:55,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-20 09:24:55,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 249 transitions. [2024-11-20 09:24:55,690 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6484375 [2024-11-20 09:24:55,690 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 94 flow. Second operand 8 states and 249 transitions. [2024-11-20 09:24:55,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 103 transitions, 410 flow [2024-11-20 09:24:55,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 103 transitions, 394 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 09:24:55,695 INFO L231 Difference]: Finished difference. Result has 62 places, 42 transitions, 123 flow [2024-11-20 09:24:55,696 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=123, PETRI_PLACES=62, PETRI_TRANSITIONS=42} [2024-11-20 09:24:55,697 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 6 predicate places. [2024-11-20 09:24:55,697 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 42 transitions, 123 flow [2024-11-20 09:24:55,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:24:55,698 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:24:55,698 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-20 09:24:55,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 09:24:55,699 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-20 09:24:55,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:24:55,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1641187607, now seen corresponding path program 1 times [2024-11-20 09:24:55,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:24:55,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933907756] [2024-11-20 09:24:55,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:24:55,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:24:55,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:24:56,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:24:56,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:24:56,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933907756] [2024-11-20 09:24:56,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933907756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:24:56,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:24:56,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 09:24:56,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965406517] [2024-11-20 09:24:56,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:24:56,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 09:24:56,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:24:56,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 09:24:56,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-20 09:24:56,590 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2024-11-20 09:24:56,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 42 transitions, 123 flow. Second operand has 7 states, 7 states have (on average 22.142857142857142) internal successors, (155), 7 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:24:56,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:24:56,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2024-11-20 09:24:56,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:24:57,814 INFO L124 PetriNetUnfolderBase]: 3518/5553 cut-off events. [2024-11-20 09:24:57,815 INFO L125 PetriNetUnfolderBase]: For 3599/3599 co-relation queries the response was YES. [2024-11-20 09:24:57,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13283 conditions, 5553 events. 3518/5553 cut-off events. For 3599/3599 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 36336 event pairs, 2058 based on Foata normal form. 116/5646 useless extension candidates. Maximal degree in co-relation 13268. Up to 3935 conditions per place. [2024-11-20 09:24:57,863 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 45 selfloop transitions, 7 changer transitions 33/101 dead transitions. [2024-11-20 09:24:57,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 101 transitions, 461 flow [2024-11-20 09:24:57,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 09:24:57,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-20 09:24:57,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 247 transitions. [2024-11-20 09:24:57,868 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6432291666666666 [2024-11-20 09:24:57,870 INFO L175 Difference]: Start difference. First operand has 62 places, 42 transitions, 123 flow. Second operand 8 states and 247 transitions. [2024-11-20 09:24:57,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 101 transitions, 461 flow [2024-11-20 09:24:57,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 101 transitions, 450 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-11-20 09:24:57,891 INFO L231 Difference]: Finished difference. Result has 65 places, 46 transitions, 183 flow [2024-11-20 09:24:57,891 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=183, PETRI_PLACES=65, PETRI_TRANSITIONS=46} [2024-11-20 09:24:57,892 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 9 predicate places. [2024-11-20 09:24:57,892 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 46 transitions, 183 flow [2024-11-20 09:24:57,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.142857142857142) internal successors, (155), 7 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:24:57,893 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:24:57,893 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:24:57,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 09:24:57,894 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-20 09:24:57,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:24:57,895 INFO L85 PathProgramCache]: Analyzing trace with hash -538760536, now seen corresponding path program 1 times [2024-11-20 09:24:57,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:24:57,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933539336] [2024-11-20 09:24:57,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:24:57,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:24:57,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:24:58,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:24:58,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:24:58,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933539336] [2024-11-20 09:24:58,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933539336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:24:58,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:24:58,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 09:24:58,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227173569] [2024-11-20 09:24:58,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:24:58,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 09:24:58,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:24:58,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 09:24:58,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 09:24:58,298 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2024-11-20 09:24:58,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 46 transitions, 183 flow. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:24:58,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:24:58,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2024-11-20 09:24:58,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:24:59,353 INFO L124 PetriNetUnfolderBase]: 3583/5761 cut-off events. [2024-11-20 09:24:59,353 INFO L125 PetriNetUnfolderBase]: For 12107/12157 co-relation queries the response was YES. [2024-11-20 09:24:59,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18462 conditions, 5761 events. 3583/5761 cut-off events. For 12107/12157 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 39984 event pairs, 483 based on Foata normal form. 120/5817 useless extension candidates. Maximal degree in co-relation 18443. Up to 3429 conditions per place. [2024-11-20 09:24:59,409 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 52 selfloop transitions, 9 changer transitions 33/110 dead transitions. [2024-11-20 09:24:59,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 110 transitions, 643 flow [2024-11-20 09:24:59,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 09:24:59,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-20 09:24:59,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 251 transitions. [2024-11-20 09:24:59,411 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6536458333333334 [2024-11-20 09:24:59,411 INFO L175 Difference]: Start difference. First operand has 65 places, 46 transitions, 183 flow. Second operand 8 states and 251 transitions. [2024-11-20 09:24:59,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 110 transitions, 643 flow [2024-11-20 09:24:59,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 110 transitions, 616 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-11-20 09:24:59,451 INFO L231 Difference]: Finished difference. Result has 69 places, 51 transitions, 234 flow [2024-11-20 09:24:59,451 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=234, PETRI_PLACES=69, PETRI_TRANSITIONS=51} [2024-11-20 09:24:59,452 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 13 predicate places. [2024-11-20 09:24:59,452 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 51 transitions, 234 flow [2024-11-20 09:24:59,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:24:59,453 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:24:59,453 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:24:59,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 09:24:59,453 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-20 09:24:59,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:24:59,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1212021600, now seen corresponding path program 2 times [2024-11-20 09:24:59,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:24:59,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242490421] [2024-11-20 09:24:59,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:24:59,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:24:59,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:24:59,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:24:59,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:24:59,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242490421] [2024-11-20 09:24:59,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242490421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:24:59,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:24:59,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 09:24:59,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506222989] [2024-11-20 09:24:59,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:24:59,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 09:24:59,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:24:59,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 09:24:59,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-20 09:24:59,990 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2024-11-20 09:24:59,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 51 transitions, 234 flow. Second operand has 7 states, 7 states have (on average 22.142857142857142) internal successors, (155), 7 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:24:59,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:24:59,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2024-11-20 09:24:59,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:25:01,219 INFO L124 PetriNetUnfolderBase]: 3358/5311 cut-off events. [2024-11-20 09:25:01,220 INFO L125 PetriNetUnfolderBase]: For 15295/15370 co-relation queries the response was YES. [2024-11-20 09:25:01,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19032 conditions, 5311 events. 3358/5311 cut-off events. For 15295/15370 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 35975 event pairs, 467 based on Foata normal form. 132/5379 useless extension candidates. Maximal degree in co-relation 19010. Up to 3348 conditions per place. [2024-11-20 09:25:01,268 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 49 selfloop transitions, 9 changer transitions 33/107 dead transitions. [2024-11-20 09:25:01,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 107 transitions, 680 flow [2024-11-20 09:25:01,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 09:25:01,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-20 09:25:01,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 248 transitions. [2024-11-20 09:25:01,270 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6458333333333334 [2024-11-20 09:25:01,271 INFO L175 Difference]: Start difference. First operand has 69 places, 51 transitions, 234 flow. Second operand 8 states and 248 transitions. [2024-11-20 09:25:01,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 107 transitions, 680 flow [2024-11-20 09:25:01,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 107 transitions, 634 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-11-20 09:25:01,310 INFO L231 Difference]: Finished difference. Result has 72 places, 51 transitions, 238 flow [2024-11-20 09:25:01,311 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=238, PETRI_PLACES=72, PETRI_TRANSITIONS=51} [2024-11-20 09:25:01,313 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 16 predicate places. [2024-11-20 09:25:01,313 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 51 transitions, 238 flow [2024-11-20 09:25:01,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.142857142857142) internal successors, (155), 7 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:25:01,313 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:25:01,313 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-20 09:25:01,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 09:25:01,313 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-20 09:25:01,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:25:01,314 INFO L85 PathProgramCache]: Analyzing trace with hash 204509962, now seen corresponding path program 1 times [2024-11-20 09:25:01,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:25:01,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883660170] [2024-11-20 09:25:01,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:25:01,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:25:01,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:25:01,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:25:01,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:25:01,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883660170] [2024-11-20 09:25:01,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883660170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:25:01,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:25:01,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 09:25:01,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915864191] [2024-11-20 09:25:01,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:25:01,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 09:25:01,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:25:01,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 09:25:01,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 09:25:01,514 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2024-11-20 09:25:01,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 51 transitions, 238 flow. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:25:01,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:25:01,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2024-11-20 09:25:01,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:25:02,816 INFO L124 PetriNetUnfolderBase]: 8735/12654 cut-off events. [2024-11-20 09:25:02,817 INFO L125 PetriNetUnfolderBase]: For 29366/29485 co-relation queries the response was YES. [2024-11-20 09:25:02,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41283 conditions, 12654 events. 8735/12654 cut-off events. For 29366/29485 co-relation queries the response was YES. Maximal size of possible extension queue 706. Compared 81808 event pairs, 985 based on Foata normal form. 532/12912 useless extension candidates. Maximal degree in co-relation 41259. Up to 6837 conditions per place. [2024-11-20 09:25:02,912 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 76 selfloop transitions, 6 changer transitions 0/97 dead transitions. [2024-11-20 09:25:02,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 97 transitions, 636 flow [2024-11-20 09:25:02,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 09:25:02,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-20 09:25:02,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2024-11-20 09:25:02,914 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6822916666666666 [2024-11-20 09:25:02,914 INFO L175 Difference]: Start difference. First operand has 72 places, 51 transitions, 238 flow. Second operand 4 states and 131 transitions. [2024-11-20 09:25:02,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 97 transitions, 636 flow [2024-11-20 09:25:02,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 97 transitions, 576 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-11-20 09:25:02,940 INFO L231 Difference]: Finished difference. Result has 65 places, 56 transitions, 252 flow [2024-11-20 09:25:02,940 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=252, PETRI_PLACES=65, PETRI_TRANSITIONS=56} [2024-11-20 09:25:02,941 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 9 predicate places. [2024-11-20 09:25:02,942 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 56 transitions, 252 flow [2024-11-20 09:25:02,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:25:02,942 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:25:02,943 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:25:02,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 09:25:02,943 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-20 09:25:02,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:25:02,944 INFO L85 PathProgramCache]: Analyzing trace with hash -218313075, now seen corresponding path program 1 times [2024-11-20 09:25:02,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:25:02,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769236316] [2024-11-20 09:25:02,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:25:02,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:25:02,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:25:03,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:25:03,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:25:03,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769236316] [2024-11-20 09:25:03,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769236316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:25:03,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:25:03,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 09:25:03,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185558445] [2024-11-20 09:25:03,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:25:03,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 09:25:03,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:25:03,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 09:25:03,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 09:25:03,144 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2024-11-20 09:25:03,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 56 transitions, 252 flow. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:25:03,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:25:03,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2024-11-20 09:25:03,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:25:04,599 INFO L124 PetriNetUnfolderBase]: 7543/11094 cut-off events. [2024-11-20 09:25:04,600 INFO L125 PetriNetUnfolderBase]: For 21266/21377 co-relation queries the response was YES. [2024-11-20 09:25:04,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36605 conditions, 11094 events. 7543/11094 cut-off events. For 21266/21377 co-relation queries the response was YES. Maximal size of possible extension queue 595. Compared 70748 event pairs, 545 based on Foata normal form. 486/11299 useless extension candidates. Maximal degree in co-relation 36584. Up to 4321 conditions per place. [2024-11-20 09:25:04,700 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 91 selfloop transitions, 10 changer transitions 0/116 dead transitions. [2024-11-20 09:25:04,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 116 transitions, 741 flow [2024-11-20 09:25:04,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 09:25:04,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-20 09:25:04,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 168 transitions. [2024-11-20 09:25:04,702 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7 [2024-11-20 09:25:04,702 INFO L175 Difference]: Start difference. First operand has 65 places, 56 transitions, 252 flow. Second operand 5 states and 168 transitions. [2024-11-20 09:25:04,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 116 transitions, 741 flow [2024-11-20 09:25:04,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 116 transitions, 734 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-20 09:25:04,716 INFO L231 Difference]: Finished difference. Result has 69 places, 61 transitions, 313 flow [2024-11-20 09:25:04,716 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=313, PETRI_PLACES=69, PETRI_TRANSITIONS=61} [2024-11-20 09:25:04,717 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 13 predicate places. [2024-11-20 09:25:04,717 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 61 transitions, 313 flow [2024-11-20 09:25:04,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:25:04,718 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:25:04,718 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:25:04,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 09:25:04,719 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-20 09:25:04,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:25:04,719 INFO L85 PathProgramCache]: Analyzing trace with hash -160055579, now seen corresponding path program 1 times [2024-11-20 09:25:04,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:25:04,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676804257] [2024-11-20 09:25:04,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:25:04,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:25:04,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:25:05,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:25:05,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:25:05,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676804257] [2024-11-20 09:25:05,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676804257] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:25:05,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:25:05,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 09:25:05,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285806328] [2024-11-20 09:25:05,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:25:05,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 09:25:05,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:25:05,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 09:25:05,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-20 09:25:05,074 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2024-11-20 09:25:05,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 61 transitions, 313 flow. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:25:05,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:25:05,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2024-11-20 09:25:05,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:25:05,994 INFO L124 PetriNetUnfolderBase]: 5975/8834 cut-off events. [2024-11-20 09:25:05,994 INFO L125 PetriNetUnfolderBase]: For 22482/22585 co-relation queries the response was YES. [2024-11-20 09:25:06,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31428 conditions, 8834 events. 5975/8834 cut-off events. For 22482/22585 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 53864 event pairs, 397 based on Foata normal form. 350/8904 useless extension candidates. Maximal degree in co-relation 31405. Up to 2720 conditions per place. [2024-11-20 09:25:06,053 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 99 selfloop transitions, 14 changer transitions 0/128 dead transitions. [2024-11-20 09:25:06,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 128 transitions, 870 flow [2024-11-20 09:25:06,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 09:25:06,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 09:25:06,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 203 transitions. [2024-11-20 09:25:06,055 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7048611111111112 [2024-11-20 09:25:06,055 INFO L175 Difference]: Start difference. First operand has 69 places, 61 transitions, 313 flow. Second operand 6 states and 203 transitions. [2024-11-20 09:25:06,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 128 transitions, 870 flow [2024-11-20 09:25:06,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 128 transitions, 854 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-11-20 09:25:06,068 INFO L231 Difference]: Finished difference. Result has 74 places, 65 transitions, 377 flow [2024-11-20 09:25:06,068 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=377, PETRI_PLACES=74, PETRI_TRANSITIONS=65} [2024-11-20 09:25:06,073 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 18 predicate places. [2024-11-20 09:25:06,073 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 65 transitions, 377 flow [2024-11-20 09:25:06,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:25:06,074 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:25:06,074 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:25:06,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 09:25:06,075 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-20 09:25:06,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:25:06,076 INFO L85 PathProgramCache]: Analyzing trace with hash 798117322, now seen corresponding path program 1 times [2024-11-20 09:25:06,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:25:06,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139760427] [2024-11-20 09:25:06,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:25:06,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:25:06,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:25:06,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:25:06,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:25:06,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139760427] [2024-11-20 09:25:06,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139760427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:25:06,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:25:06,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 09:25:06,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842028206] [2024-11-20 09:25:06,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:25:06,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 09:25:06,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:25:06,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 09:25:06,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 09:25:06,385 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2024-11-20 09:25:06,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 65 transitions, 377 flow. Second operand has 7 states, 7 states have (on average 21.0) internal successors, (147), 7 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:25:06,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:25:06,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2024-11-20 09:25:06,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:25:07,286 INFO L124 PetriNetUnfolderBase]: 5215/7642 cut-off events. [2024-11-20 09:25:07,286 INFO L125 PetriNetUnfolderBase]: For 26478/26581 co-relation queries the response was YES. [2024-11-20 09:25:07,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29344 conditions, 7642 events. 5215/7642 cut-off events. For 26478/26581 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 45786 event pairs, 397 based on Foata normal form. 198/7560 useless extension candidates. Maximal degree in co-relation 29319. Up to 2720 conditions per place. [2024-11-20 09:25:07,341 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 92 selfloop transitions, 18 changer transitions 0/125 dead transitions. [2024-11-20 09:25:07,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 125 transitions, 860 flow [2024-11-20 09:25:07,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 09:25:07,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-20 09:25:07,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 218 transitions. [2024-11-20 09:25:07,343 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6488095238095238 [2024-11-20 09:25:07,343 INFO L175 Difference]: Start difference. First operand has 74 places, 65 transitions, 377 flow. Second operand 7 states and 218 transitions. [2024-11-20 09:25:07,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 125 transitions, 860 flow [2024-11-20 09:25:07,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 125 transitions, 798 flow, removed 15 selfloop flow, removed 4 redundant places. [2024-11-20 09:25:07,402 INFO L231 Difference]: Finished difference. Result has 78 places, 66 transitions, 388 flow [2024-11-20 09:25:07,403 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=388, PETRI_PLACES=78, PETRI_TRANSITIONS=66} [2024-11-20 09:25:07,403 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 22 predicate places. [2024-11-20 09:25:07,404 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 66 transitions, 388 flow [2024-11-20 09:25:07,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.0) internal successors, (147), 7 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:25:07,404 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:25:07,404 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:25:07,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 09:25:07,405 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-20 09:25:07,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:25:07,405 INFO L85 PathProgramCache]: Analyzing trace with hash 40785539, now seen corresponding path program 1 times [2024-11-20 09:25:07,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:25:07,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693572271] [2024-11-20 09:25:07,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:25:07,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:25:07,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:25:07,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:25:07,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:25:07,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693572271] [2024-11-20 09:25:07,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693572271] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:25:07,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:25:07,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 09:25:07,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549630792] [2024-11-20 09:25:07,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:25:07,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 09:25:07,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:25:07,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 09:25:07,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 09:25:07,981 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 48 [2024-11-20 09:25:07,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 66 transitions, 388 flow. Second operand has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 7 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:25:07,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:25:07,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 48 [2024-11-20 09:25:07,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:25:09,375 INFO L124 PetriNetUnfolderBase]: 8677/14006 cut-off events. [2024-11-20 09:25:09,376 INFO L125 PetriNetUnfolderBase]: For 35303/38683 co-relation queries the response was YES. [2024-11-20 09:25:09,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44422 conditions, 14006 events. 8677/14006 cut-off events. For 35303/38683 co-relation queries the response was YES. Maximal size of possible extension queue 951. Compared 104551 event pairs, 1901 based on Foata normal form. 295/13053 useless extension candidates. Maximal degree in co-relation 44396. Up to 5691 conditions per place. [2024-11-20 09:25:09,451 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 51 selfloop transitions, 5 changer transitions 52/139 dead transitions. [2024-11-20 09:25:09,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 139 transitions, 879 flow [2024-11-20 09:25:09,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 09:25:09,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-20 09:25:09,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 225 transitions. [2024-11-20 09:25:09,453 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5859375 [2024-11-20 09:25:09,453 INFO L175 Difference]: Start difference. First operand has 78 places, 66 transitions, 388 flow. Second operand 8 states and 225 transitions. [2024-11-20 09:25:09,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 139 transitions, 879 flow [2024-11-20 09:25:09,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 139 transitions, 792 flow, removed 32 selfloop flow, removed 6 redundant places. [2024-11-20 09:25:09,661 INFO L231 Difference]: Finished difference. Result has 85 places, 69 transitions, 375 flow [2024-11-20 09:25:09,661 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=375, PETRI_PLACES=85, PETRI_TRANSITIONS=69} [2024-11-20 09:25:09,662 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 29 predicate places. [2024-11-20 09:25:09,662 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 69 transitions, 375 flow [2024-11-20 09:25:09,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 7 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:25:09,663 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:25:09,663 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:25:09,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 09:25:09,663 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-20 09:25:09,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:25:09,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1711464353, now seen corresponding path program 2 times [2024-11-20 09:25:09,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:25:09,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876702659] [2024-11-20 09:25:09,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:25:09,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:25:09,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:25:10,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-20 09:25:10,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:25:10,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876702659] [2024-11-20 09:25:10,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876702659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:25:10,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:25:10,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 09:25:10,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370843559] [2024-11-20 09:25:10,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:25:10,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 09:25:10,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:25:10,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 09:25:10,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 09:25:10,182 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 48 [2024-11-20 09:25:10,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 69 transitions, 375 flow. Second operand has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 7 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:25:10,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:25:10,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 48 [2024-11-20 09:25:10,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:25:11,764 INFO L124 PetriNetUnfolderBase]: 7442/12154 cut-off events. [2024-11-20 09:25:11,764 INFO L125 PetriNetUnfolderBase]: For 18002/19922 co-relation queries the response was YES. [2024-11-20 09:25:11,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35378 conditions, 12154 events. 7442/12154 cut-off events. For 18002/19922 co-relation queries the response was YES. Maximal size of possible extension queue 802. Compared 92258 event pairs, 949 based on Foata normal form. 220/11012 useless extension candidates. Maximal degree in co-relation 35348. Up to 4955 conditions per place. [2024-11-20 09:25:11,854 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 74 selfloop transitions, 9 changer transitions 12/126 dead transitions. [2024-11-20 09:25:11,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 126 transitions, 790 flow [2024-11-20 09:25:11,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 09:25:11,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-20 09:25:11,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 215 transitions. [2024-11-20 09:25:11,856 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5598958333333334 [2024-11-20 09:25:11,857 INFO L175 Difference]: Start difference. First operand has 85 places, 69 transitions, 375 flow. Second operand 8 states and 215 transitions. [2024-11-20 09:25:11,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 126 transitions, 790 flow [2024-11-20 09:25:12,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 126 transitions, 780 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-11-20 09:25:12,040 INFO L231 Difference]: Finished difference. Result has 89 places, 73 transitions, 420 flow [2024-11-20 09:25:12,041 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=369, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=420, PETRI_PLACES=89, PETRI_TRANSITIONS=73} [2024-11-20 09:25:12,041 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 33 predicate places. [2024-11-20 09:25:12,041 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 73 transitions, 420 flow [2024-11-20 09:25:12,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 7 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:25:12,042 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:25:12,042 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:25:12,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 09:25:12,042 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-20 09:25:12,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:25:12,043 INFO L85 PathProgramCache]: Analyzing trace with hash -997496171, now seen corresponding path program 3 times [2024-11-20 09:25:12,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:25:12,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213872666] [2024-11-20 09:25:12,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:25:12,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:25:12,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:25:12,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:25:12,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:25:12,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213872666] [2024-11-20 09:25:12,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213872666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:25:12,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:25:12,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 09:25:12,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031541826] [2024-11-20 09:25:12,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:25:12,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 09:25:12,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:25:12,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 09:25:12,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 09:25:12,655 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 48 [2024-11-20 09:25:12,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 73 transitions, 420 flow. Second operand has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 7 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:25:12,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:25:12,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 48 [2024-11-20 09:25:12,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:25:14,778 INFO L124 PetriNetUnfolderBase]: 12337/20758 cut-off events. [2024-11-20 09:25:14,778 INFO L125 PetriNetUnfolderBase]: For 33624/36628 co-relation queries the response was YES. [2024-11-20 09:25:14,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62000 conditions, 20758 events. 12337/20758 cut-off events. For 33624/36628 co-relation queries the response was YES. Maximal size of possible extension queue 1533. Compared 177355 event pairs, 1927 based on Foata normal form. 367/18827 useless extension candidates. Maximal degree in co-relation 61967. Up to 7429 conditions per place. [2024-11-20 09:25:14,940 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 40 selfloop transitions, 4 changer transitions 57/132 dead transitions. [2024-11-20 09:25:14,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 132 transitions, 890 flow [2024-11-20 09:25:14,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 09:25:14,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-20 09:25:14,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 210 transitions. [2024-11-20 09:25:14,942 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.546875 [2024-11-20 09:25:14,942 INFO L175 Difference]: Start difference. First operand has 89 places, 73 transitions, 420 flow. Second operand 8 states and 210 transitions. [2024-11-20 09:25:14,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 132 transitions, 890 flow [2024-11-20 09:25:15,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 132 transitions, 875 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-11-20 09:25:15,559 INFO L231 Difference]: Finished difference. Result has 95 places, 62 transitions, 355 flow [2024-11-20 09:25:15,560 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=355, PETRI_PLACES=95, PETRI_TRANSITIONS=62} [2024-11-20 09:25:15,560 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 39 predicate places. [2024-11-20 09:25:15,560 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 62 transitions, 355 flow [2024-11-20 09:25:15,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 7 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:25:15,560 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:25:15,561 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:25:15,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 09:25:15,561 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-20 09:25:15,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:25:15,561 INFO L85 PathProgramCache]: Analyzing trace with hash -95273471, now seen corresponding path program 4 times [2024-11-20 09:25:15,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:25:15,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324620336] [2024-11-20 09:25:15,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:25:15,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:25:15,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:25:18,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:25:18,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:25:18,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324620336] [2024-11-20 09:25:18,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324620336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:25:18,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:25:18,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 09:25:18,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119273367] [2024-11-20 09:25:18,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:25:18,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 09:25:18,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:25:18,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 09:25:18,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-20 09:25:18,140 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2024-11-20 09:25:18,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 62 transitions, 355 flow. Second operand has 12 states, 12 states have (on average 21.666666666666668) internal successors, (260), 12 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:25:18,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:25:18,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2024-11-20 09:25:18,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:25:19,216 INFO L124 PetriNetUnfolderBase]: 4118/7394 cut-off events. [2024-11-20 09:25:19,217 INFO L125 PetriNetUnfolderBase]: For 10631/11931 co-relation queries the response was YES. [2024-11-20 09:25:19,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21779 conditions, 7394 events. 4118/7394 cut-off events. For 10631/11931 co-relation queries the response was YES. Maximal size of possible extension queue 565. Compared 56511 event pairs, 1266 based on Foata normal form. 106/6679 useless extension candidates. Maximal degree in co-relation 21743. Up to 2474 conditions per place. [2024-11-20 09:25:19,265 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 49 selfloop transitions, 7 changer transitions 14/103 dead transitions. [2024-11-20 09:25:19,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 103 transitions, 635 flow [2024-11-20 09:25:19,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 09:25:19,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-20 09:25:19,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 226 transitions. [2024-11-20 09:25:19,266 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5885416666666666 [2024-11-20 09:25:19,266 INFO L175 Difference]: Start difference. First operand has 95 places, 62 transitions, 355 flow. Second operand 8 states and 226 transitions. [2024-11-20 09:25:19,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 103 transitions, 635 flow [2024-11-20 09:25:19,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 103 transitions, 599 flow, removed 12 selfloop flow, removed 9 redundant places. [2024-11-20 09:25:19,377 INFO L231 Difference]: Finished difference. Result has 91 places, 64 transitions, 367 flow [2024-11-20 09:25:19,377 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=367, PETRI_PLACES=91, PETRI_TRANSITIONS=64} [2024-11-20 09:25:19,378 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 35 predicate places. [2024-11-20 09:25:19,378 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 64 transitions, 367 flow [2024-11-20 09:25:19,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 21.666666666666668) internal successors, (260), 12 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:25:19,379 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:25:19,379 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:25:19,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 09:25:19,380 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-20 09:25:19,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:25:19,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1612501361, now seen corresponding path program 5 times [2024-11-20 09:25:19,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:25:19,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291109501] [2024-11-20 09:25:19,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:25:19,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:25:19,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:25:22,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 09:25:22,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:25:22,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291109501] [2024-11-20 09:25:22,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291109501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:25:22,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:25:22,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 09:25:22,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224117024] [2024-11-20 09:25:22,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:25:22,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 09:25:22,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:25:22,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 09:25:22,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-20 09:25:22,147 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2024-11-20 09:25:22,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 64 transitions, 367 flow. Second operand has 12 states, 12 states have (on average 21.666666666666668) internal successors, (260), 12 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:25:22,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 09:25:22,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2024-11-20 09:25:22,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 09:25:23,638 INFO L124 PetriNetUnfolderBase]: 6536/11834 cut-off events. [2024-11-20 09:25:23,638 INFO L125 PetriNetUnfolderBase]: For 19257/20937 co-relation queries the response was YES. [2024-11-20 09:25:23,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35443 conditions, 11834 events. 6536/11834 cut-off events. For 19257/20937 co-relation queries the response was YES. Maximal size of possible extension queue 935. Compared 99241 event pairs, 1562 based on Foata normal form. 161/10802 useless extension candidates. Maximal degree in co-relation 35410. Up to 2819 conditions per place. [2024-11-20 09:25:23,711 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 36 selfloop transitions, 4 changer transitions 49/122 dead transitions. [2024-11-20 09:25:23,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 122 transitions, 741 flow [2024-11-20 09:25:23,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 09:25:23,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-20 09:25:23,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 306 transitions. [2024-11-20 09:25:23,714 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5795454545454546 [2024-11-20 09:25:23,714 INFO L175 Difference]: Start difference. First operand has 91 places, 64 transitions, 367 flow. Second operand 11 states and 306 transitions. [2024-11-20 09:25:23,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 122 transitions, 741 flow [2024-11-20 09:25:23,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 122 transitions, 725 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-11-20 09:25:23,979 INFO L231 Difference]: Finished difference. Result has 100 places, 61 transitions, 353 flow [2024-11-20 09:25:23,979 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=353, PETRI_PLACES=100, PETRI_TRANSITIONS=61} [2024-11-20 09:25:23,979 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, 44 predicate places. [2024-11-20 09:25:23,980 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 61 transitions, 353 flow [2024-11-20 09:25:23,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 21.666666666666668) internal successors, (260), 12 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 09:25:23,980 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 09:25:23,980 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:25:23,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 09:25:23,980 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-20 09:25:23,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:25:23,981 INFO L85 PathProgramCache]: Analyzing trace with hash 21058523, now seen corresponding path program 6 times [2024-11-20 09:25:23,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:25:23,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191747557] [2024-11-20 09:25:23,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:25:23,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:25:24,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 09:25:24,043 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 09:25:24,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 09:25:24,154 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 09:25:24,154 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 09:25:24,155 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-11-20 09:25:24,157 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-11-20 09:25:24,159 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-11-20 09:25:24,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-20 09:25:24,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-20 09:25:24,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-20 09:25:24,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-11-20 09:25:24,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-20 09:25:24,161 INFO L407 BasicCegarLoop]: Path program histogram: [6, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:25:24,269 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-20 09:25:24,270 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 09:25:24,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 09:25:24 BasicIcfg [2024-11-20 09:25:24,274 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 09:25:24,275 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 09:25:24,275 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 09:25:24,275 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 09:25:24,275 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:24:51" (3/4) ... [2024-11-20 09:25:24,276 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-20 09:25:24,373 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-20 09:25:24,373 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 09:25:24,374 INFO L158 Benchmark]: Toolchain (without parser) took 34656.75ms. Allocated memory was 176.2MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 102.1MB in the beginning and 942.0MB in the end (delta: -839.8MB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2024-11-20 09:25:24,374 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 176.2MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 09:25:24,374 INFO L158 Benchmark]: CACSL2BoogieTranslator took 721.89ms. Allocated memory was 176.2MB in the beginning and 234.9MB in the end (delta: 58.7MB). Free memory was 102.0MB in the beginning and 193.6MB in the end (delta: -91.7MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. [2024-11-20 09:25:24,375 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.73ms. Allocated memory is still 234.9MB. Free memory was 193.6MB in the beginning and 190.5MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 09:25:24,375 INFO L158 Benchmark]: Boogie Preprocessor took 90.82ms. Allocated memory is still 234.9MB. Free memory was 190.5MB in the beginning and 187.1MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 09:25:24,375 INFO L158 Benchmark]: RCFGBuilder took 913.43ms. Allocated memory is still 234.9MB. Free memory was 187.1MB in the beginning and 128.6MB in the end (delta: 58.5MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. [2024-11-20 09:25:24,376 INFO L158 Benchmark]: TraceAbstraction took 32741.46ms. Allocated memory was 234.9MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 128.6MB in the beginning and 959.8MB in the end (delta: -831.2MB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2024-11-20 09:25:24,376 INFO L158 Benchmark]: Witness Printer took 98.74ms. Allocated memory is still 2.6GB. Free memory was 959.8MB in the beginning and 942.0MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-20 09:25:24,377 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.20ms. Allocated memory is still 176.2MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 721.89ms. Allocated memory was 176.2MB in the beginning and 234.9MB in the end (delta: 58.7MB). Free memory was 102.0MB in the beginning and 193.6MB in the end (delta: -91.7MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.73ms. Allocated memory is still 234.9MB. Free memory was 193.6MB in the beginning and 190.5MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 90.82ms. Allocated memory is still 234.9MB. Free memory was 190.5MB in the beginning and 187.1MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 913.43ms. Allocated memory is still 234.9MB. Free memory was 187.1MB in the beginning and 128.6MB in the end (delta: 58.5MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. * TraceAbstraction took 32741.46ms. Allocated memory was 234.9MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 128.6MB in the beginning and 959.8MB in the end (delta: -831.2MB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 98.74ms. Allocated memory is still 2.6GB. Free memory was 959.8MB in the beginning and 942.0MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L723] 0 _Bool x$flush_delayed; [L724] 0 int x$mem_tmp; [L725] 0 _Bool x$r_buff0_thd0; [L726] 0 _Bool x$r_buff0_thd1; [L727] 0 _Bool x$r_buff0_thd2; [L728] 0 _Bool x$r_buff0_thd3; [L729] 0 _Bool x$r_buff0_thd4; [L730] 0 _Bool x$r_buff1_thd0; [L731] 0 _Bool x$r_buff1_thd1; [L732] 0 _Bool x$r_buff1_thd2; [L733] 0 _Bool x$r_buff1_thd3; [L734] 0 _Bool x$r_buff1_thd4; [L735] 0 _Bool x$read_delayed; [L736] 0 int *x$read_delayed_var; [L737] 0 int x$w_buff0; [L738] 0 _Bool x$w_buff0_used; [L739] 0 int x$w_buff1; [L740] 0 _Bool x$w_buff1_used; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L848] 0 pthread_t t1377; [L849] FCALL, FORK 0 pthread_create(&t1377, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1377=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L850] 0 pthread_t t1378; [L851] FCALL, FORK 0 pthread_create(&t1378, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1377=-2, t1378=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L852] 0 pthread_t t1379; [L853] FCALL, FORK 0 pthread_create(&t1379, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1377=-2, t1378=-1, t1379=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L854] 0 pthread_t t1380; [L855] FCALL, FORK 0 pthread_create(&t1380, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1377=-2, t1378=-1, t1379=0, t1380=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L770] 2 x$w_buff1 = x$w_buff0 [L771] 2 x$w_buff0 = 2 [L772] 2 x$w_buff1_used = x$w_buff0_used [L773] 2 x$w_buff0_used = (_Bool)1 [L774] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L774] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L775] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L776] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L777] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L778] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L779] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L800] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L820] 4 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L823] 4 __unbuffered_p3_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L750] 1 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L753] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L756] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L757] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L758] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L759] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L760] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L806] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L807] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L808] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L809] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L810] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L786] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L789] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L826] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L827] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L828] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L829] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L830] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L833] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1377=-2, t1378=-1, t1379=0, t1380=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L862] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L863] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L864] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L865] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1377=-2, t1378=-1, t1379=0, t1380=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L868] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L869] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L870] 0 x$flush_delayed = weak$$choice2 [L871] 0 x$mem_tmp = x [L872] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L873] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L874] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L875] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L876] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L878] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L880] 0 x = x$flush_delayed ? x$mem_tmp : x [L881] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1377=-2, t1378=-1, t1379=0, t1380=1, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L883] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 853]: 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: 851]: 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: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 81 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 32.5s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 20.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1036 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 993 mSDsluCounter, 420 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 382 mSDsCounter, 139 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2714 IncrementalHoareTripleChecker+Invalid, 2853 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 139 mSolverCounterUnsat, 38 mSDtfsCounter, 2714 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 136 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=420occurred in iteration=11, InterpolantAutomatonStates: 100, 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.7s SatisfiabilityAnalysisTime, 10.5s InterpolantComputationTime, 392 NumberOfCodeBlocks, 392 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 342 ConstructedInterpolants, 0 QuantifiedInterpolants, 3754 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-20 09:25:24,402 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