./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 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-3061b6d-m [2024-11-19 01:48:06,610 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:48:06,711 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 01:48:06,715 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:48:06,717 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:48:06,738 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:48:06,739 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:48:06,739 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:48:06,739 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:48:06,740 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:48:06,740 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:48:06,741 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:48:06,741 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:48:06,742 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:48:06,742 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:48:06,742 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:48:06,743 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:48:06,743 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:48:06,744 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 01:48:06,744 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:48:06,744 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:48:06,745 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:48:06,745 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:48:06,746 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:48:06,746 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:48:06,746 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:48:06,747 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:48:06,747 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:48:06,748 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:48:06,748 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:48:06,748 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:48:06,748 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:48:06,749 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:48:06,749 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:48:06,749 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:48:06,750 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:48:06,750 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 01:48:06,750 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 01:48:06,750 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:48:06,751 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:48:06,751 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:48:06,752 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:48:06,752 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-19 01:48:07,020 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:48:07,046 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:48:07,049 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:48:07,050 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:48:07,050 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:48:07,052 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-19 01:48:08,526 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:48:08,717 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:48:08,718 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-4.wvr.c [2024-11-19 01:48:08,726 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6d98e4d0/37a23dd799694e87884cce3218647887/FLAGcd773b350 [2024-11-19 01:48:09,116 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6d98e4d0/37a23dd799694e87884cce3218647887 [2024-11-19 01:48:09,118 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:48:09,119 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:48:09,120 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:48:09,121 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:48:09,126 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:48:09,127 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:48:09" (1/1) ... [2024-11-19 01:48:09,130 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15fec619 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:48:09, skipping insertion in model container [2024-11-19 01:48:09,130 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:48:09" (1/1) ... [2024-11-19 01:48:09,153 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:48:09,370 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-19 01:48:09,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:48:09,399 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:48:09,422 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-19 01:48:09,422 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:48:09,443 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:48:09,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:48:09 WrapperNode [2024-11-19 01:48:09,444 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:48:09,445 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:48:09,445 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:48:09,445 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:48:09,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:48:09" (1/1) ... [2024-11-19 01:48:09,460 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:48:09" (1/1) ... [2024-11-19 01:48:09,477 INFO L138 Inliner]: procedures = 19, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 61 [2024-11-19 01:48:09,477 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:48:09,478 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:48:09,478 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:48:09,478 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:48:09,490 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:48:09" (1/1) ... [2024-11-19 01:48:09,491 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:48:09" (1/1) ... [2024-11-19 01:48:09,493 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:48:09" (1/1) ... [2024-11-19 01:48:09,506 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-19 01:48:09,506 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:48:09" (1/1) ... [2024-11-19 01:48:09,507 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:48:09" (1/1) ... [2024-11-19 01:48:09,511 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:48:09" (1/1) ... [2024-11-19 01:48:09,515 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:48:09" (1/1) ... [2024-11-19 01:48:09,516 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:48:09" (1/1) ... [2024-11-19 01:48:09,517 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:48:09" (1/1) ... [2024-11-19 01:48:09,519 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:48:09,523 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:48:09,523 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:48:09,524 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:48:09,525 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:48:09" (1/1) ... [2024-11-19 01:48:09,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:48:09,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:48:09,571 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-19 01:48:09,575 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-19 01:48:09,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:48:09,632 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-19 01:48:09,633 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-19 01:48:09,635 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-19 01:48:09,635 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-19 01:48:09,636 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-19 01:48:09,636 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-19 01:48:09,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 01:48:09,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:48:09,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:48:09,638 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 01:48:09,735 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:48:09,736 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:48:09,897 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 01:48:09,897 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:48:09,993 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:48:09,994 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 01:48:09,994 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:48:09 BoogieIcfgContainer [2024-11-19 01:48:09,994 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:48:09,996 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:48:09,996 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:48:10,000 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:48:10,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:48:09" (1/3) ... [2024-11-19 01:48:10,003 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@692806e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:48:10, skipping insertion in model container [2024-11-19 01:48:10,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:48:09" (2/3) ... [2024-11-19 01:48:10,004 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@692806e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:48:10, skipping insertion in model container [2024-11-19 01:48:10,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:48:09" (3/3) ... [2024-11-19 01:48:10,005 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-4.wvr.c [2024-11-19 01:48:10,020 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:48:10,020 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 01:48:10,021 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 01:48:10,064 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-19 01:48:10,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 40 transitions, 101 flow [2024-11-19 01:48:10,131 INFO L124 PetriNetUnfolderBase]: 4/37 cut-off events. [2024-11-19 01:48:10,131 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-19 01:48:10,134 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-19 01:48:10,135 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 40 transitions, 101 flow [2024-11-19 01:48:10,138 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 36 transitions, 90 flow [2024-11-19 01:48:10,146 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:48:10,153 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;@3554ddfe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:48:10,154 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-19 01:48:10,169 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 01:48:10,169 INFO L124 PetriNetUnfolderBase]: 4/35 cut-off events. [2024-11-19 01:48:10,169 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-19 01:48:10,170 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:48:10,170 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-19 01:48:10,171 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-19 01:48:10,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:48:10,176 INFO L85 PathProgramCache]: Analyzing trace with hash 2082292765, now seen corresponding path program 1 times [2024-11-19 01:48:10,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:48:10,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781008984] [2024-11-19 01:48:10,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:48:10,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:48:10,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:48:10,760 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-19 01:48:10,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:48:10,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781008984] [2024-11-19 01:48:10,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781008984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:48:10,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:48:10,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:48:10,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015985610] [2024-11-19 01:48:10,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:48:10,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:48:10,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:48:10,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:48:10,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:48:10,840 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 40 [2024-11-19 01:48:10,842 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-19 01:48:10,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:48:10,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 40 [2024-11-19 01:48:10,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:48:11,149 INFO L124 PetriNetUnfolderBase]: 476/948 cut-off events. [2024-11-19 01:48:11,149 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2024-11-19 01:48:11,156 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-19 01:48:11,162 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 39 selfloop transitions, 8 changer transitions 1/63 dead transitions. [2024-11-19 01:48:11,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 63 transitions, 264 flow [2024-11-19 01:48:11,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:48:11,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 01:48:11,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 142 transitions. [2024-11-19 01:48:11,178 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.71 [2024-11-19 01:48:11,180 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 90 flow. Second operand 5 states and 142 transitions. [2024-11-19 01:48:11,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 63 transitions, 264 flow [2024-11-19 01:48:11,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 63 transitions, 236 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-19 01:48:11,190 INFO L231 Difference]: Finished difference. Result has 43 places, 41 transitions, 133 flow [2024-11-19 01:48:11,194 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-19 01:48:11,198 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2024-11-19 01:48:11,200 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 41 transitions, 133 flow [2024-11-19 01:48:11,201 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-19 01:48:11,201 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:48:11,201 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-19 01:48:11,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 01:48:11,201 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-19 01:48:11,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:48:11,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1830736969, now seen corresponding path program 2 times [2024-11-19 01:48:11,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:48:11,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626729817] [2024-11-19 01:48:11,203 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 01:48:11,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:48:11,225 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 01:48:11,225 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:48:11,290 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-19 01:48:11,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:48:11,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626729817] [2024-11-19 01:48:11,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626729817] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:48:11,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:48:11,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:48:11,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053137215] [2024-11-19 01:48:11,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:48:11,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:48:11,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:48:11,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:48:11,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:48:11,302 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 40 [2024-11-19 01:48:11,303 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-19 01:48:11,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:48:11,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 40 [2024-11-19 01:48:11,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:48:11,434 INFO L124 PetriNetUnfolderBase]: 632/1186 cut-off events. [2024-11-19 01:48:11,434 INFO L125 PetriNetUnfolderBase]: For 844/844 co-relation queries the response was YES. [2024-11-19 01:48:11,439 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-19 01:48:11,445 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 26 selfloop transitions, 5 changer transitions 1/49 dead transitions. [2024-11-19 01:48:11,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 49 transitions, 222 flow [2024-11-19 01:48:11,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:48:11,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 01:48:11,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2024-11-19 01:48:11,447 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7 [2024-11-19 01:48:11,447 INFO L175 Difference]: Start difference. First operand has 43 places, 41 transitions, 133 flow. Second operand 3 states and 84 transitions. [2024-11-19 01:48:11,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 49 transitions, 222 flow [2024-11-19 01:48:11,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 49 transitions, 217 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 01:48:11,451 INFO L231 Difference]: Finished difference. Result has 46 places, 43 transitions, 160 flow [2024-11-19 01:48:11,451 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-19 01:48:11,452 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2024-11-19 01:48:11,452 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 43 transitions, 160 flow [2024-11-19 01:48:11,453 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-19 01:48:11,453 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:48:11,453 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:48:11,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 01:48:11,453 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-19 01:48:11,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:48:11,454 INFO L85 PathProgramCache]: Analyzing trace with hash 376448579, now seen corresponding path program 1 times [2024-11-19 01:48:11,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:48:11,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974302005] [2024-11-19 01:48:11,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:48:11,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:48:11,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:48:11,535 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-19 01:48:11,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:48:11,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974302005] [2024-11-19 01:48:11,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974302005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:48:11,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:48:11,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:48:11,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835380487] [2024-11-19 01:48:11,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:48:11,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:48:11,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:48:11,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:48:11,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:48:11,546 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 40 [2024-11-19 01:48:11,546 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-19 01:48:11,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:48:11,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 40 [2024-11-19 01:48:11,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:48:11,744 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-19 01:48:11,745 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-11-19 01:48:11,745 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 01:48:11,746 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 01:48:11,746 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-19 01:48:11,746 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-19 01:48:11,746 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-19 01:48:11,746 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 01:48:11,746 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 01:48:11,746 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 01:48:11,747 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-19 01:48:11,747 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-19 01:48:11,747 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 01:48:11,748 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 01:48:11,748 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 01:48:11,762 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-19 01:48:11,762 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-19 01:48:11,763 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 01:48:11,763 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 01:48:11,763 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 01:48:11,764 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-19 01:48:11,764 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-19 01:48:11,764 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 01:48:11,764 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 01:48:11,764 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 01:48:11,766 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-19 01:48:11,766 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-19 01:48:11,766 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 01:48:11,766 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 01:48:11,766 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 01:48:11,767 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-19 01:48:11,767 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-19 01:48:11,767 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 01:48:11,767 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 01:48:11,768 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 01:48:11,768 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-19 01:48:11,768 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-19 01:48:11,768 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 01:48:11,768 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 01:48:11,768 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 01:48:11,768 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-19 01:48:11,769 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-19 01:48:11,769 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 01:48:11,769 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 01:48:11,769 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 01:48:11,777 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-19 01:48:11,778 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-11-19 01:48:11,778 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 01:48:11,778 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-19 01:48:11,778 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 01:48:11,778 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-19 01:48:11,779 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-19 01:48:11,779 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 01:48:11,779 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 01:48:11,779 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 01:48:11,779 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-19 01:48:11,779 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-19 01:48:11,780 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 01:48:11,780 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 01:48:11,780 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 01:48:11,784 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-19 01:48:11,784 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-19 01:48:11,784 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 01:48:11,784 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 01:48:11,784 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 01:48:11,785 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-19 01:48:11,785 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-19 01:48:11,785 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 01:48:11,785 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 01:48:11,785 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 01:48:11,785 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-19 01:48:11,785 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-19 01:48:11,786 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 01:48:11,786 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 01:48:11,786 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 01:48:11,789 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-19 01:48:11,789 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-19 01:48:11,789 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 01:48:11,789 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 01:48:11,789 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 01:48:11,789 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-19 01:48:11,790 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-19 01:48:11,820 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-19 01:48:11,820 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 01:48:11,820 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 01:48:11,820 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 01:48:11,821 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-19 01:48:11,821 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-19 01:48:11,821 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 01:48:11,821 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 01:48:11,821 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 01:48:11,822 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-19 01:48:11,822 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-19 01:48:11,822 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 01:48:11,822 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 01:48:11,822 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 01:48:11,823 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-19 01:48:11,823 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-19 01:48:11,823 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 01:48:11,823 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 01:48:11,824 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 01:48:11,824 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-19 01:48:11,824 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-19 01:48:11,824 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 01:48:11,824 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 01:48:11,825 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 01:48:11,829 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-19 01:48:11,829 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-19 01:48:11,830 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 01:48:11,830 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 01:48:11,830 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 01:48:11,830 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-19 01:48:11,831 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-19 01:48:11,831 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 01:48:11,831 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 01:48:11,832 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 01:48:11,832 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-19 01:48:11,832 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-19 01:48:11,832 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 01:48:11,832 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 01:48:11,833 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 01:48:11,833 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-19 01:48:11,836 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-19 01:48:11,836 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-19 01:48:11,836 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 01:48:11,839 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 01:48:11,839 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-19 01:48:11,839 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 01:48:11,840 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-19 01:48:11,840 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-19 01:48:11,840 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 01:48:11,841 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-19 01:48:11,841 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 01:48:11,841 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 01:48:11,841 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-19 01:48:11,842 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-19 01:48:11,842 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 01:48:11,842 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 01:48:11,842 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 01:48:11,842 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-19 01:48:11,842 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-19 01:48:11,843 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 01:48:11,843 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 01:48:11,843 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 01:48:11,844 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-19 01:48:11,844 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-19 01:48:11,844 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 01:48:11,844 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 01:48:11,844 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 01:48:11,844 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-19 01:48:11,845 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-19 01:48:11,845 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-19 01:48:11,845 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-19 01:48:11,845 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 01:48:11,846 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 01:48:11,846 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 01:48:11,848 INFO L124 PetriNetUnfolderBase]: 1341/2305 cut-off events. [2024-11-19 01:48:11,848 INFO L125 PetriNetUnfolderBase]: For 1737/1793 co-relation queries the response was YES. [2024-11-19 01:48:11,857 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-19 01:48:11,873 INFO L140 encePairwiseOnDemand]: 36/40 looper letters, 34 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2024-11-19 01:48:11,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 58 transitions, 290 flow [2024-11-19 01:48:11,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:48:11,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 01:48:11,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2024-11-19 01:48:11,875 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7583333333333333 [2024-11-19 01:48:11,875 INFO L175 Difference]: Start difference. First operand has 46 places, 43 transitions, 160 flow. Second operand 3 states and 91 transitions. [2024-11-19 01:48:11,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 58 transitions, 290 flow [2024-11-19 01:48:11,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 58 transitions, 280 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 01:48:11,885 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 172 flow [2024-11-19 01:48:11,885 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-19 01:48:11,887 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 6 predicate places. [2024-11-19 01:48:11,888 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 172 flow [2024-11-19 01:48:11,888 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-19 01:48:11,888 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:48:11,888 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-19 01:48:11,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 01:48:11,889 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-19 01:48:11,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:48:11,891 INFO L85 PathProgramCache]: Analyzing trace with hash 282541655, now seen corresponding path program 1 times [2024-11-19 01:48:11,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:48:11,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5710728] [2024-11-19 01:48:11,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:48:11,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:48:11,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:48:11,975 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-19 01:48:11,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:48:11,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5710728] [2024-11-19 01:48:11,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5710728] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:48:11,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:48:11,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:48:11,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886625953] [2024-11-19 01:48:11,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:48:11,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:48:11,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:48:11,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:48:11,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:48:11,986 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 40 [2024-11-19 01:48:11,987 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-19 01:48:11,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:48:11,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 40 [2024-11-19 01:48:11,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:48:12,155 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-19 01:48:12,155 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-19 01:48:12,155 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 01:48:12,155 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 01:48:12,155 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 01:48:12,165 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-19 01:48:12,166 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-11-19 01:48:12,166 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 01:48:12,166 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 01:48:12,166 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 01:48:12,175 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-19 01:48:12,175 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-19 01:48:12,175 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-19 01:48:12,175 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 01:48:12,175 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 01:48:12,179 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-19 01:48:12,179 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-19 01:48:12,179 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-19 01:48:12,179 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 01:48:12,179 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 01:48:12,188 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-19 01:48:12,189 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-19 01:48:12,189 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-19 01:48:12,189 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 01:48:12,189 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-19 01:48:12,198 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-19 01:48:12,198 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-11-19 01:48:12,199 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-19 01:48:12,199 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-19 01:48:12,199 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-19 01:48:12,204 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-19 01:48:12,204 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-11-19 01:48:12,204 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 01:48:12,204 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 01:48:12,204 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-19 01:48:12,205 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-19 01:48:12,205 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-11-19 01:48:12,205 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 01:48:12,205 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-19 01:48:12,205 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-19 01:48:12,206 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-19 01:48:12,208 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-11-19 01:48:12,208 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-19 01:48:12,209 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 01:48:12,209 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 01:48:12,209 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-19 01:48:12,210 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-19 01:48:12,210 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-11-19 01:48:12,210 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-19 01:48:12,210 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 01:48:12,210 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 01:48:12,210 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-19 01:48:12,211 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-19 01:48:12,213 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-19 01:48:12,213 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-19 01:48:12,213 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 01:48:12,213 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-19 01:48:12,213 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 01:48:12,213 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-19 01:48:12,214 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-19 01:48:12,214 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-19 01:48:12,214 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 01:48:12,214 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 01:48:12,214 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-19 01:48:12,214 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 01:48:12,214 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-19 01:48:12,266 INFO L124 PetriNetUnfolderBase]: 1000/2000 cut-off events. [2024-11-19 01:48:12,266 INFO L125 PetriNetUnfolderBase]: For 1078/1185 co-relation queries the response was YES. [2024-11-19 01:48:12,284 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-19 01:48:12,294 INFO L140 encePairwiseOnDemand]: 36/40 looper letters, 32 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2024-11-19 01:48:12,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 58 transitions, 285 flow [2024-11-19 01:48:12,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:48:12,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 01:48:12,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2024-11-19 01:48:12,297 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7583333333333333 [2024-11-19 01:48:12,299 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 172 flow. Second operand 3 states and 91 transitions. [2024-11-19 01:48:12,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 58 transitions, 285 flow [2024-11-19 01:48:12,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 58 transitions, 279 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 01:48:12,305 INFO L231 Difference]: Finished difference. Result has 50 places, 47 transitions, 188 flow [2024-11-19 01:48:12,305 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-19 01:48:12,306 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2024-11-19 01:48:12,306 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 47 transitions, 188 flow [2024-11-19 01:48:12,306 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-19 01:48:12,306 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:48:12,307 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-19 01:48:12,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 01:48:12,308 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-19 01:48:12,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:48:12,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1884612495, now seen corresponding path program 1 times [2024-11-19 01:48:12,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:48:12,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303661073] [2024-11-19 01:48:12,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:48:12,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:48:12,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:48:12,476 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-19 01:48:12,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:48:12,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303661073] [2024-11-19 01:48:12,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303661073] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:48:12,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048745450] [2024-11-19 01:48:12,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:48:12,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:48:12,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:48:12,481 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-19 01:48:12,483 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-19 01:48:12,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:48:12,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 01:48:12,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:48:12,750 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-19 01:48:12,750 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:48:12,851 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-19 01:48:12,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048745450] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:48:12,851 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 01:48:12,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 6] total 11 [2024-11-19 01:48:12,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647138139] [2024-11-19 01:48:12,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 01:48:12,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 01:48:12,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:48:12,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 01:48:12,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-19 01:48:12,869 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2024-11-19 01:48:12,870 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-19 01:48:12,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:48:12,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2024-11-19 01:48:12,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:48:13,553 INFO L124 PetriNetUnfolderBase]: 3111/5708 cut-off events. [2024-11-19 01:48:13,553 INFO L125 PetriNetUnfolderBase]: For 4521/4565 co-relation queries the response was YES. [2024-11-19 01:48:13,570 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-19 01:48:13,586 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 55 selfloop transitions, 20 changer transitions 22/113 dead transitions. [2024-11-19 01:48:13,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 113 transitions, 625 flow [2024-11-19 01:48:13,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 01:48:13,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-19 01:48:13,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 222 transitions. [2024-11-19 01:48:13,588 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6166666666666667 [2024-11-19 01:48:13,589 INFO L175 Difference]: Start difference. First operand has 50 places, 47 transitions, 188 flow. Second operand 9 states and 222 transitions. [2024-11-19 01:48:13,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 113 transitions, 625 flow [2024-11-19 01:48:13,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 113 transitions, 619 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 01:48:13,598 INFO L231 Difference]: Finished difference. Result has 62 places, 60 transitions, 359 flow [2024-11-19 01:48:13,598 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-19 01:48:13,599 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 20 predicate places. [2024-11-19 01:48:13,599 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 60 transitions, 359 flow [2024-11-19 01:48:13,600 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-19 01:48:13,600 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:48:13,600 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-19 01:48:13,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 01:48:13,801 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-19 01:48:13,801 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-19 01:48:13,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:48:13,802 INFO L85 PathProgramCache]: Analyzing trace with hash -644573438, now seen corresponding path program 1 times [2024-11-19 01:48:13,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:48:13,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985761364] [2024-11-19 01:48:13,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:48:13,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:48:13,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:48:14,069 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-19 01:48:14,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:48:14,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985761364] [2024-11-19 01:48:14,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985761364] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:48:14,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197278677] [2024-11-19 01:48:14,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:48:14,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:48:14,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:48:14,073 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-19 01:48:14,075 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-19 01:48:14,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:48:14,146 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 01:48:14,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:48:14,275 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-19 01:48:14,275 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:48:14,367 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-19 01:48:14,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197278677] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:48:14,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 01:48:14,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 6] total 11 [2024-11-19 01:48:14,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277998991] [2024-11-19 01:48:14,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 01:48:14,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 01:48:14,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:48:14,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 01:48:14,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-19 01:48:14,403 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 40 [2024-11-19 01:48:14,404 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-19 01:48:14,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:48:14,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 40 [2024-11-19 01:48:14,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:48:15,946 INFO L124 PetriNetUnfolderBase]: 7057/11833 cut-off events. [2024-11-19 01:48:15,946 INFO L125 PetriNetUnfolderBase]: For 26761/26761 co-relation queries the response was YES. [2024-11-19 01:48:15,981 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-19 01:48:16,028 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 94 selfloop transitions, 43 changer transitions 87/235 dead transitions. [2024-11-19 01:48:16,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 235 transitions, 1890 flow [2024-11-19 01:48:16,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 01:48:16,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-19 01:48:16,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 311 transitions. [2024-11-19 01:48:16,030 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5553571428571429 [2024-11-19 01:48:16,030 INFO L175 Difference]: Start difference. First operand has 62 places, 60 transitions, 359 flow. Second operand 14 states and 311 transitions. [2024-11-19 01:48:16,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 235 transitions, 1890 flow [2024-11-19 01:48:16,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 235 transitions, 1663 flow, removed 112 selfloop flow, removed 3 redundant places. [2024-11-19 01:48:16,097 INFO L231 Difference]: Finished difference. Result has 78 places, 92 transitions, 737 flow [2024-11-19 01:48:16,097 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-19 01:48:16,098 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 36 predicate places. [2024-11-19 01:48:16,098 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 92 transitions, 737 flow [2024-11-19 01:48:16,098 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-19 01:48:16,099 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:48:16,099 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-19 01:48:16,119 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-19 01:48:16,299 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-19 01:48:16,300 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-19 01:48:16,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:48:16,301 INFO L85 PathProgramCache]: Analyzing trace with hash -632709205, now seen corresponding path program 2 times [2024-11-19 01:48:16,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:48:16,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284380087] [2024-11-19 01:48:16,302 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 01:48:16,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:48:16,348 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 01:48:16,348 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:48:16,510 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-19 01:48:16,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:48:16,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284380087] [2024-11-19 01:48:16,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284380087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:48:16,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:48:16,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:48:16,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266227415] [2024-11-19 01:48:16,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:48:16,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:48:16,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:48:16,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:48:16,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:48:16,518 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 40 [2024-11-19 01:48:16,519 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-19 01:48:16,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:48:16,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 40 [2024-11-19 01:48:16,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:48:17,279 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-19 01:48:17,280 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2024-11-19 01:48:17,280 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:48:17,280 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:48:17,280 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-11-19 01:48:17,289 INFO L124 PetriNetUnfolderBase]: 3481/6287 cut-off events. [2024-11-19 01:48:17,289 INFO L125 PetriNetUnfolderBase]: For 23976/24502 co-relation queries the response was YES. [2024-11-19 01:48:17,317 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-19 01:48:17,352 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 89 selfloop transitions, 5 changer transitions 0/142 dead transitions. [2024-11-19 01:48:17,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 142 transitions, 1340 flow [2024-11-19 01:48:17,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:48:17,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 01:48:17,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2024-11-19 01:48:17,353 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.775 [2024-11-19 01:48:17,353 INFO L175 Difference]: Start difference. First operand has 78 places, 92 transitions, 737 flow. Second operand 4 states and 124 transitions. [2024-11-19 01:48:17,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 142 transitions, 1340 flow [2024-11-19 01:48:17,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 142 transitions, 1188 flow, removed 73 selfloop flow, removed 6 redundant places. [2024-11-19 01:48:17,402 INFO L231 Difference]: Finished difference. Result has 74 places, 94 transitions, 695 flow [2024-11-19 01:48:17,402 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-19 01:48:17,403 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 32 predicate places. [2024-11-19 01:48:17,403 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 94 transitions, 695 flow [2024-11-19 01:48:17,403 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-19 01:48:17,404 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:48:17,404 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-19 01:48:17,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 01:48:17,404 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-19 01:48:17,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:48:17,405 INFO L85 PathProgramCache]: Analyzing trace with hash 263810358, now seen corresponding path program 2 times [2024-11-19 01:48:17,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:48:17,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091177729] [2024-11-19 01:48:17,405 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 01:48:17,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:48:17,429 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 01:48:17,430 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:48:17,579 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-19 01:48:17,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:48:17,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091177729] [2024-11-19 01:48:17,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091177729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:48:17,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:48:17,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:48:17,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825047133] [2024-11-19 01:48:17,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:48:17,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:48:17,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:48:17,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:48:17,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:48:17,594 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 40 [2024-11-19 01:48:17,594 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-19 01:48:17,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:48:17,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 40 [2024-11-19 01:48:17,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:48:17,662 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-19 01:48:17,663 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-11-19 01:48:17,663 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-19 01:48:17,663 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-19 01:48:17,663 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-19 01:48:17,735 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-19 01:48:17,735 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-11-19 01:48:17,735 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-19 01:48:17,735 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 01:48:17,735 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 01:48:17,766 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-19 01:48:17,766 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-11-19 01:48:17,766 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-19 01:48:17,766 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-19 01:48:17,766 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-19 01:48:18,015 INFO L124 PetriNetUnfolderBase]: 1770/4013 cut-off events. [2024-11-19 01:48:18,016 INFO L125 PetriNetUnfolderBase]: For 10751/11335 co-relation queries the response was YES. [2024-11-19 01:48:18,036 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-19 01:48:18,053 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 62 selfloop transitions, 7 changer transitions 0/117 dead transitions. [2024-11-19 01:48:18,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 117 transitions, 933 flow [2024-11-19 01:48:18,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:48:18,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 01:48:18,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2024-11-19 01:48:18,054 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.75 [2024-11-19 01:48:18,054 INFO L175 Difference]: Start difference. First operand has 74 places, 94 transitions, 695 flow. Second operand 4 states and 120 transitions. [2024-11-19 01:48:18,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 117 transitions, 933 flow [2024-11-19 01:48:18,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 117 transitions, 929 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-11-19 01:48:18,076 INFO L231 Difference]: Finished difference. Result has 79 places, 96 transitions, 746 flow [2024-11-19 01:48:18,078 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-19 01:48:18,078 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 37 predicate places. [2024-11-19 01:48:18,079 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 96 transitions, 746 flow [2024-11-19 01:48:18,079 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-19 01:48:18,079 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:48:18,079 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-19 01:48:18,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 01:48:18,081 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-19 01:48:18,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:48:18,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1513236886, now seen corresponding path program 1 times [2024-11-19 01:48:18,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:48:18,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741487777] [2024-11-19 01:48:18,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:48:18,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:48:18,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:48:18,279 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-19 01:48:18,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:48:18,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741487777] [2024-11-19 01:48:18,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741487777] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:48:18,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385329252] [2024-11-19 01:48:18,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:48:18,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:48:18,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:48:18,286 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-19 01:48:18,287 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-19 01:48:18,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:48:18,357 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 01:48:18,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:48:18,464 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-19 01:48:18,465 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:48:18,562 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-19 01:48:18,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385329252] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:48:18,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 01:48:18,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 7] total 12 [2024-11-19 01:48:18,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800009230] [2024-11-19 01:48:18,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 01:48:18,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 01:48:18,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:48:18,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 01:48:18,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-19 01:48:18,601 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 40 [2024-11-19 01:48:18,602 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-19 01:48:18,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:48:18,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 40 [2024-11-19 01:48:18,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:48:20,634 INFO L124 PetriNetUnfolderBase]: 9539/16915 cut-off events. [2024-11-19 01:48:20,634 INFO L125 PetriNetUnfolderBase]: For 57092/57132 co-relation queries the response was YES. [2024-11-19 01:48:20,685 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-19 01:48:20,733 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 102 selfloop transitions, 64 changer transitions 152/331 dead transitions. [2024-11-19 01:48:20,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 331 transitions, 3106 flow [2024-11-19 01:48:20,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 01:48:20,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-19 01:48:20,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 352 transitions. [2024-11-19 01:48:20,735 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.55 [2024-11-19 01:48:20,735 INFO L175 Difference]: Start difference. First operand has 79 places, 96 transitions, 746 flow. Second operand 16 states and 352 transitions. [2024-11-19 01:48:20,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 331 transitions, 3106 flow [2024-11-19 01:48:20,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 331 transitions, 3106 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 01:48:20,830 INFO L231 Difference]: Finished difference. Result has 103 places, 118 transitions, 1229 flow [2024-11-19 01:48:20,831 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-19 01:48:20,832 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 61 predicate places. [2024-11-19 01:48:20,832 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 118 transitions, 1229 flow [2024-11-19 01:48:20,833 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-19 01:48:20,834 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:48:20,834 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-19 01:48:20,852 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-19 01:48:21,034 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-19 01:48:21,035 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-19 01:48:21,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:48:21,035 INFO L85 PathProgramCache]: Analyzing trace with hash 179919222, now seen corresponding path program 2 times [2024-11-19 01:48:21,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:48:21,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994695856] [2024-11-19 01:48:21,036 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 01:48:21,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:48:21,059 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 01:48:21,059 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:48:21,337 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-19 01:48:21,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:48:21,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994695856] [2024-11-19 01:48:21,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994695856] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:48:21,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826360530] [2024-11-19 01:48:21,338 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 01:48:21,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:48:21,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:48:21,340 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-19 01:48:21,342 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-19 01:48:21,410 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 01:48:21,411 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:48:21,412 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 01:48:21,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:48:21,558 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-19 01:48:21,558 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:48:21,669 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-19 01:48:21,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826360530] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:48:21,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 01:48:21,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 8] total 13 [2024-11-19 01:48:21,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883217252] [2024-11-19 01:48:21,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 01:48:21,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 01:48:21,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:48:21,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 01:48:21,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-11-19 01:48:21,742 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-11-19 01:48:21,743 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-19 01:48:21,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:48:21,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-11-19 01:48:21,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:48:23,375 INFO L124 PetriNetUnfolderBase]: 7838/13348 cut-off events. [2024-11-19 01:48:23,375 INFO L125 PetriNetUnfolderBase]: For 84669/84677 co-relation queries the response was YES. [2024-11-19 01:48:23,421 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-19 01:48:23,436 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 0 selfloop transitions, 0 changer transitions 253/253 dead transitions. [2024-11-19 01:48:23,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 253 transitions, 2943 flow [2024-11-19 01:48:23,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 01:48:23,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-19 01:48:23,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 263 transitions. [2024-11-19 01:48:23,438 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5057692307692307 [2024-11-19 01:48:23,438 INFO L175 Difference]: Start difference. First operand has 103 places, 118 transitions, 1229 flow. Second operand 13 states and 263 transitions. [2024-11-19 01:48:23,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 253 transitions, 2943 flow [2024-11-19 01:48:23,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 253 transitions, 2759 flow, removed 32 selfloop flow, removed 12 redundant places. [2024-11-19 01:48:23,607 INFO L231 Difference]: Finished difference. Result has 92 places, 0 transitions, 0 flow [2024-11-19 01:48:23,608 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-19 01:48:23,609 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 50 predicate places. [2024-11-19 01:48:23,610 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 0 transitions, 0 flow [2024-11-19 01:48:23,610 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-19 01:48:23,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2024-11-19 01:48:23,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2024-11-19 01:48:23,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-11-19 01:48:23,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-11-19 01:48:23,631 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-19 01:48:23,814 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-19 01:48:23,815 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1] [2024-11-19 01:48:23,818 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 01:48:23,818 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 01:48:23,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 01:48:23 BasicIcfg [2024-11-19 01:48:23,823 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 01:48:23,823 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 01:48:23,824 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 01:48:23,824 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 01:48:23,825 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:48:09" (3/4) ... [2024-11-19 01:48:23,827 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 01:48:23,831 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-19 01:48:23,831 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-19 01:48:23,831 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-19 01:48:23,837 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 49 nodes and edges [2024-11-19 01:48:23,837 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-19 01:48:23,837 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-19 01:48:23,838 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-19 01:48:23,924 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 01:48:23,925 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 01:48:23,925 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 01:48:23,925 INFO L158 Benchmark]: Toolchain (without parser) took 14805.93ms. Allocated memory was 167.8MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 109.4MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 483.7MB. Max. memory is 16.1GB. [2024-11-19 01:48:23,926 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 96.5MB. Free memory was 50.8MB in the beginning and 50.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 01:48:23,926 INFO L158 Benchmark]: CACSL2BoogieTranslator took 323.72ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 139.6MB in the end (delta: -30.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 01:48:23,926 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.48ms. Allocated memory is still 167.8MB. Free memory was 139.6MB in the beginning and 138.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 01:48:23,927 INFO L158 Benchmark]: Boogie Preprocessor took 41.36ms. Allocated memory is still 167.8MB. Free memory was 138.2MB in the beginning and 136.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 01:48:23,927 INFO L158 Benchmark]: RCFGBuilder took 471.04ms. Allocated memory is still 167.8MB. Free memory was 136.1MB in the beginning and 115.1MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-19 01:48:23,927 INFO L158 Benchmark]: TraceAbstraction took 13827.17ms. Allocated memory was 167.8MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 114.5MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 619.9MB. Max. memory is 16.1GB. [2024-11-19 01:48:23,928 INFO L158 Benchmark]: Witness Printer took 101.31ms. Allocated memory is still 2.3GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 01:48:23,929 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 96.5MB. Free memory was 50.8MB in the beginning and 50.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 323.72ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 139.6MB in the end (delta: -30.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.48ms. Allocated memory is still 167.8MB. Free memory was 139.6MB in the beginning and 138.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.36ms. Allocated memory is still 167.8MB. Free memory was 138.2MB in the beginning and 136.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 471.04ms. Allocated memory is still 167.8MB. Free memory was 136.1MB in the beginning and 115.1MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 13827.17ms. Allocated memory was 167.8MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 114.5MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 619.9MB. Max. memory is 16.1GB. * Witness Printer took 101.31ms. Allocated memory is still 2.3GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. 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: 13.7s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 9.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 756 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 720 mSDsluCounter, 194 SdHoareTripleChecker+Invalid, 1.3s 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.8s 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.3s SatisfiabilityAnalysisTime, 2.7s 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-19 01:48:23,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE