./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel-misc-4.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f 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 ../sv-benchmarks/c/weaver/parallel-misc-4.wvr.c -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 287b872f435ea31dbbf77f267944e24b96122b5f745db0674c91555289f3b84c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 13:47:19,241 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 13:47:19,304 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 13:47:19,308 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 13:47:19,308 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 13:47:19,331 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 13:47:19,332 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 13:47:19,332 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 13:47:19,333 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 13:47:19,334 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 13:47:19,334 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 13:47:19,334 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 13:47:19,334 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 13:47:19,335 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 13:47:19,336 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 13:47:19,336 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 13:47:19,337 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 13:47:19,337 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 13:47:19,337 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 13:47:19,337 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 13:47:19,340 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 13:47:19,340 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 13:47:19,340 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 13:47:19,341 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 13:47:19,341 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 13:47:19,341 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 13:47:19,341 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 13:47:19,341 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 13:47:19,341 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 13:47:19,341 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 13:47:19,341 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 13:47:19,342 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 13:47:19,342 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 13:47:19,342 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 13:47:19,342 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 13:47:19,342 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 13:47:19,342 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 13:47:19,342 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 13:47:19,342 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 13:47:19,343 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 13:47:19,343 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 13:47:19,343 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 13:47:19,343 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 -> 287b872f435ea31dbbf77f267944e24b96122b5f745db0674c91555289f3b84c [2024-11-22 13:47:19,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 13:47:19,568 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 13:47:19,571 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 13:47:19,571 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 13:47:19,572 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 13:47:19,573 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-misc-4.wvr.c [2024-11-22 13:47:20,754 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 13:47:20,910 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 13:47:20,910 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-4.wvr.c [2024-11-22 13:47:20,916 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60baee892/074790f0bc904b188f86ff7ce2721ece/FLAG2a1fcd5ac [2024-11-22 13:47:21,337 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60baee892/074790f0bc904b188f86ff7ce2721ece [2024-11-22 13:47:21,339 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 13:47:21,340 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 13:47:21,342 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 13:47:21,342 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 13:47:21,347 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 13:47:21,347 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:47:21" (1/1) ... [2024-11-22 13:47:21,348 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@539d59a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:47:21, skipping insertion in model container [2024-11-22 13:47:21,348 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:47:21" (1/1) ... [2024-11-22 13:47:21,367 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 13:47:21,521 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/weaver/parallel-misc-4.wvr.c[2257,2270] [2024-11-22 13:47:21,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 13:47:21,530 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 13:47:21,546 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/weaver/parallel-misc-4.wvr.c[2257,2270] [2024-11-22 13:47:21,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 13:47:21,563 INFO L204 MainTranslator]: Completed translation [2024-11-22 13:47:21,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:47:21 WrapperNode [2024-11-22 13:47:21,564 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 13:47:21,567 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 13:47:21,567 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 13:47:21,568 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 13:47:21,573 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:47:21" (1/1) ... [2024-11-22 13:47:21,579 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:47:21" (1/1) ... [2024-11-22 13:47:21,592 INFO L138 Inliner]: procedures = 19, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 61 [2024-11-22 13:47:21,592 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 13:47:21,593 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 13:47:21,593 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 13:47:21,593 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 13:47:21,601 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:47:21" (1/1) ... [2024-11-22 13:47:21,601 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:47:21" (1/1) ... [2024-11-22 13:47:21,603 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:47:21" (1/1) ... [2024-11-22 13:47:21,616 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-22 13:47:21,617 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:47:21" (1/1) ... [2024-11-22 13:47:21,617 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:47:21" (1/1) ... [2024-11-22 13:47:21,620 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:47:21" (1/1) ... [2024-11-22 13:47:21,622 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:47:21" (1/1) ... [2024-11-22 13:47:21,623 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:47:21" (1/1) ... [2024-11-22 13:47:21,624 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:47:21" (1/1) ... [2024-11-22 13:47:21,625 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 13:47:21,626 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 13:47:21,626 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 13:47:21,626 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 13:47:21,627 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:47:21" (1/1) ... [2024-11-22 13:47:21,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 13:47:21,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:47:21,675 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-22 13:47:21,677 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-22 13:47:21,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 13:47:21,737 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-22 13:47:21,737 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-22 13:47:21,737 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-22 13:47:21,737 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-22 13:47:21,737 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-22 13:47:21,737 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-22 13:47:21,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 13:47:21,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 13:47:21,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 13:47:21,738 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-22 13:47:21,801 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 13:47:21,802 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 13:47:21,936 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-22 13:47:21,936 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 13:47:22,007 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 13:47:22,007 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-22 13:47:22,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:47:22 BoogieIcfgContainer [2024-11-22 13:47:22,008 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 13:47:22,012 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 13:47:22,012 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 13:47:22,015 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 13:47:22,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:47:21" (1/3) ... [2024-11-22 13:47:22,016 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@247b726b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:47:22, skipping insertion in model container [2024-11-22 13:47:22,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:47:21" (2/3) ... [2024-11-22 13:47:22,016 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@247b726b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:47:22, skipping insertion in model container [2024-11-22 13:47:22,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:47:22" (3/3) ... [2024-11-22 13:47:22,017 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-4.wvr.c [2024-11-22 13:47:22,029 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 13:47:22,029 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 13:47:22,029 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-22 13:47:22,069 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-22 13:47:22,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 40 transitions, 101 flow [2024-11-22 13:47:22,124 INFO L124 PetriNetUnfolderBase]: 4/37 cut-off events. [2024-11-22 13:47:22,125 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-22 13:47:22,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 37 events. 4/37 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 74 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2024-11-22 13:47:22,130 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 40 transitions, 101 flow [2024-11-22 13:47:22,134 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 36 transitions, 90 flow [2024-11-22 13:47:22,141 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 13:47:22,145 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;@21560a0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 13:47:22,147 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-22 13:47:22,162 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-22 13:47:22,163 INFO L124 PetriNetUnfolderBase]: 4/35 cut-off events. [2024-11-22 13:47:22,163 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-22 13:47:22,163 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:47:22,164 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:47:22,164 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-22 13:47:22,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:47:22,168 INFO L85 PathProgramCache]: Analyzing trace with hash 2082292765, now seen corresponding path program 1 times [2024-11-22 13:47:22,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:47:22,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152853562] [2024-11-22 13:47:22,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:47:22,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:47:22,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:47:22,569 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-22 13:47:22,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:47:22,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152853562] [2024-11-22 13:47:22,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152853562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:47:22,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:47:22,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 13:47:22,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489749018] [2024-11-22 13:47:22,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:47:22,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 13:47:22,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:47:22,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 13:47:22,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:47:22,620 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 40 [2024-11-22 13:47:22,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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-22 13:47:22,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:47:22,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 40 [2024-11-22 13:47:22,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:47:22,835 INFO L124 PetriNetUnfolderBase]: 476/948 cut-off events. [2024-11-22 13:47:22,835 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2024-11-22 13:47:22,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1663 conditions, 948 events. 476/948 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 5551 event pairs, 58 based on Foata normal form. 64/901 useless extension candidates. Maximal degree in co-relation 1486. Up to 403 conditions per place. [2024-11-22 13:47:22,850 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 39 selfloop transitions, 8 changer transitions 1/63 dead transitions. [2024-11-22 13:47:22,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 63 transitions, 264 flow [2024-11-22 13:47:22,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 13:47:22,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 13:47:22,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 142 transitions. [2024-11-22 13:47:22,880 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.71 [2024-11-22 13:47:22,882 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 90 flow. Second operand 5 states and 142 transitions. [2024-11-22 13:47:22,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 63 transitions, 264 flow [2024-11-22 13:47:22,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 63 transitions, 236 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-22 13:47:22,891 INFO L231 Difference]: Finished difference. Result has 43 places, 41 transitions, 133 flow [2024-11-22 13:47:22,892 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=133, PETRI_PLACES=43, PETRI_TRANSITIONS=41} [2024-11-22 13:47:22,895 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2024-11-22 13:47:22,896 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 41 transitions, 133 flow [2024-11-22 13:47:22,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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-22 13:47:22,896 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:47:22,896 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:47:22,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 13:47:22,897 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-22 13:47:22,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:47:22,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1830736969, now seen corresponding path program 2 times [2024-11-22 13:47:22,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:47:22,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139249061] [2024-11-22 13:47:22,898 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 13:47:22,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:47:22,915 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 13:47:22,916 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:47:22,972 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-22 13:47:22,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:47:22,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139249061] [2024-11-22 13:47:22,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139249061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:47:22,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:47:22,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 13:47:22,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877671266] [2024-11-22 13:47:22,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:47:22,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 13:47:22,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:47:22,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 13:47:22,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 13:47:22,983 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 40 [2024-11-22 13:47:22,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 41 transitions, 133 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:47:22,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:47:22,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 40 [2024-11-22 13:47:22,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:47:23,084 INFO L124 PetriNetUnfolderBase]: 632/1186 cut-off events. [2024-11-22 13:47:23,084 INFO L125 PetriNetUnfolderBase]: For 844/844 co-relation queries the response was YES. [2024-11-22 13:47:23,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2565 conditions, 1186 events. 632/1186 cut-off events. For 844/844 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 7016 event pairs, 189 based on Foata normal form. 92/1141 useless extension candidates. Maximal degree in co-relation 1474. Up to 594 conditions per place. [2024-11-22 13:47:23,093 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 26 selfloop transitions, 5 changer transitions 1/49 dead transitions. [2024-11-22 13:47:23,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 49 transitions, 222 flow [2024-11-22 13:47:23,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 13:47:23,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 13:47:23,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2024-11-22 13:47:23,094 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7 [2024-11-22 13:47:23,094 INFO L175 Difference]: Start difference. First operand has 43 places, 41 transitions, 133 flow. Second operand 3 states and 84 transitions. [2024-11-22 13:47:23,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 49 transitions, 222 flow [2024-11-22 13:47:23,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 49 transitions, 217 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 13:47:23,100 INFO L231 Difference]: Finished difference. Result has 46 places, 43 transitions, 160 flow [2024-11-22 13:47:23,101 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=46, PETRI_TRANSITIONS=43} [2024-11-22 13:47:23,101 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2024-11-22 13:47:23,102 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 43 transitions, 160 flow [2024-11-22 13:47:23,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:47:23,102 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:47:23,102 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-22 13:47:23,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 13:47:23,102 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-22 13:47:23,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:47:23,103 INFO L85 PathProgramCache]: Analyzing trace with hash 376448579, now seen corresponding path program 1 times [2024-11-22 13:47:23,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:47:23,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518411021] [2024-11-22 13:47:23,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:47:23,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:47:23,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:47:23,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:47:23,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:47:23,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518411021] [2024-11-22 13:47:23,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518411021] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:47:23,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:47:23,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 13:47:23,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075777816] [2024-11-22 13:47:23,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:47:23,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 13:47:23,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:47:23,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 13:47:23,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 13:47:23,190 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 40 [2024-11-22 13:47:23,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 43 transitions, 160 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-22 13:47:23,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:47:23,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 40 [2024-11-22 13:47:23,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:47:23,350 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([235] L55-2-->L56: Formula: (not (= (mod v_~v_assert~0_4 256) 0)) InVars {~v_assert~0=v_~v_assert~0_4} OutVars{~v_assert~0=v_~v_assert~0_4} AuxVars[] AssignedVars[][15], [60#(<= 1 (mod ~v_assert~0 256)), 30#L42true, 39#L88-4true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 7#L56true, 13#L69-1true, Black: 58#true]) [2024-11-22 13:47:23,350 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-11-22 13:47:23,350 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-22 13:47:23,350 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-22 13:47:23,350 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-22 13:47:23,351 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([230] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][46], [60#(<= 1 (mod ~v_assert~0 256)), 39#L88-4true, Black: 51#(<= 0 ~pos~0), 28#L46-2true, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 13#L69-1true, Black: 58#true, 10#L55-2true]) [2024-11-22 13:47:23,351 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-22 13:47:23,351 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-22 13:47:23,351 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-22 13:47:23,351 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-22 13:47:23,351 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([229] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][32], [60#(<= 1 (mod ~v_assert~0 256)), 15#L43-2true, 39#L88-4true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 13#L69-1true, Black: 58#true, 10#L55-2true]) [2024-11-22 13:47:23,351 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-22 13:47:23,351 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-22 13:47:23,352 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-22 13:47:23,352 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-22 13:47:23,361 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([235] L55-2-->L56: Formula: (not (= (mod v_~v_assert~0_4 256) 0)) InVars {~v_assert~0=v_~v_assert~0_4} OutVars{~v_assert~0=v_~v_assert~0_4} AuxVars[] AssignedVars[][15], [5#L89true, 60#(<= 1 (mod ~v_assert~0 256)), 30#L42true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, 7#L56true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 13#L69-1true, Black: 58#true]) [2024-11-22 13:47:23,361 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-22 13:47:23,361 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-22 13:47:23,362 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-22 13:47:23,362 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-22 13:47:23,362 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([230] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][46], [5#L89true, 60#(<= 1 (mod ~v_assert~0 256)), Black: 51#(<= 0 ~pos~0), 28#L46-2true, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 13#L69-1true, Black: 58#true, 10#L55-2true]) [2024-11-22 13:47:23,362 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-22 13:47:23,362 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-22 13:47:23,362 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 13:47:23,362 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 13:47:23,363 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([229] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][32], [5#L89true, 60#(<= 1 (mod ~v_assert~0 256)), 15#L43-2true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 13#L69-1true, Black: 58#true, 10#L55-2true]) [2024-11-22 13:47:23,363 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-22 13:47:23,363 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 13:47:23,363 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-22 13:47:23,363 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 13:47:23,364 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([235] L55-2-->L56: Formula: (not (= (mod v_~v_assert~0_4 256) 0)) InVars {~v_assert~0=v_~v_assert~0_4} OutVars{~v_assert~0=v_~v_assert~0_4} AuxVars[] AssignedVars[][15], [60#(<= 1 (mod ~v_assert~0 256)), 30#L42true, 39#L88-4true, 14#thread3EXITtrue, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 7#L56true, Black: 58#true]) [2024-11-22 13:47:23,364 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-22 13:47:23,364 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-22 13:47:23,364 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-22 13:47:23,364 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-22 13:47:23,364 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([230] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][46], [60#(<= 1 (mod ~v_assert~0 256)), 39#L88-4true, 14#thread3EXITtrue, Black: 51#(<= 0 ~pos~0), 28#L46-2true, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true, 10#L55-2true]) [2024-11-22 13:47:23,364 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-22 13:47:23,364 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-22 13:47:23,364 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 13:47:23,365 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 13:47:23,365 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([229] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][32], [60#(<= 1 (mod ~v_assert~0 256)), 15#L43-2true, 39#L88-4true, 14#thread3EXITtrue, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true, 10#L55-2true]) [2024-11-22 13:47:23,365 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-22 13:47:23,365 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 13:47:23,365 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-22 13:47:23,365 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 13:47:23,371 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([235] L55-2-->L56: Formula: (not (= (mod v_~v_assert~0_4 256) 0)) InVars {~v_assert~0=v_~v_assert~0_4} OutVars{~v_assert~0=v_~v_assert~0_4} AuxVars[] AssignedVars[][15], [60#(<= 1 (mod ~v_assert~0 256)), 30#L42true, 39#L88-4true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, 7#L56true, 13#L69-1true, 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true]) [2024-11-22 13:47:23,371 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-11-22 13:47:23,371 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-22 13:47:23,371 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-22 13:47:23,371 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-22 13:47:23,371 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([230] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][46], [60#(<= 1 (mod ~v_assert~0 256)), 39#L88-4true, Black: 51#(<= 0 ~pos~0), 28#L46-2true, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, 13#L69-1true, 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true, 10#L55-2true]) [2024-11-22 13:47:23,372 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-22 13:47:23,372 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-22 13:47:23,372 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-22 13:47:23,372 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-22 13:47:23,372 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([229] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][32], [60#(<= 1 (mod ~v_assert~0 256)), 15#L43-2true, 39#L88-4true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, 13#L69-1true, 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true, 10#L55-2true]) [2024-11-22 13:47:23,372 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-22 13:47:23,372 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-22 13:47:23,372 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-22 13:47:23,373 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-22 13:47:23,375 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([235] L55-2-->L56: Formula: (not (= (mod v_~v_assert~0_4 256) 0)) InVars {~v_assert~0=v_~v_assert~0_4} OutVars{~v_assert~0=v_~v_assert~0_4} AuxVars[] AssignedVars[][15], [5#L89true, 60#(<= 1 (mod ~v_assert~0 256)), 30#L42true, 14#thread3EXITtrue, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 7#L56true, Black: 58#true]) [2024-11-22 13:47:23,375 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-22 13:47:23,375 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 13:47:23,375 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 13:47:23,376 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-22 13:47:23,376 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([230] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][46], [5#L89true, 60#(<= 1 (mod ~v_assert~0 256)), Black: 51#(<= 0 ~pos~0), 14#thread3EXITtrue, 28#L46-2true, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true, 10#L55-2true]) [2024-11-22 13:47:23,376 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-22 13:47:23,376 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-22 13:47:23,376 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-22 13:47:23,376 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 13:47:23,376 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([229] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][32], [5#L89true, 60#(<= 1 (mod ~v_assert~0 256)), 15#L43-2true, 14#thread3EXITtrue, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true, 10#L55-2true]) [2024-11-22 13:47:23,376 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-22 13:47:23,376 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 13:47:23,376 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-22 13:47:23,376 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-22 13:47:23,378 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([235] L55-2-->L56: Formula: (not (= (mod v_~v_assert~0_4 256) 0)) InVars {~v_assert~0=v_~v_assert~0_4} OutVars{~v_assert~0=v_~v_assert~0_4} AuxVars[] AssignedVars[][15], [60#(<= 1 (mod ~v_assert~0 256)), 30#L42true, 39#L88-4true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 7#L56true, 13#L69-1true, Black: 58#true]) [2024-11-22 13:47:23,378 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-22 13:47:23,378 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-22 13:47:23,378 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-22 13:47:23,378 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-22 13:47:23,379 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-22 13:47:23,379 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([235] L55-2-->L56: Formula: (not (= (mod v_~v_assert~0_4 256) 0)) InVars {~v_assert~0=v_~v_assert~0_4} OutVars{~v_assert~0=v_~v_assert~0_4} AuxVars[] AssignedVars[][15], [5#L89true, 60#(<= 1 (mod ~v_assert~0 256)), 30#L42true, Black: 51#(<= 0 ~pos~0), 63#true, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 7#L56true, 13#L69-1true, 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true]) [2024-11-22 13:47:23,379 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-22 13:47:23,379 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-22 13:47:23,379 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-22 13:47:23,379 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-22 13:47:23,379 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([230] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][46], [5#L89true, 60#(<= 1 (mod ~v_assert~0 256)), Black: 51#(<= 0 ~pos~0), 28#L46-2true, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, 13#L69-1true, 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true, 10#L55-2true]) [2024-11-22 13:47:23,379 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-22 13:47:23,379 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 13:47:23,380 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 13:47:23,380 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-22 13:47:23,380 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([229] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][32], [5#L89true, 60#(<= 1 (mod ~v_assert~0 256)), 15#L43-2true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, 13#L69-1true, 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true, 10#L55-2true]) [2024-11-22 13:47:23,380 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-22 13:47:23,380 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 13:47:23,380 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 13:47:23,380 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-22 13:47:23,381 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([230] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][46], [60#(<= 1 (mod ~v_assert~0 256)), Black: 51#(<= 0 ~pos~0), 39#L88-4true, 14#thread3EXITtrue, 28#L46-2true, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true, 10#L55-2true]) [2024-11-22 13:47:23,381 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-22 13:47:23,381 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 13:47:23,381 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 13:47:23,381 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-22 13:47:23,381 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([229] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][32], [60#(<= 1 (mod ~v_assert~0 256)), 15#L43-2true, 39#L88-4true, Black: 51#(<= 0 ~pos~0), 14#thread3EXITtrue, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true, 10#L55-2true]) [2024-11-22 13:47:23,381 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-22 13:47:23,381 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 13:47:23,381 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 13:47:23,381 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-22 13:47:23,383 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([229] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][16], [60#(<= 1 (mod ~v_assert~0 256)), 5#L89true, 65#(<= 1 (mod ~d2~0 256)), 8#L57true, 15#L43-2true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 13#L69-1true, Black: 58#true]) [2024-11-22 13:47:23,384 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-22 13:47:23,384 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-22 13:47:23,384 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-22 13:47:23,384 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-22 13:47:23,384 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([230] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][37], [60#(<= 1 (mod ~v_assert~0 256)), 5#L89true, 65#(<= 1 (mod ~d2~0 256)), 8#L57true, Black: 51#(<= 0 ~pos~0), 28#L46-2true, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 13#L69-1true, Black: 58#true]) [2024-11-22 13:47:23,384 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-22 13:47:23,384 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-22 13:47:23,384 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-22 13:47:23,385 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-22 13:47:23,385 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([229] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][32], [60#(<= 1 (mod ~v_assert~0 256)), 15#L43-2true, 39#L88-4true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 13#L69-1true, Black: 58#true, 10#L55-2true]) [2024-11-22 13:47:23,385 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-22 13:47:23,385 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-22 13:47:23,385 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-22 13:47:23,385 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-22 13:47:23,385 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-22 13:47:23,385 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([230] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][46], [60#(<= 1 (mod ~v_assert~0 256)), 39#L88-4true, Black: 51#(<= 0 ~pos~0), 28#L46-2true, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 13#L69-1true, Black: 58#true, 10#L55-2true]) [2024-11-22 13:47:23,386 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-22 13:47:23,386 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-22 13:47:23,386 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-22 13:47:23,386 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-22 13:47:23,386 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-22 13:47:23,386 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([235] L55-2-->L56: Formula: (not (= (mod v_~v_assert~0_4 256) 0)) InVars {~v_assert~0=v_~v_assert~0_4} OutVars{~v_assert~0=v_~v_assert~0_4} AuxVars[] AssignedVars[][15], [5#L89true, 60#(<= 1 (mod ~v_assert~0 256)), 30#L42true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 7#L56true, 13#L69-1true, Black: 58#true]) [2024-11-22 13:47:23,386 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-22 13:47:23,386 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-22 13:47:23,386 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-22 13:47:23,386 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-22 13:47:23,387 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-22 13:47:23,387 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([230] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][46], [5#L89true, 60#(<= 1 (mod ~v_assert~0 256)), Black: 51#(<= 0 ~pos~0), 14#thread3EXITtrue, 28#L46-2true, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true, 10#L55-2true]) [2024-11-22 13:47:23,387 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-22 13:47:23,387 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-22 13:47:23,389 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-22 13:47:23,389 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 13:47:23,389 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([229] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][32], [5#L89true, 60#(<= 1 (mod ~v_assert~0 256)), 15#L43-2true, Black: 51#(<= 0 ~pos~0), 14#thread3EXITtrue, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true, 10#L55-2true]) [2024-11-22 13:47:23,390 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-22 13:47:23,390 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-22 13:47:23,390 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-22 13:47:23,390 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 13:47:23,390 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([229] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][32], [5#L89true, 60#(<= 1 (mod ~v_assert~0 256)), 15#L43-2true, Black: 51#(<= 0 ~pos~0), 63#true, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 13#L69-1true, Black: 58#true, 10#L55-2true]) [2024-11-22 13:47:23,390 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-22 13:47:23,390 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 13:47:23,391 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-22 13:47:23,391 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 13:47:23,391 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-22 13:47:23,391 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([230] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][46], [5#L89true, 60#(<= 1 (mod ~v_assert~0 256)), Black: 51#(<= 0 ~pos~0), 28#L46-2true, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 13#L69-1true, Black: 58#true, 10#L55-2true]) [2024-11-22 13:47:23,391 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-22 13:47:23,391 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-22 13:47:23,391 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-22 13:47:23,391 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 13:47:23,391 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 13:47:23,392 INFO L124 PetriNetUnfolderBase]: 1341/2305 cut-off events. [2024-11-22 13:47:23,392 INFO L125 PetriNetUnfolderBase]: For 1737/1793 co-relation queries the response was YES. [2024-11-22 13:47:23,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5602 conditions, 2305 events. 1341/2305 cut-off events. For 1737/1793 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 14197 event pairs, 439 based on Foata normal form. 11/1834 useless extension candidates. Maximal degree in co-relation 3065. Up to 897 conditions per place. [2024-11-22 13:47:23,407 INFO L140 encePairwiseOnDemand]: 36/40 looper letters, 34 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2024-11-22 13:47:23,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 58 transitions, 290 flow [2024-11-22 13:47:23,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 13:47:23,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 13:47:23,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2024-11-22 13:47:23,410 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7583333333333333 [2024-11-22 13:47:23,410 INFO L175 Difference]: Start difference. First operand has 46 places, 43 transitions, 160 flow. Second operand 3 states and 91 transitions. [2024-11-22 13:47:23,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 58 transitions, 290 flow [2024-11-22 13:47:23,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 58 transitions, 280 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 13:47:23,416 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 172 flow [2024-11-22 13:47:23,416 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2024-11-22 13:47:23,417 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 6 predicate places. [2024-11-22 13:47:23,418 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 172 flow [2024-11-22 13:47:23,418 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-22 13:47:23,418 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:47:23,418 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] [2024-11-22 13:47:23,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 13:47:23,418 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-22 13:47:23,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:47:23,419 INFO L85 PathProgramCache]: Analyzing trace with hash 282541655, now seen corresponding path program 1 times [2024-11-22 13:47:23,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:47:23,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658536803] [2024-11-22 13:47:23,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:47:23,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:47:23,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:47:23,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:47:23,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:47:23,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658536803] [2024-11-22 13:47:23,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658536803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:47:23,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:47:23,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 13:47:23,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436878941] [2024-11-22 13:47:23,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:47:23,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 13:47:23,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:47:23,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 13:47:23,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 13:47:23,476 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 40 [2024-11-22 13:47:23,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 172 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-22 13:47:23,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:47:23,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 40 [2024-11-22 13:47:23,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:47:23,604 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([225] L41-2-->L42: Formula: (not (= (mod v_~v_assert~0_2 256) 0)) InVars {~v_assert~0=v_~v_assert~0_2} OutVars{~v_assert~0=v_~v_assert~0_2} AuxVars[] AssignedVars[][9], [30#L42true, Black: 65#(<= 1 (mod ~d2~0 256)), Black: 51#(<= 0 ~pos~0), 63#true, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 3#L88-3true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 7#L56true, 68#true, Black: 58#true]) [2024-11-22 13:47:23,604 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-22 13:47:23,605 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 13:47:23,605 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-22 13:47:23,605 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-22 13:47:23,613 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([225] L41-2-->L42: Formula: (not (= (mod v_~v_assert~0_2 256) 0)) InVars {~v_assert~0=v_~v_assert~0_2} OutVars{~v_assert~0=v_~v_assert~0_2} AuxVars[] AssignedVars[][9], [30#L42true, Black: 65#(<= 1 (mod ~d2~0 256)), 39#L88-4true, Black: 51#(<= 0 ~pos~0), 63#true, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 21#$Ultimate##0true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 7#L56true, 68#true, Black: 58#true]) [2024-11-22 13:47:23,614 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-11-22 13:47:23,614 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 13:47:23,614 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-22 13:47:23,614 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 13:47:23,622 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([225] L41-2-->L42: Formula: (not (= (mod v_~v_assert~0_2 256) 0)) InVars {~v_assert~0=v_~v_assert~0_2} OutVars{~v_assert~0=v_~v_assert~0_2} AuxVars[] AssignedVars[][9], [30#L42true, Black: 65#(<= 1 (mod ~d2~0 256)), 39#L88-4true, Black: 51#(<= 0 ~pos~0), 14#thread3EXITtrue, 63#true, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 7#L56true, 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 68#true, Black: 58#true]) [2024-11-22 13:47:23,622 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-22 13:47:23,622 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-22 13:47:23,623 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-22 13:47:23,623 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-22 13:47:23,627 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([225] L41-2-->L42: Formula: (not (= (mod v_~v_assert~0_2 256) 0)) InVars {~v_assert~0=v_~v_assert~0_2} OutVars{~v_assert~0=v_~v_assert~0_2} AuxVars[] AssignedVars[][9], [5#L89true, 30#L42true, Black: 65#(<= 1 (mod ~d2~0 256)), Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, 21#$Ultimate##0true, Black: 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 7#L56true, 68#true, Black: 58#true]) [2024-11-22 13:47:23,627 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-22 13:47:23,627 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-22 13:47:23,627 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-22 13:47:23,627 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-22 13:47:23,635 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([225] L41-2-->L42: Formula: (not (= (mod v_~v_assert~0_2 256) 0)) InVars {~v_assert~0=v_~v_assert~0_2} OutVars{~v_assert~0=v_~v_assert~0_2} AuxVars[] AssignedVars[][9], [5#L89true, 30#L42true, Black: 65#(<= 1 (mod ~d2~0 256)), Black: 51#(<= 0 ~pos~0), 14#thread3EXITtrue, 63#true, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 7#L56true, 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 68#true, Black: 58#true]) [2024-11-22 13:47:23,635 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-22 13:47:23,635 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-22 13:47:23,635 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-22 13:47:23,635 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-22 13:47:23,644 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([240] L60-->L60-1: Formula: (= (+ v_~pos~0_7 2) v_~pos~0_8) InVars {~pos~0=v_~pos~0_8} OutVars{~pos~0=v_~pos~0_7} AuxVars[] AssignedVars[~pos~0][45], [25#L60-1true, Black: 65#(<= 1 (mod ~d2~0 256)), 39#L88-4true, 14#thread3EXITtrue, Black: 51#(<= 0 ~pos~0), 28#L46-2true, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, 68#true, 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true]) [2024-11-22 13:47:23,644 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-11-22 13:47:23,645 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-22 13:47:23,645 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-22 13:47:23,645 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-22 13:47:23,650 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([240] L60-->L60-1: Formula: (= (+ v_~pos~0_7 2) v_~pos~0_8) InVars {~pos~0=v_~pos~0_8} OutVars{~pos~0=v_~pos~0_7} AuxVars[] AssignedVars[~pos~0][45], [5#L89true, Black: 65#(<= 1 (mod ~d2~0 256)), 25#L60-1true, 14#thread3EXITtrue, Black: 51#(<= 0 ~pos~0), 28#L46-2true, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 68#true, Black: 58#true]) [2024-11-22 13:47:23,650 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-11-22 13:47:23,650 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-22 13:47:23,650 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-22 13:47:23,650 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-22 13:47:23,651 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([225] L41-2-->L42: Formula: (not (= (mod v_~v_assert~0_2 256) 0)) InVars {~v_assert~0=v_~v_assert~0_2} OutVars{~v_assert~0=v_~v_assert~0_2} AuxVars[] AssignedVars[][9], [5#L89true, 30#L42true, Black: 65#(<= 1 (mod ~d2~0 256)), Black: 51#(<= 0 ~pos~0), 63#true, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 7#L56true, 13#L69-1true, 68#true, 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true]) [2024-11-22 13:47:23,651 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-11-22 13:47:23,651 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-22 13:47:23,651 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-22 13:47:23,651 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-22 13:47:23,652 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([225] L41-2-->L42: Formula: (not (= (mod v_~v_assert~0_2 256) 0)) InVars {~v_assert~0=v_~v_assert~0_2} OutVars{~v_assert~0=v_~v_assert~0_2} AuxVars[] AssignedVars[][9], [30#L42true, Black: 65#(<= 1 (mod ~d2~0 256)), 39#L88-4true, Black: 51#(<= 0 ~pos~0), 14#thread3EXITtrue, 63#true, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 7#L56true, 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 68#true, Black: 58#true]) [2024-11-22 13:47:23,653 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-11-22 13:47:23,653 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-22 13:47:23,653 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-22 13:47:23,653 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-22 13:47:23,653 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-22 13:47:23,654 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([225] L41-2-->L42: Formula: (not (= (mod v_~v_assert~0_2 256) 0)) InVars {~v_assert~0=v_~v_assert~0_2} OutVars{~v_assert~0=v_~v_assert~0_2} AuxVars[] AssignedVars[][9], [30#L42true, Black: 65#(<= 1 (mod ~d2~0 256)), 39#L88-4true, 14#thread3EXITtrue, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, 7#L56true, 68#true, 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true]) [2024-11-22 13:47:23,654 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-11-22 13:47:23,654 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-22 13:47:23,654 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-22 13:47:23,654 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-22 13:47:23,654 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-22 13:47:23,654 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-22 13:47:23,659 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([225] L41-2-->L42: Formula: (not (= (mod v_~v_assert~0_2 256) 0)) InVars {~v_assert~0=v_~v_assert~0_2} OutVars{~v_assert~0=v_~v_assert~0_2} AuxVars[] AssignedVars[][9], [5#L89true, 30#L42true, Black: 65#(<= 1 (mod ~d2~0 256)), 14#thread3EXITtrue, Black: 51#(<= 0 ~pos~0), 63#true, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 7#L56true, 68#true, 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 58#true]) [2024-11-22 13:47:23,659 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-22 13:47:23,659 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-22 13:47:23,660 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-22 13:47:23,660 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-22 13:47:23,660 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-22 13:47:23,660 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([225] L41-2-->L42: Formula: (not (= (mod v_~v_assert~0_2 256) 0)) InVars {~v_assert~0=v_~v_assert~0_2} OutVars{~v_assert~0=v_~v_assert~0_2} AuxVars[] AssignedVars[][9], [5#L89true, 30#L42true, Black: 65#(<= 1 (mod ~d2~0 256)), Black: 51#(<= 0 ~pos~0), 14#thread3EXITtrue, Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 63#true, 7#L56true, 52#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 68#true, Black: 58#true]) [2024-11-22 13:47:23,660 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-22 13:47:23,661 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-22 13:47:23,661 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-22 13:47:23,661 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-22 13:47:23,661 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-22 13:47:23,661 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-22 13:47:23,663 INFO L124 PetriNetUnfolderBase]: 1000/2000 cut-off events. [2024-11-22 13:47:23,663 INFO L125 PetriNetUnfolderBase]: For 1078/1185 co-relation queries the response was YES. [2024-11-22 13:47:23,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4689 conditions, 2000 events. 1000/2000 cut-off events. For 1078/1185 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 13368 event pairs, 391 based on Foata normal form. 14/1764 useless extension candidates. Maximal degree in co-relation 2415. Up to 731 conditions per place. [2024-11-22 13:47:23,682 INFO L140 encePairwiseOnDemand]: 36/40 looper letters, 32 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2024-11-22 13:47:23,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 58 transitions, 285 flow [2024-11-22 13:47:23,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 13:47:23,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 13:47:23,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2024-11-22 13:47:23,683 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7583333333333333 [2024-11-22 13:47:23,683 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 172 flow. Second operand 3 states and 91 transitions. [2024-11-22 13:47:23,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 58 transitions, 285 flow [2024-11-22 13:47:23,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 58 transitions, 279 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 13:47:23,690 INFO L231 Difference]: Finished difference. Result has 50 places, 47 transitions, 188 flow [2024-11-22 13:47:23,691 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=188, PETRI_PLACES=50, PETRI_TRANSITIONS=47} [2024-11-22 13:47:23,692 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2024-11-22 13:47:23,692 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 47 transitions, 188 flow [2024-11-22 13:47:23,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-22 13:47:23,692 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:47:23,693 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 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-22 13:47:23,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 13:47:23,693 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-22 13:47:23,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:47:23,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1884612495, now seen corresponding path program 1 times [2024-11-22 13:47:23,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:47:23,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564991850] [2024-11-22 13:47:23,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:47:23,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:47:23,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:47:23,837 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:47:23,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:47:23,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564991850] [2024-11-22 13:47:23,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564991850] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:47:23,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645137073] [2024-11-22 13:47:23,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:47:23,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:47:23,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:47:23,840 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 13:47:23,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 13:47:23,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:47:23,894 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-22 13:47:23,901 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:47:24,022 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:47:24,026 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:47:24,109 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:47:24,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645137073] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 13:47:24,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 13:47:24,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 6] total 11 [2024-11-22 13:47:24,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643856461] [2024-11-22 13:47:24,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 13:47:24,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-22 13:47:24,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:47:24,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-22 13:47:24,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-22 13:47:24,120 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2024-11-22 13:47:24,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 47 transitions, 188 flow. Second operand has 11 states, 11 states have (on average 18.818181818181817) internal successors, (207), 11 states have internal predecessors, (207), 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-22 13:47:24,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:47:24,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2024-11-22 13:47:24,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:47:24,639 INFO L124 PetriNetUnfolderBase]: 3111/5708 cut-off events. [2024-11-22 13:47:24,639 INFO L125 PetriNetUnfolderBase]: For 4521/4565 co-relation queries the response was YES. [2024-11-22 13:47:24,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14716 conditions, 5708 events. 3111/5708 cut-off events. For 4521/4565 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 40393 event pairs, 201 based on Foata normal form. 160/5584 useless extension candidates. Maximal degree in co-relation 9174. Up to 1315 conditions per place. [2024-11-22 13:47:24,660 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 55 selfloop transitions, 20 changer transitions 22/113 dead transitions. [2024-11-22 13:47:24,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 113 transitions, 625 flow [2024-11-22 13:47:24,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 13:47:24,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-22 13:47:24,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 222 transitions. [2024-11-22 13:47:24,662 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6166666666666667 [2024-11-22 13:47:24,662 INFO L175 Difference]: Start difference. First operand has 50 places, 47 transitions, 188 flow. Second operand 9 states and 222 transitions. [2024-11-22 13:47:24,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 113 transitions, 625 flow [2024-11-22 13:47:24,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 113 transitions, 619 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 13:47:24,670 INFO L231 Difference]: Finished difference. Result has 62 places, 60 transitions, 359 flow [2024-11-22 13:47:24,670 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=359, PETRI_PLACES=62, PETRI_TRANSITIONS=60} [2024-11-22 13:47:24,672 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 20 predicate places. [2024-11-22 13:47:24,673 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 60 transitions, 359 flow [2024-11-22 13:47:24,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 18.818181818181817) internal successors, (207), 11 states have internal predecessors, (207), 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-22 13:47:24,673 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:47:24,673 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 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-22 13:47:24,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-22 13:47:24,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:47:24,878 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-22 13:47:24,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:47:24,880 INFO L85 PathProgramCache]: Analyzing trace with hash -644573438, now seen corresponding path program 1 times [2024-11-22 13:47:24,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:47:24,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666324746] [2024-11-22 13:47:24,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:47:24,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:47:24,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:47:25,001 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:47:25,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:47:25,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666324746] [2024-11-22 13:47:25,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666324746] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:47:25,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577272913] [2024-11-22 13:47:25,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:47:25,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:47:25,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:47:25,004 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 13:47:25,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-22 13:47:25,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:47:25,051 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-22 13:47:25,053 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:47:25,131 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:47:25,132 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:47:25,204 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:47:25,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577272913] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 13:47:25,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 13:47:25,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 6] total 11 [2024-11-22 13:47:25,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729121469] [2024-11-22 13:47:25,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 13:47:25,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-22 13:47:25,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:47:25,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-22 13:47:25,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-22 13:47:25,232 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 40 [2024-11-22 13:47:25,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 60 transitions, 359 flow. Second operand has 11 states, 11 states have (on average 16.181818181818183) internal successors, (178), 11 states have internal predecessors, (178), 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-22 13:47:25,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:47:25,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 40 [2024-11-22 13:47:25,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:47:26,339 INFO L124 PetriNetUnfolderBase]: 7057/11833 cut-off events. [2024-11-22 13:47:26,339 INFO L125 PetriNetUnfolderBase]: For 26761/26761 co-relation queries the response was YES. [2024-11-22 13:47:26,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38719 conditions, 11833 events. 7057/11833 cut-off events. For 26761/26761 co-relation queries the response was YES. Maximal size of possible extension queue 577. Compared 82959 event pairs, 423 based on Foata normal form. 216/11203 useless extension candidates. Maximal degree in co-relation 34309. Up to 2802 conditions per place. [2024-11-22 13:47:26,392 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 94 selfloop transitions, 43 changer transitions 87/235 dead transitions. [2024-11-22 13:47:26,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 235 transitions, 1890 flow [2024-11-22 13:47:26,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-22 13:47:26,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-22 13:47:26,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 311 transitions. [2024-11-22 13:47:26,394 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5553571428571429 [2024-11-22 13:47:26,394 INFO L175 Difference]: Start difference. First operand has 62 places, 60 transitions, 359 flow. Second operand 14 states and 311 transitions. [2024-11-22 13:47:26,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 235 transitions, 1890 flow [2024-11-22 13:47:26,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 235 transitions, 1663 flow, removed 112 selfloop flow, removed 3 redundant places. [2024-11-22 13:47:26,487 INFO L231 Difference]: Finished difference. Result has 78 places, 92 transitions, 737 flow [2024-11-22 13:47:26,491 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=737, PETRI_PLACES=78, PETRI_TRANSITIONS=92} [2024-11-22 13:47:26,492 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 36 predicate places. [2024-11-22 13:47:26,492 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 92 transitions, 737 flow [2024-11-22 13:47:26,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.181818181818183) internal successors, (178), 11 states have internal predecessors, (178), 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-22 13:47:26,492 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:47:26,492 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 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-22 13:47:26,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-22 13:47:26,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-22 13:47:26,693 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-22 13:47:26,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:47:26,694 INFO L85 PathProgramCache]: Analyzing trace with hash -632709205, now seen corresponding path program 2 times [2024-11-22 13:47:26,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:47:26,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066675780] [2024-11-22 13:47:26,694 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 13:47:26,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:47:26,722 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 13:47:26,722 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:47:26,830 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-22 13:47:26,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:47:26,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066675780] [2024-11-22 13:47:26,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066675780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:47:26,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:47:26,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 13:47:26,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397507390] [2024-11-22 13:47:26,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:47:26,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 13:47:26,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:47:26,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 13:47:26,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:47:26,835 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 40 [2024-11-22 13:47:26,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 92 transitions, 737 flow. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:47:26,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:47:26,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 40 [2024-11-22 13:47:26,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:47:27,377 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([229] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][23], [Black: 63#true, 478#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256))), 14#thread3EXITtrue, Black: 68#true, Black: 265#(and (or (= ~v_assert~0 1) (= ~v_assert~0 0)) (or (< 0 (+ ~pos~0 1)) (= ~v_assert~0 0))), Black: 486#(and (or (= ~d1~0 1) (= ~d1~0 0)) (= ~v_assert~0 1)), Black: 90#(or (= ~v_assert~0 1) (= ~v_assert~0 0)), Black: 144#(= ~v_assert~0 1), Black: 488#(and (or (< 0 (+ ~pos~0 1)) (= ~d1~0 0)) (or (= ~d1~0 1) (= ~d1~0 0))), 263#(and (<= 2 ~pos~0) (= ~v_assert~0 1)), 499#true, Black: 482#(and (<= 1 ~pos~0) (or (= ~d1~0 1) (= ~d1~0 0)) (= ~v_assert~0 1)), Black: 94#(and (= ~pos~0 0) (= ~v_assert~0 1)), Black: 261#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 480#(and (or (= ~d1~0 1) (= ~d1~0 0)) (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 286#(or (= ~d1~0 1) (= ~d1~0 0)), 5#L89true, Black: 490#(and (or (< 0 (+ ~pos~0 1)) (= ~d1~0 0)) (or (= ~d1~0 1) (= ~d1~0 0)) (= ~v_assert~0 1)), 25#L60-1true, Black: 476#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), 15#L43-2true, Black: 51#(<= 0 ~pos~0), Black: 54#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 58#true]) [2024-11-22 13:47:27,378 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2024-11-22 13:47:27,378 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:47:27,378 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-22 13:47:27,378 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-11-22 13:47:27,387 INFO L124 PetriNetUnfolderBase]: 3481/6287 cut-off events. [2024-11-22 13:47:27,387 INFO L125 PetriNetUnfolderBase]: For 23976/24502 co-relation queries the response was YES. [2024-11-22 13:47:27,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23274 conditions, 6287 events. 3481/6287 cut-off events. For 23976/24502 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 45524 event pairs, 984 based on Foata normal form. 76/5416 useless extension candidates. Maximal degree in co-relation 22930. Up to 1726 conditions per place. [2024-11-22 13:47:27,439 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 89 selfloop transitions, 5 changer transitions 0/142 dead transitions. [2024-11-22 13:47:27,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 142 transitions, 1340 flow [2024-11-22 13:47:27,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 13:47:27,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 13:47:27,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2024-11-22 13:47:27,441 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.775 [2024-11-22 13:47:27,441 INFO L175 Difference]: Start difference. First operand has 78 places, 92 transitions, 737 flow. Second operand 4 states and 124 transitions. [2024-11-22 13:47:27,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 142 transitions, 1340 flow [2024-11-22 13:47:27,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 142 transitions, 1188 flow, removed 73 selfloop flow, removed 6 redundant places. [2024-11-22 13:47:27,476 INFO L231 Difference]: Finished difference. Result has 74 places, 94 transitions, 695 flow [2024-11-22 13:47:27,477 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=659, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=695, PETRI_PLACES=74, PETRI_TRANSITIONS=94} [2024-11-22 13:47:27,478 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 32 predicate places. [2024-11-22 13:47:27,478 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 94 transitions, 695 flow [2024-11-22 13:47:27,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:47:27,478 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:47:27,478 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 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-22 13:47:27,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 13:47:27,479 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-22 13:47:27,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:47:27,479 INFO L85 PathProgramCache]: Analyzing trace with hash 263810358, now seen corresponding path program 2 times [2024-11-22 13:47:27,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:47:27,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528104294] [2024-11-22 13:47:27,480 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 13:47:27,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:47:27,500 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 13:47:27,501 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:47:27,593 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-22 13:47:27,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:47:27,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528104294] [2024-11-22 13:47:27,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528104294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:47:27,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:47:27,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 13:47:27,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148263236] [2024-11-22 13:47:27,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:47:27,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 13:47:27,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:47:27,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 13:47:27,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:47:27,606 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 40 [2024-11-22 13:47:27,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 94 transitions, 695 flow. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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-22 13:47:27,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:47:27,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 40 [2024-11-22 13:47:27,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:47:27,675 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([229] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][25], [Black: 63#true, Black: 68#true, Black: 265#(and (or (= ~v_assert~0 1) (= ~v_assert~0 0)) (or (< 0 (+ ~pos~0 1)) (= ~v_assert~0 0))), Black: 90#(or (= ~v_assert~0 1) (= ~v_assert~0 0)), Black: 144#(= ~v_assert~0 1), 263#(and (<= 2 ~pos~0) (= ~v_assert~0 1)), Black: 94#(and (= ~pos~0 0) (= ~v_assert~0 1)), Black: 261#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 51#(<= 0 ~pos~0), 15#L43-2true, 21#$Ultimate##0true, Black: 486#(and (or (= ~d1~0 1) (= ~d1~0 0)) (= ~v_assert~0 1)), Black: 488#(and (or (< 0 (+ ~pos~0 1)) (= ~d1~0 0)) (or (= ~d1~0 1) (= ~d1~0 0))), Black: 478#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256))), 499#true, Black: 480#(and (or (= ~d1~0 1) (= ~d1~0 0)) (= ~v_assert~0 1) (<= 0 ~pos~0)), 5#L89true, Black: 286#(or (= ~d1~0 1) (= ~d1~0 0)), 25#L60-1true, Black: 476#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), 474#(and (<= 1 ~pos~0) (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256))), 506#true, Black: 501#(= (mod ~d2~0 256) 0), Black: 502#(and (<= (div ~d2~0 256) 0) (<= 1 ~d2~0)), Black: 58#true]) [2024-11-22 13:47:27,675 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-11-22 13:47:27,675 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-22 13:47:27,675 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-22 13:47:27,675 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-22 13:47:27,745 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([229] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][25], [Black: 63#true, 478#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256))), Black: 68#true, Black: 265#(and (or (= ~v_assert~0 1) (= ~v_assert~0 0)) (or (< 0 (+ ~pos~0 1)) (= ~v_assert~0 0))), Black: 486#(and (or (= ~d1~0 1) (= ~d1~0 0)) (= ~v_assert~0 1)), Black: 90#(or (= ~v_assert~0 1) (= ~v_assert~0 0)), Black: 144#(= ~v_assert~0 1), Black: 488#(and (or (< 0 (+ ~pos~0 1)) (= ~d1~0 0)) (or (= ~d1~0 1) (= ~d1~0 0))), 263#(and (<= 2 ~pos~0) (= ~v_assert~0 1)), Black: 94#(and (= ~pos~0 0) (= ~v_assert~0 1)), Black: 261#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 480#(and (or (= ~d1~0 1) (= ~d1~0 0)) (= ~v_assert~0 1) (<= 0 ~pos~0)), 5#L89true, Black: 286#(or (= ~d1~0 1) (= ~d1~0 0)), 25#L60-1true, Black: 476#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), 15#L43-2true, 506#true, Black: 51#(<= 0 ~pos~0), Black: 501#(= (mod ~d2~0 256) 0), 21#$Ultimate##0true, Black: 499#true, 502#(and (<= (div ~d2~0 256) 0) (<= 1 ~d2~0)), Black: 58#true]) [2024-11-22 13:47:27,745 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-11-22 13:47:27,745 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-22 13:47:27,746 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 13:47:27,746 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 13:47:27,777 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([229] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][25], [Black: 63#true, 478#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256))), Black: 68#true, Black: 265#(and (or (= ~v_assert~0 1) (= ~v_assert~0 0)) (or (< 0 (+ ~pos~0 1)) (= ~v_assert~0 0))), Black: 486#(and (or (= ~d1~0 1) (= ~d1~0 0)) (= ~v_assert~0 1)), Black: 90#(or (= ~v_assert~0 1) (= ~v_assert~0 0)), Black: 488#(and (or (< 0 (+ ~pos~0 1)) (= ~d1~0 0)) (or (= ~d1~0 1) (= ~d1~0 0))), Black: 144#(= ~v_assert~0 1), 263#(and (<= 2 ~pos~0) (= ~v_assert~0 1)), Black: 94#(and (= ~pos~0 0) (= ~v_assert~0 1)), Black: 480#(and (or (= ~d1~0 1) (= ~d1~0 0)) (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 261#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 5#L89true, Black: 286#(or (= ~d1~0 1) (= ~d1~0 0)), 25#L60-1true, Black: 476#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), 15#L43-2true, 506#true, Black: 51#(<= 0 ~pos~0), Black: 501#(= (mod ~d2~0 256) 0), Black: 499#true, 13#L69-1true, 502#(and (<= (div ~d2~0 256) 0) (<= 1 ~d2~0)), Black: 58#true]) [2024-11-22 13:47:27,777 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-11-22 13:47:27,777 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-22 13:47:27,778 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-22 13:47:27,778 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-22 13:47:28,013 INFO L124 PetriNetUnfolderBase]: 1770/4013 cut-off events. [2024-11-22 13:47:28,013 INFO L125 PetriNetUnfolderBase]: For 10751/11335 co-relation queries the response was YES. [2024-11-22 13:47:28,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13943 conditions, 4013 events. 1770/4013 cut-off events. For 10751/11335 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 30765 event pairs, 490 based on Foata normal form. 304/4006 useless extension candidates. Maximal degree in co-relation 11947. Up to 989 conditions per place. [2024-11-22 13:47:28,037 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 62 selfloop transitions, 7 changer transitions 0/117 dead transitions. [2024-11-22 13:47:28,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 117 transitions, 933 flow [2024-11-22 13:47:28,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 13:47:28,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 13:47:28,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2024-11-22 13:47:28,039 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.75 [2024-11-22 13:47:28,039 INFO L175 Difference]: Start difference. First operand has 74 places, 94 transitions, 695 flow. Second operand 4 states and 120 transitions. [2024-11-22 13:47:28,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 117 transitions, 933 flow [2024-11-22 13:47:28,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 117 transitions, 929 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-11-22 13:47:28,052 INFO L231 Difference]: Finished difference. Result has 79 places, 96 transitions, 746 flow [2024-11-22 13:47:28,052 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=746, PETRI_PLACES=79, PETRI_TRANSITIONS=96} [2024-11-22 13:47:28,053 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 37 predicate places. [2024-11-22 13:47:28,053 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 96 transitions, 746 flow [2024-11-22 13:47:28,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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-22 13:47:28,053 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:47:28,053 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 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-22 13:47:28,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 13:47:28,053 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-22 13:47:28,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:47:28,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1513236886, now seen corresponding path program 1 times [2024-11-22 13:47:28,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:47:28,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674537928] [2024-11-22 13:47:28,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:47:28,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:47:28,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:47:28,160 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:47:28,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:47:28,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674537928] [2024-11-22 13:47:28,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674537928] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:47:28,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964287475] [2024-11-22 13:47:28,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:47:28,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:47:28,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:47:28,164 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 13:47:28,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-22 13:47:28,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:47:28,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-22 13:47:28,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:47:28,306 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:47:28,306 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:47:28,381 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:47:28,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964287475] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 13:47:28,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 13:47:28,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 7] total 12 [2024-11-22 13:47:28,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661218754] [2024-11-22 13:47:28,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 13:47:28,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-22 13:47:28,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:47:28,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-22 13:47:28,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-22 13:47:28,403 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 40 [2024-11-22 13:47:28,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 96 transitions, 746 flow. Second operand has 12 states, 12 states have (on average 16.25) internal successors, (195), 12 states have internal predecessors, (195), 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-22 13:47:28,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:47:28,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 40 [2024-11-22 13:47:28,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:47:30,039 INFO L124 PetriNetUnfolderBase]: 9539/16915 cut-off events. [2024-11-22 13:47:30,040 INFO L125 PetriNetUnfolderBase]: For 57092/57132 co-relation queries the response was YES. [2024-11-22 13:47:30,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65666 conditions, 16915 events. 9539/16915 cut-off events. For 57092/57132 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 127805 event pairs, 909 based on Foata normal form. 336/17169 useless extension candidates. Maximal degree in co-relation 59977. Up to 3336 conditions per place. [2024-11-22 13:47:30,123 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 102 selfloop transitions, 64 changer transitions 152/331 dead transitions. [2024-11-22 13:47:30,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 331 transitions, 3106 flow [2024-11-22 13:47:30,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-22 13:47:30,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-22 13:47:30,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 352 transitions. [2024-11-22 13:47:30,125 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.55 [2024-11-22 13:47:30,125 INFO L175 Difference]: Start difference. First operand has 79 places, 96 transitions, 746 flow. Second operand 16 states and 352 transitions. [2024-11-22 13:47:30,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 331 transitions, 3106 flow [2024-11-22 13:47:30,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 331 transitions, 3106 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-22 13:47:30,198 INFO L231 Difference]: Finished difference. Result has 103 places, 118 transitions, 1229 flow [2024-11-22 13:47:30,199 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1229, PETRI_PLACES=103, PETRI_TRANSITIONS=118} [2024-11-22 13:47:30,200 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 61 predicate places. [2024-11-22 13:47:30,200 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 118 transitions, 1229 flow [2024-11-22 13:47:30,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 16.25) internal successors, (195), 12 states have internal predecessors, (195), 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-22 13:47:30,201 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:47:30,201 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 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-22 13:47:30,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-22 13:47:30,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:47:30,402 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-22 13:47:30,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:47:30,402 INFO L85 PathProgramCache]: Analyzing trace with hash 179919222, now seen corresponding path program 2 times [2024-11-22 13:47:30,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:47:30,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580954191] [2024-11-22 13:47:30,403 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 13:47:30,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:47:30,422 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 13:47:30,422 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:47:30,548 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:47:30,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:47:30,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580954191] [2024-11-22 13:47:30,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580954191] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:47:30,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58137793] [2024-11-22 13:47:30,549 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 13:47:30,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:47:30,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:47:30,551 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 13:47:30,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-22 13:47:30,599 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 13:47:30,600 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:47:30,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-22 13:47:30,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:47:30,848 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:47:30,849 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:47:30,939 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:47:30,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58137793] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 13:47:30,939 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 13:47:30,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 8] total 13 [2024-11-22 13:47:30,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255270241] [2024-11-22 13:47:30,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 13:47:30,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-22 13:47:30,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:47:30,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-22 13:47:30,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-11-22 13:47:30,996 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-11-22 13:47:30,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 118 transitions, 1229 flow. Second operand has 13 states, 13 states have (on average 15.846153846153847) internal successors, (206), 13 states have internal predecessors, (206), 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-22 13:47:30,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:47:30,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-11-22 13:47:30,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:47:32,283 INFO L124 PetriNetUnfolderBase]: 7838/13348 cut-off events. [2024-11-22 13:47:32,283 INFO L125 PetriNetUnfolderBase]: For 84669/84677 co-relation queries the response was YES. [2024-11-22 13:47:32,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58860 conditions, 13348 events. 7838/13348 cut-off events. For 84669/84677 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 91197 event pairs, 653 based on Foata normal form. 416/13742 useless extension candidates. Maximal degree in co-relation 58827. Up to 4744 conditions per place. [2024-11-22 13:47:32,453 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 0 selfloop transitions, 0 changer transitions 253/253 dead transitions. [2024-11-22 13:47:32,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 253 transitions, 2943 flow [2024-11-22 13:47:32,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 13:47:32,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-22 13:47:32,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 263 transitions. [2024-11-22 13:47:32,457 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5057692307692307 [2024-11-22 13:47:32,457 INFO L175 Difference]: Start difference. First operand has 103 places, 118 transitions, 1229 flow. Second operand 13 states and 263 transitions. [2024-11-22 13:47:32,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 253 transitions, 2943 flow [2024-11-22 13:47:32,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 253 transitions, 2759 flow, removed 32 selfloop flow, removed 12 redundant places. [2024-11-22 13:47:32,553 INFO L231 Difference]: Finished difference. Result has 92 places, 0 transitions, 0 flow [2024-11-22 13:47:32,553 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1055, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=0, PETRI_PLACES=92, PETRI_TRANSITIONS=0} [2024-11-22 13:47:32,554 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 50 predicate places. [2024-11-22 13:47:32,554 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 0 transitions, 0 flow [2024-11-22 13:47:32,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 15.846153846153847) internal successors, (206), 13 states have internal predecessors, (206), 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-22 13:47:32,556 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2024-11-22 13:47:32,557 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2024-11-22 13:47:32,557 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-11-22 13:47:32,557 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-11-22 13:47:32,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-22 13:47:32,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:47:32,758 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1] [2024-11-22 13:47:32,760 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-22 13:47:32,760 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 13:47:32,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 01:47:32 BasicIcfg [2024-11-22 13:47:32,765 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 13:47:32,765 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 13:47:32,765 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 13:47:32,765 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 13:47:32,766 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:47:22" (3/4) ... [2024-11-22 13:47:32,767 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-22 13:47:32,770 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-22 13:47:32,770 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-22 13:47:32,770 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-22 13:47:32,773 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 49 nodes and edges [2024-11-22 13:47:32,774 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-22 13:47:32,774 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-22 13:47:32,774 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-22 13:47:32,840 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-22 13:47:32,840 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-22 13:47:32,842 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 13:47:32,842 INFO L158 Benchmark]: Toolchain (without parser) took 11502.26ms. Allocated memory was 188.7MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 121.0MB in the beginning and 746.6MB in the end (delta: -625.5MB). Peak memory consumption was 379.9MB. Max. memory is 16.1GB. [2024-11-22 13:47:32,843 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 104.9MB. Free memory is still 66.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 13:47:32,843 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.87ms. Allocated memory is still 188.7MB. Free memory was 120.9MB in the beginning and 107.5MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-22 13:47:32,843 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.40ms. Allocated memory is still 188.7MB. Free memory was 107.5MB in the beginning and 106.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 13:47:32,843 INFO L158 Benchmark]: Boogie Preprocessor took 32.99ms. Allocated memory is still 188.7MB. Free memory was 106.0MB in the beginning and 103.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 13:47:32,843 INFO L158 Benchmark]: RCFGBuilder took 381.51ms. Allocated memory is still 188.7MB. Free memory was 103.9MB in the beginning and 142.1MB in the end (delta: -38.2MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. [2024-11-22 13:47:32,844 INFO L158 Benchmark]: TraceAbstraction took 10755.51ms. Allocated memory was 188.7MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 141.3MB in the beginning and 750.9MB in the end (delta: -609.6MB). Peak memory consumption was 716.7MB. Max. memory is 16.1GB. [2024-11-22 13:47:32,844 INFO L158 Benchmark]: Witness Printer took 77.06ms. Allocated memory is still 1.2GB. Free memory was 750.9MB in the beginning and 746.6MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 13:47:32,845 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.15ms. Allocated memory is still 104.9MB. Free memory is still 66.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 223.87ms. Allocated memory is still 188.7MB. Free memory was 120.9MB in the beginning and 107.5MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.40ms. Allocated memory is still 188.7MB. Free memory was 107.5MB in the beginning and 106.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.99ms. Allocated memory is still 188.7MB. Free memory was 106.0MB in the beginning and 103.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 381.51ms. Allocated memory is still 188.7MB. Free memory was 103.9MB in the beginning and 142.1MB in the end (delta: -38.2MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. * TraceAbstraction took 10755.51ms. Allocated memory was 188.7MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 141.3MB in the beginning and 750.9MB in the end (delta: -609.6MB). Peak memory consumption was 716.7MB. Max. memory is 16.1GB. * Witness Printer took 77.06ms. Allocated memory is still 1.2GB. Free memory was 750.9MB in the beginning and 746.6MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 93]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 60 locations, 4 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: 10.7s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 756 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 720 mSDsluCounter, 194 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 151 mSDsCounter, 102 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1804 IncrementalHoareTripleChecker+Invalid, 1906 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 102 mSolverCounterUnsat, 43 mSDtfsCounter, 1804 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 370 GetRequests, 267 SyntacticMatches, 16 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1229occurred in iteration=9, InterpolantAutomatonStates: 74, 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.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 452 NumberOfCodeBlocks, 452 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 576 ConstructedInterpolants, 0 QuantifiedInterpolants, 1736 SizeOfPredicates, 23 NumberOfNonLiveVariables, 644 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 67/119 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-22 13:47:32,858 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 Result: TRUE