./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-3-extended.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-3-extended.wvr.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1ac00c9540bbc99a446c9cb6c02e180c3a0ad4fef3c182d14bafdc7ea871c54c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 14:29:27,374 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 14:29:27,432 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 14:29:27,437 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 14:29:27,437 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 14:29:27,466 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 14:29:27,466 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 14:29:27,467 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 14:29:27,467 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 14:29:27,469 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 14:29:27,469 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 14:29:27,469 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 14:29:27,471 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 14:29:27,471 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 14:29:27,471 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 14:29:27,472 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 14:29:27,472 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 14:29:27,472 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 14:29:27,472 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 14:29:27,473 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 14:29:27,473 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 14:29:27,475 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 14:29:27,475 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 14:29:27,476 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 14:29:27,476 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 14:29:27,476 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 14:29:27,476 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 14:29:27,476 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 14:29:27,477 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 14:29:27,477 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 14:29:27,477 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 14:29:27,477 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 14:29:27,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:29:27,477 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 14:29:27,478 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 14:29:27,478 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 14:29:27,478 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 14:29:27,478 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 14:29:27,478 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 14:29:27,478 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 14:29:27,479 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 14:29:27,479 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 14:29:27,480 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1ac00c9540bbc99a446c9cb6c02e180c3a0ad4fef3c182d14bafdc7ea871c54c [2024-10-11 14:29:27,691 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 14:29:27,707 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 14:29:27,709 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 14:29:27,710 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 14:29:27,710 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 14:29:27,711 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-3-extended.wvr.c [2024-10-11 14:29:28,966 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 14:29:29,136 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 14:29:29,136 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-3-extended.wvr.c [2024-10-11 14:29:29,143 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7a7206571/c367075272ce4181a5e6f1522eb819e8/FLAGc5cab4bb4 [2024-10-11 14:29:29,157 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7a7206571/c367075272ce4181a5e6f1522eb819e8 [2024-10-11 14:29:29,160 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 14:29:29,161 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 14:29:29,162 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 14:29:29,163 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 14:29:29,168 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 14:29:29,169 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:29:29" (1/1) ... [2024-10-11 14:29:29,170 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42f42f3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:29:29, skipping insertion in model container [2024-10-11 14:29:29,170 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:29:29" (1/1) ... [2024-10-11 14:29:29,195 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 14:29:29,380 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-3-extended.wvr.c[2895,2908] [2024-10-11 14:29:29,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:29:29,400 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 14:29:29,446 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-3-extended.wvr.c[2895,2908] [2024-10-11 14:29:29,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:29:29,481 INFO L204 MainTranslator]: Completed translation [2024-10-11 14:29:29,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:29:29 WrapperNode [2024-10-11 14:29:29,482 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 14:29:29,482 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 14:29:29,483 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 14:29:29,483 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 14:29:29,488 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:29:29" (1/1) ... [2024-10-11 14:29:29,498 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:29:29" (1/1) ... [2024-10-11 14:29:29,514 INFO L138 Inliner]: procedures = 21, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 52 [2024-10-11 14:29:29,515 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 14:29:29,515 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 14:29:29,515 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 14:29:29,515 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 14:29:29,524 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:29:29" (1/1) ... [2024-10-11 14:29:29,524 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:29:29" (1/1) ... [2024-10-11 14:29:29,525 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:29:29" (1/1) ... [2024-10-11 14:29:29,536 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 14:29:29,537 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:29:29" (1/1) ... [2024-10-11 14:29:29,537 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:29:29" (1/1) ... [2024-10-11 14:29:29,540 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:29:29" (1/1) ... [2024-10-11 14:29:29,545 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:29:29" (1/1) ... [2024-10-11 14:29:29,546 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:29:29" (1/1) ... [2024-10-11 14:29:29,547 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:29:29" (1/1) ... [2024-10-11 14:29:29,549 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 14:29:29,549 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 14:29:29,550 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 14:29:29,550 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 14:29:29,550 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:29:29" (1/1) ... [2024-10-11 14:29:29,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:29:29,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:29:29,576 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 14:29:29,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 14:29:29,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 14:29:29,617 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-11 14:29:29,617 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-11 14:29:29,617 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-11 14:29:29,617 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-11 14:29:29,618 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-11 14:29:29,618 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-11 14:29:29,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 14:29:29,618 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-11 14:29:29,618 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-11 14:29:29,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 14:29:29,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 14:29:29,619 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 14:29:29,693 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 14:29:29,695 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 14:29:29,927 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 14:29:29,927 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 14:29:30,056 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 14:29:30,057 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-11 14:29:30,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:29:30 BoogieIcfgContainer [2024-10-11 14:29:30,058 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 14:29:30,060 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 14:29:30,061 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 14:29:30,064 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 14:29:30,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:29:29" (1/3) ... [2024-10-11 14:29:30,065 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59ee9de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:29:30, skipping insertion in model container [2024-10-11 14:29:30,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:29:29" (2/3) ... [2024-10-11 14:29:30,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59ee9de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:29:30, skipping insertion in model container [2024-10-11 14:29:30,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:29:30" (3/3) ... [2024-10-11 14:29:30,068 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-3-extended.wvr.c [2024-10-11 14:29:30,085 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 14:29:30,085 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 14:29:30,085 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 14:29:30,144 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-11 14:29:30,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 40 transitions, 101 flow [2024-10-11 14:29:30,210 INFO L124 PetriNetUnfolderBase]: 6/37 cut-off events. [2024-10-11 14:29:30,211 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-11 14:29:30,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 37 events. 6/37 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 73 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2024-10-11 14:29:30,215 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 40 transitions, 101 flow [2024-10-11 14:29:30,217 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 36 transitions, 90 flow [2024-10-11 14:29:30,225 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:29:30,231 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;@2ecc8da3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:29:30,233 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-11 14:29:30,244 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 14:29:30,244 INFO L124 PetriNetUnfolderBase]: 6/35 cut-off events. [2024-10-11 14:29:30,244 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-11 14:29:30,245 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:29:30,245 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:29:30,246 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-10-11 14:29:30,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:29:30,250 INFO L85 PathProgramCache]: Analyzing trace with hash -355086918, now seen corresponding path program 1 times [2024-10-11 14:29:30,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:29:30,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474027857] [2024-10-11 14:29:30,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:29:30,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:29:30,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:29:30,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:29:30,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:29:30,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474027857] [2024-10-11 14:29:30,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474027857] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:29:30,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:29:30,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 14:29:30,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871600592] [2024-10-11 14:29:30,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:29:30,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:29:30,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:29:30,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:29:30,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:29:30,538 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40 [2024-10-11 14:29:30,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 36 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:29:30,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:29:30,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40 [2024-10-11 14:29:30,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:29:30,796 INFO L124 PetriNetUnfolderBase]: 872/1394 cut-off events. [2024-10-11 14:29:30,797 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2024-10-11 14:29:30,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2569 conditions, 1394 events. 872/1394 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 6593 event pairs, 86 based on Foata normal form. 1/1236 useless extension candidates. Maximal degree in co-relation 2294. Up to 1025 conditions per place. [2024-10-11 14:29:30,812 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 32 selfloop transitions, 7 changer transitions 1/53 dead transitions. [2024-10-11 14:29:30,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 53 transitions, 219 flow [2024-10-11 14:29:30,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:29:30,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 14:29:30,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2024-10-11 14:29:30,823 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7416666666666667 [2024-10-11 14:29:30,825 INFO L175 Difference]: Start difference. First operand has 40 places, 36 transitions, 90 flow. Second operand 3 states and 89 transitions. [2024-10-11 14:29:30,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 53 transitions, 219 flow [2024-10-11 14:29:30,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 53 transitions, 197 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-11 14:29:30,834 INFO L231 Difference]: Finished difference. Result has 37 places, 42 transitions, 125 flow [2024-10-11 14:29:30,837 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=37, PETRI_TRANSITIONS=42} [2024-10-11 14:29:30,841 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2024-10-11 14:29:30,841 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 42 transitions, 125 flow [2024-10-11 14:29:30,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:29:30,842 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:29:30,842 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-10-11 14:29:30,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 14:29:30,842 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-10-11 14:29:30,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:29:30,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1445721854, now seen corresponding path program 1 times [2024-10-11 14:29:30,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:29:30,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153536286] [2024-10-11 14:29:30,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:29:30,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:29:30,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:29:30,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 14:29:30,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:29:30,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153536286] [2024-10-11 14:29:30,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153536286] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:29:30,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:29:30,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 14:29:30,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408695067] [2024-10-11 14:29:30,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:29:30,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:29:30,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:29:30,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:29:30,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:29:30,986 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 40 [2024-10-11 14:29:30,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 42 transitions, 125 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:29:30,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:29:30,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 40 [2024-10-11 14:29:30,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:29:31,084 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([320] L44-->L50: Formula: (= (+ v_~pos~0_28 1) v_~pos~0_27) InVars {~pos~0=v_~pos~0_28} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_27} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][24], [5#L121-4true, Black: 49#(= ~pos~0 0), 26#thread3EXITtrue, 12#L50true, 47#true, 7#L72true, 53#(= ~g2~0 1)]) [2024-10-11 14:29:31,085 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-10-11 14:29:31,085 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-10-11 14:29:31,085 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-10-11 14:29:31,085 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-10-11 14:29:31,086 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([321] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][25], [5#L121-4true, Black: 49#(= ~pos~0 0), 26#thread3EXITtrue, 12#L50true, 47#true, 7#L72true, 53#(= ~g2~0 1)]) [2024-10-11 14:29:31,086 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-10-11 14:29:31,086 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-10-11 14:29:31,086 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-10-11 14:29:31,086 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-10-11 14:29:31,110 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([320] L44-->L50: Formula: (= (+ v_~pos~0_28 1) v_~pos~0_27) InVars {~pos~0=v_~pos~0_28} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_27} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][24], [17#L122true, Black: 49#(= ~pos~0 0), 26#thread3EXITtrue, 12#L50true, 47#true, 7#L72true, 53#(= ~g2~0 1)]) [2024-10-11 14:29:31,111 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-10-11 14:29:31,111 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-10-11 14:29:31,111 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-10-11 14:29:31,111 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-10-11 14:29:31,112 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([321] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][25], [17#L122true, Black: 49#(= ~pos~0 0), 26#thread3EXITtrue, 12#L50true, 47#true, 7#L72true, 53#(= ~g2~0 1)]) [2024-10-11 14:29:31,112 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-10-11 14:29:31,112 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-10-11 14:29:31,112 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-10-11 14:29:31,113 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-10-11 14:29:31,138 INFO L124 PetriNetUnfolderBase]: 698/1163 cut-off events. [2024-10-11 14:29:31,138 INFO L125 PetriNetUnfolderBase]: For 244/338 co-relation queries the response was YES. [2024-10-11 14:29:31,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2383 conditions, 1163 events. 698/1163 cut-off events. For 244/338 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5654 event pairs, 79 based on Foata normal form. 48/1033 useless extension candidates. Maximal degree in co-relation 1075. Up to 466 conditions per place. [2024-10-11 14:29:31,152 INFO L140 encePairwiseOnDemand]: 37/40 looper letters, 30 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2024-10-11 14:29:31,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 53 transitions, 217 flow [2024-10-11 14:29:31,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:29:31,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 14:29:31,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2024-10-11 14:29:31,153 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7583333333333333 [2024-10-11 14:29:31,153 INFO L175 Difference]: Start difference. First operand has 37 places, 42 transitions, 125 flow. Second operand 3 states and 91 transitions. [2024-10-11 14:29:31,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 53 transitions, 217 flow [2024-10-11 14:29:31,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 53 transitions, 208 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-10-11 14:29:31,158 INFO L231 Difference]: Finished difference. Result has 39 places, 43 transitions, 128 flow [2024-10-11 14:29:31,158 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=39, PETRI_TRANSITIONS=43} [2024-10-11 14:29:31,159 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, -1 predicate places. [2024-10-11 14:29:31,159 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 43 transitions, 128 flow [2024-10-11 14:29:31,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:29:31,160 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:29:31,160 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-10-11 14:29:31,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 14:29:31,161 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-10-11 14:29:31,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:29:31,163 INFO L85 PathProgramCache]: Analyzing trace with hash 207352506, now seen corresponding path program 1 times [2024-10-11 14:29:31,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:29:31,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372898393] [2024-10-11 14:29:31,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:29:31,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:29:31,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:29:31,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 14:29:31,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:29:31,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372898393] [2024-10-11 14:29:31,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372898393] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:29:31,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:29:31,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 14:29:31,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230339638] [2024-10-11 14:29:31,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:29:31,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:29:31,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:29:31,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:29:31,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:29:31,272 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 40 [2024-10-11 14:29:31,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 43 transitions, 128 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-10-11 14:29:31,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:29:31,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 40 [2024-10-11 14:29:31,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:29:31,426 INFO L124 PetriNetUnfolderBase]: 801/1278 cut-off events. [2024-10-11 14:29:31,426 INFO L125 PetriNetUnfolderBase]: For 480/706 co-relation queries the response was YES. [2024-10-11 14:29:31,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2944 conditions, 1278 events. 801/1278 cut-off events. For 480/706 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6096 event pairs, 101 based on Foata normal form. 46/1090 useless extension candidates. Maximal degree in co-relation 955. Up to 631 conditions per place. [2024-10-11 14:29:31,436 INFO L140 encePairwiseOnDemand]: 37/40 looper letters, 33 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2024-10-11 14:29:31,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 56 transitions, 237 flow [2024-10-11 14:29:31,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:29:31,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 14:29:31,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2024-10-11 14:29:31,440 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7666666666666667 [2024-10-11 14:29:31,440 INFO L175 Difference]: Start difference. First operand has 39 places, 43 transitions, 128 flow. Second operand 3 states and 92 transitions. [2024-10-11 14:29:31,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 56 transitions, 237 flow [2024-10-11 14:29:31,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 56 transitions, 234 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 14:29:31,443 INFO L231 Difference]: Finished difference. Result has 41 places, 44 transitions, 138 flow [2024-10-11 14:29:31,443 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=41, PETRI_TRANSITIONS=44} [2024-10-11 14:29:31,443 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2024-10-11 14:29:31,444 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 44 transitions, 138 flow [2024-10-11 14:29:31,444 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-10-11 14:29:31,444 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:29:31,444 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:29:31,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 14:29:31,445 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-10-11 14:29:31,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:29:31,446 INFO L85 PathProgramCache]: Analyzing trace with hash -113919402, now seen corresponding path program 1 times [2024-10-11 14:29:31,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:29:31,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808552104] [2024-10-11 14:29:31,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:29:31,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:29:31,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:29:31,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:29:31,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:29:31,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808552104] [2024-10-11 14:29:31,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808552104] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:29:31,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:29:31,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 14:29:31,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688797561] [2024-10-11 14:29:31,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:29:31,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:29:31,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:29:31,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:29:31,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:29:31,567 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 40 [2024-10-11 14:29:31,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 44 transitions, 138 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-10-11 14:29:31,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:29:31,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 40 [2024-10-11 14:29:31,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:29:31,715 INFO L124 PetriNetUnfolderBase]: 875/1404 cut-off events. [2024-10-11 14:29:31,715 INFO L125 PetriNetUnfolderBase]: For 531/629 co-relation queries the response was YES. [2024-10-11 14:29:31,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3295 conditions, 1404 events. 875/1404 cut-off events. For 531/629 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 6895 event pairs, 97 based on Foata normal form. 45/1324 useless extension candidates. Maximal degree in co-relation 1107. Up to 703 conditions per place. [2024-10-11 14:29:31,727 INFO L140 encePairwiseOnDemand]: 37/40 looper letters, 33 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2024-10-11 14:29:31,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 54 transitions, 239 flow [2024-10-11 14:29:31,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:29:31,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 14:29:31,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2024-10-11 14:29:31,729 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7416666666666667 [2024-10-11 14:29:31,729 INFO L175 Difference]: Start difference. First operand has 41 places, 44 transitions, 138 flow. Second operand 3 states and 89 transitions. [2024-10-11 14:29:31,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 54 transitions, 239 flow [2024-10-11 14:29:31,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 54 transitions, 236 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 14:29:31,732 INFO L231 Difference]: Finished difference. Result has 43 places, 43 transitions, 140 flow [2024-10-11 14:29:31,733 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=43, PETRI_TRANSITIONS=43} [2024-10-11 14:29:31,734 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places. [2024-10-11 14:29:31,735 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 43 transitions, 140 flow [2024-10-11 14:29:31,735 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-10-11 14:29:31,735 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:29:31,735 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:29:31,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 14:29:31,736 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-10-11 14:29:31,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:29:31,736 INFO L85 PathProgramCache]: Analyzing trace with hash 575063584, now seen corresponding path program 1 times [2024-10-11 14:29:31,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:29:31,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18204809] [2024-10-11 14:29:31,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:29:31,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:29:31,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:29:31,809 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:29:31,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:29:31,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18204809] [2024-10-11 14:29:31,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18204809] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:29:31,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:29:31,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 14:29:31,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375407147] [2024-10-11 14:29:31,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:29:31,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:29:31,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:29:31,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:29:31,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:29:31,815 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 40 [2024-10-11 14:29:31,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 43 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:29:31,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:29:31,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 40 [2024-10-11 14:29:31,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:29:31,951 INFO L124 PetriNetUnfolderBase]: 890/1453 cut-off events. [2024-10-11 14:29:31,952 INFO L125 PetriNetUnfolderBase]: For 811/1027 co-relation queries the response was YES. [2024-10-11 14:29:31,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3558 conditions, 1453 events. 890/1453 cut-off events. For 811/1027 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7153 event pairs, 182 based on Foata normal form. 42/1222 useless extension candidates. Maximal degree in co-relation 1182. Up to 539 conditions per place. [2024-10-11 14:29:31,965 INFO L140 encePairwiseOnDemand]: 37/40 looper letters, 33 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2024-10-11 14:29:31,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 55 transitions, 255 flow [2024-10-11 14:29:31,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:29:31,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 14:29:31,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2024-10-11 14:29:31,967 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.75 [2024-10-11 14:29:31,967 INFO L175 Difference]: Start difference. First operand has 43 places, 43 transitions, 140 flow. Second operand 3 states and 90 transitions. [2024-10-11 14:29:31,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 55 transitions, 255 flow [2024-10-11 14:29:31,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 55 transitions, 249 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 14:29:31,969 INFO L231 Difference]: Finished difference. Result has 44 places, 44 transitions, 148 flow [2024-10-11 14:29:31,969 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=44, PETRI_TRANSITIONS=44} [2024-10-11 14:29:31,969 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2024-10-11 14:29:31,969 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 44 transitions, 148 flow [2024-10-11 14:29:31,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:29:31,970 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:29:31,970 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:29:31,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 14:29:31,970 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-10-11 14:29:31,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:29:31,973 INFO L85 PathProgramCache]: Analyzing trace with hash 576627728, now seen corresponding path program 1 times [2024-10-11 14:29:31,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:29:31,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199452110] [2024-10-11 14:29:31,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:29:31,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:29:32,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:29:32,171 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 14:29:32,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:29:32,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199452110] [2024-10-11 14:29:32,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199452110] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:29:32,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:29:32,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:29:32,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811078138] [2024-10-11 14:29:32,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:29:32,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:29:32,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:29:32,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:29:32,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:29:32,180 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 40 [2024-10-11 14:29:32,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 44 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:29:32,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:29:32,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 40 [2024-10-11 14:29:32,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:29:32,441 INFO L124 PetriNetUnfolderBase]: 2153/3269 cut-off events. [2024-10-11 14:29:32,441 INFO L125 PetriNetUnfolderBase]: For 1827/1951 co-relation queries the response was YES. [2024-10-11 14:29:32,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8496 conditions, 3269 events. 2153/3269 cut-off events. For 1827/1951 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 16872 event pairs, 401 based on Foata normal form. 65/3004 useless extension candidates. Maximal degree in co-relation 3592. Up to 1150 conditions per place. [2024-10-11 14:29:32,465 INFO L140 encePairwiseOnDemand]: 36/40 looper letters, 50 selfloop transitions, 5 changer transitions 0/73 dead transitions. [2024-10-11 14:29:32,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 73 transitions, 360 flow [2024-10-11 14:29:32,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:29:32,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 14:29:32,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2024-10-11 14:29:32,466 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.74375 [2024-10-11 14:29:32,466 INFO L175 Difference]: Start difference. First operand has 44 places, 44 transitions, 148 flow. Second operand 4 states and 119 transitions. [2024-10-11 14:29:32,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 73 transitions, 360 flow [2024-10-11 14:29:32,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 73 transitions, 356 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 14:29:32,468 INFO L231 Difference]: Finished difference. Result has 47 places, 47 transitions, 176 flow [2024-10-11 14:29:32,468 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=47, PETRI_TRANSITIONS=47} [2024-10-11 14:29:32,469 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 7 predicate places. [2024-10-11 14:29:32,469 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 47 transitions, 176 flow [2024-10-11 14:29:32,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:29:32,469 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:29:32,470 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, 1, 1] [2024-10-11 14:29:32,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 14:29:32,470 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-10-11 14:29:32,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:29:32,470 INFO L85 PathProgramCache]: Analyzing trace with hash 586771438, now seen corresponding path program 1 times [2024-10-11 14:29:32,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:29:32,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146901833] [2024-10-11 14:29:32,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:29:32,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:29:32,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:29:32,690 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 14:29:32,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:29:32,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146901833] [2024-10-11 14:29:32,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146901833] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:29:32,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:29:32,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:29:32,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276957265] [2024-10-11 14:29:32,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:29:32,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:29:32,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:29:32,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:29:32,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:29:32,700 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 40 [2024-10-11 14:29:32,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 47 transitions, 176 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:29:32,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:29:32,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 40 [2024-10-11 14:29:32,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:29:33,085 INFO L124 PetriNetUnfolderBase]: 3423/5060 cut-off events. [2024-10-11 14:29:33,085 INFO L125 PetriNetUnfolderBase]: For 6737/7456 co-relation queries the response was YES. [2024-10-11 14:29:33,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14335 conditions, 5060 events. 3423/5060 cut-off events. For 6737/7456 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 27571 event pairs, 791 based on Foata normal form. 188/4264 useless extension candidates. Maximal degree in co-relation 5151. Up to 1747 conditions per place. [2024-10-11 14:29:33,126 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 54 selfloop transitions, 5 changer transitions 0/77 dead transitions. [2024-10-11 14:29:33,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 77 transitions, 428 flow [2024-10-11 14:29:33,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:29:33,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 14:29:33,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2024-10-11 14:29:33,128 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7375 [2024-10-11 14:29:33,128 INFO L175 Difference]: Start difference. First operand has 47 places, 47 transitions, 176 flow. Second operand 4 states and 118 transitions. [2024-10-11 14:29:33,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 77 transitions, 428 flow [2024-10-11 14:29:33,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 77 transitions, 422 flow, removed 3 selfloop flow, removed 0 redundant places. [2024-10-11 14:29:33,136 INFO L231 Difference]: Finished difference. Result has 52 places, 49 transitions, 206 flow [2024-10-11 14:29:33,137 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=206, PETRI_PLACES=52, PETRI_TRANSITIONS=49} [2024-10-11 14:29:33,138 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 12 predicate places. [2024-10-11 14:29:33,138 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 49 transitions, 206 flow [2024-10-11 14:29:33,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:29:33,140 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:29:33,140 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] [2024-10-11 14:29:33,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 14:29:33,140 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-10-11 14:29:33,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:29:33,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1304856488, now seen corresponding path program 1 times [2024-10-11 14:29:33,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:29:33,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141374572] [2024-10-11 14:29:33,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:29:33,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:29:33,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:29:33,311 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 14:29:33,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:29:33,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141374572] [2024-10-11 14:29:33,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141374572] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:29:33,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:29:33,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:29:33,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443240437] [2024-10-11 14:29:33,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:29:33,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:29:33,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:29:33,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:29:33,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:29:33,322 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 40 [2024-10-11 14:29:33,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 49 transitions, 206 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:29:33,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:29:33,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 40 [2024-10-11 14:29:33,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:29:33,818 INFO L124 PetriNetUnfolderBase]: 4038/6134 cut-off events. [2024-10-11 14:29:33,818 INFO L125 PetriNetUnfolderBase]: For 9899/11824 co-relation queries the response was YES. [2024-10-11 14:29:33,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18840 conditions, 6134 events. 4038/6134 cut-off events. For 9899/11824 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 35069 event pairs, 1093 based on Foata normal form. 617/5607 useless extension candidates. Maximal degree in co-relation 7391. Up to 1929 conditions per place. [2024-10-11 14:29:33,861 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 61 selfloop transitions, 5 changer transitions 0/85 dead transitions. [2024-10-11 14:29:33,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 85 transitions, 514 flow [2024-10-11 14:29:33,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:29:33,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 14:29:33,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2024-10-11 14:29:33,863 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.75 [2024-10-11 14:29:33,863 INFO L175 Difference]: Start difference. First operand has 52 places, 49 transitions, 206 flow. Second operand 4 states and 120 transitions. [2024-10-11 14:29:33,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 85 transitions, 514 flow [2024-10-11 14:29:33,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 85 transitions, 508 flow, removed 3 selfloop flow, removed 0 redundant places. [2024-10-11 14:29:33,868 INFO L231 Difference]: Finished difference. Result has 57 places, 51 transitions, 236 flow [2024-10-11 14:29:33,869 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=236, PETRI_PLACES=57, PETRI_TRANSITIONS=51} [2024-10-11 14:29:33,871 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 17 predicate places. [2024-10-11 14:29:33,872 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 51 transitions, 236 flow [2024-10-11 14:29:33,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:29:33,872 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:29:33,872 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 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] [2024-10-11 14:29:33,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 14:29:33,872 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-10-11 14:29:33,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:29:33,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1446710806, now seen corresponding path program 1 times [2024-10-11 14:29:33,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:29:33,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001860169] [2024-10-11 14:29:33,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:29:33,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:29:33,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:29:34,024 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 14:29:34,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:29:34,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001860169] [2024-10-11 14:29:34,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001860169] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:29:34,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720803626] [2024-10-11 14:29:34,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:29:34,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:29:34,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:29:34,028 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:29:34,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 14:29:34,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:29:34,109 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 14:29:34,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:29:34,202 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 14:29:34,202 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:29:34,276 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 14:29:34,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720803626] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:29:34,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:29:34,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2024-10-11 14:29:34,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986469141] [2024-10-11 14:29:34,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:29:34,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:29:34,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:29:34,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:29:34,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:29:34,284 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40 [2024-10-11 14:29:34,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 51 transitions, 236 flow. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:29:34,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:29:34,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40 [2024-10-11 14:29:34,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:29:36,003 INFO L124 PetriNetUnfolderBase]: 11038/17841 cut-off events. [2024-10-11 14:29:36,004 INFO L125 PetriNetUnfolderBase]: For 22811/24321 co-relation queries the response was YES. [2024-10-11 14:29:36,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55494 conditions, 17841 events. 11038/17841 cut-off events. For 22811/24321 co-relation queries the response was YES. Maximal size of possible extension queue 572. Compared 122570 event pairs, 1828 based on Foata normal form. 716/18247 useless extension candidates. Maximal degree in co-relation 17936. Up to 7491 conditions per place. [2024-10-11 14:29:36,156 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 113 selfloop transitions, 28 changer transitions 1/158 dead transitions. [2024-10-11 14:29:36,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 158 transitions, 1035 flow [2024-10-11 14:29:36,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:29:36,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 14:29:36,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 199 transitions. [2024-10-11 14:29:36,158 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8291666666666667 [2024-10-11 14:29:36,158 INFO L175 Difference]: Start difference. First operand has 57 places, 51 transitions, 236 flow. Second operand 6 states and 199 transitions. [2024-10-11 14:29:36,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 158 transitions, 1035 flow [2024-10-11 14:29:36,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 158 transitions, 1031 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-10-11 14:29:36,167 INFO L231 Difference]: Finished difference. Result has 63 places, 75 transitions, 411 flow [2024-10-11 14:29:36,169 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=411, PETRI_PLACES=63, PETRI_TRANSITIONS=75} [2024-10-11 14:29:36,170 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 23 predicate places. [2024-10-11 14:29:36,170 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 75 transitions, 411 flow [2024-10-11 14:29:36,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:29:36,174 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:29:36,174 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 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] [2024-10-11 14:29:36,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 14:29:36,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:29:36,377 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-10-11 14:29:36,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:29:36,378 INFO L85 PathProgramCache]: Analyzing trace with hash 2019315392, now seen corresponding path program 2 times [2024-10-11 14:29:36,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:29:36,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746773661] [2024-10-11 14:29:36,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:29:36,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:29:36,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:29:36,541 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 14:29:36,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:29:36,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746773661] [2024-10-11 14:29:36,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746773661] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:29:36,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056002491] [2024-10-11 14:29:36,542 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 14:29:36,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:29:36,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:29:36,544 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:29:36,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 14:29:36,606 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 14:29:36,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 14:29:36,607 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 14:29:36,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:29:36,655 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 14:29:36,655 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:29:36,700 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 14:29:36,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056002491] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:29:36,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:29:36,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2024-10-11 14:29:36,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222574550] [2024-10-11 14:29:36,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:29:36,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:29:36,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:29:36,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:29:36,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:29:36,714 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40 [2024-10-11 14:29:36,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 75 transitions, 411 flow. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:29:36,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:29:36,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40 [2024-10-11 14:29:36,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:29:40,384 INFO L124 PetriNetUnfolderBase]: 26817/43271 cut-off events. [2024-10-11 14:29:40,384 INFO L125 PetriNetUnfolderBase]: For 78133/81830 co-relation queries the response was YES. [2024-10-11 14:29:40,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150483 conditions, 43271 events. 26817/43271 cut-off events. For 78133/81830 co-relation queries the response was YES. Maximal size of possible extension queue 1396. Compared 339190 event pairs, 2910 based on Foata normal form. 1913/44471 useless extension candidates. Maximal degree in co-relation 43382. Up to 17655 conditions per place. [2024-10-11 14:29:40,698 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 147 selfloop transitions, 46 changer transitions 1/210 dead transitions. [2024-10-11 14:29:40,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 210 transitions, 1530 flow [2024-10-11 14:29:40,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:29:40,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 14:29:40,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 203 transitions. [2024-10-11 14:29:40,700 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8458333333333333 [2024-10-11 14:29:40,700 INFO L175 Difference]: Start difference. First operand has 63 places, 75 transitions, 411 flow. Second operand 6 states and 203 transitions. [2024-10-11 14:29:40,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 210 transitions, 1530 flow [2024-10-11 14:29:40,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 210 transitions, 1410 flow, removed 60 selfloop flow, removed 0 redundant places. [2024-10-11 14:29:40,726 INFO L231 Difference]: Finished difference. Result has 71 places, 117 transitions, 749 flow [2024-10-11 14:29:40,727 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=749, PETRI_PLACES=71, PETRI_TRANSITIONS=117} [2024-10-11 14:29:40,727 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 31 predicate places. [2024-10-11 14:29:40,727 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 117 transitions, 749 flow [2024-10-11 14:29:40,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:29:40,727 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:29:40,727 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 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] [2024-10-11 14:29:40,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 14:29:40,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:29:40,928 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 14:29:40,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:29:40,929 INFO L85 PathProgramCache]: Analyzing trace with hash 598632594, now seen corresponding path program 3 times [2024-10-11 14:29:40,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:29:40,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404838592] [2024-10-11 14:29:40,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:29:40,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:29:40,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:29:41,054 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 14:29:41,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:29:41,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404838592] [2024-10-11 14:29:41,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404838592] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:29:41,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803037027] [2024-10-11 14:29:41,055 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 14:29:41,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:29:41,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:29:41,058 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:29:41,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 14:29:41,123 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-10-11 14:29:41,123 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 14:29:41,124 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 14:29:41,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:29:41,172 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 14:29:41,172 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:29:41,212 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 14:29:41,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803037027] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:29:41,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:29:41,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2024-10-11 14:29:41,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858368325] [2024-10-11 14:29:41,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:29:41,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 14:29:41,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:29:41,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 14:29:41,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 14:29:41,225 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40 [2024-10-11 14:29:41,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 117 transitions, 749 flow. Second operand has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:29:41,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:29:41,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40 [2024-10-11 14:29:41,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:29:47,557 INFO L124 PetriNetUnfolderBase]: 41000/66528 cut-off events. [2024-10-11 14:29:47,557 INFO L125 PetriNetUnfolderBase]: For 132301/137703 co-relation queries the response was YES. [2024-10-11 14:29:47,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237891 conditions, 66528 events. 41000/66528 cut-off events. For 132301/137703 co-relation queries the response was YES. Maximal size of possible extension queue 2347. Compared 560958 event pairs, 4175 based on Foata normal form. 2787/68157 useless extension candidates. Maximal degree in co-relation 75675. Up to 20392 conditions per place. [2024-10-11 14:29:48,116 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 170 selfloop transitions, 76 changer transitions 1/263 dead transitions. [2024-10-11 14:29:48,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 263 transitions, 2018 flow [2024-10-11 14:29:48,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 14:29:48,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-11 14:29:48,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 240 transitions. [2024-10-11 14:29:48,117 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2024-10-11 14:29:48,117 INFO L175 Difference]: Start difference. First operand has 71 places, 117 transitions, 749 flow. Second operand 7 states and 240 transitions. [2024-10-11 14:29:48,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 263 transitions, 2018 flow [2024-10-11 14:29:48,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 263 transitions, 1994 flow, removed 12 selfloop flow, removed 0 redundant places. [2024-10-11 14:29:48,215 INFO L231 Difference]: Finished difference. Result has 78 places, 147 transitions, 1100 flow [2024-10-11 14:29:48,215 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=725, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1100, PETRI_PLACES=78, PETRI_TRANSITIONS=147} [2024-10-11 14:29:48,216 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 38 predicate places. [2024-10-11 14:29:48,216 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 147 transitions, 1100 flow [2024-10-11 14:29:48,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:29:48,216 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:29:48,216 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 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] [2024-10-11 14:29:48,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 14:29:48,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:29:48,419 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 14:29:48,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:29:48,420 INFO L85 PathProgramCache]: Analyzing trace with hash -101943738, now seen corresponding path program 4 times [2024-10-11 14:29:48,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:29:48,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65669285] [2024-10-11 14:29:48,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:29:48,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:29:48,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:29:48,570 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 14:29:48,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:29:48,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65669285] [2024-10-11 14:29:48,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65669285] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:29:48,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939893289] [2024-10-11 14:29:48,571 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 14:29:48,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:29:48,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:29:48,573 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:29:48,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 14:29:48,636 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 14:29:48,637 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 14:29:48,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 14:29:48,639 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:29:48,684 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 14:29:48,685 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:29:48,730 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 14:29:48,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939893289] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:29:48,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:29:48,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2024-10-11 14:29:48,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449087185] [2024-10-11 14:29:48,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:29:48,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 14:29:48,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:29:48,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 14:29:48,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 14:29:48,737 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40 [2024-10-11 14:29:48,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 147 transitions, 1100 flow. Second operand has 8 states, 8 states have (on average 19.25) internal successors, (154), 8 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:29:48,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:29:48,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40 [2024-10-11 14:29:48,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:29:58,370 INFO L124 PetriNetUnfolderBase]: 57273/93360 cut-off events. [2024-10-11 14:29:58,370 INFO L125 PetriNetUnfolderBase]: For 254705/261911 co-relation queries the response was YES. [2024-10-11 14:29:58,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359712 conditions, 93360 events. 57273/93360 cut-off events. For 254705/261911 co-relation queries the response was YES. Maximal size of possible extension queue 3587. Compared 835281 event pairs, 5950 based on Foata normal form. 3817/95202 useless extension candidates. Maximal degree in co-relation 132308. Up to 27715 conditions per place. [2024-10-11 14:29:59,370 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 170 selfloop transitions, 136 changer transitions 1/323 dead transitions. [2024-10-11 14:29:59,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 323 transitions, 2732 flow [2024-10-11 14:29:59,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 14:29:59,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-11 14:29:59,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 277 transitions. [2024-10-11 14:29:59,373 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.865625 [2024-10-11 14:29:59,373 INFO L175 Difference]: Start difference. First operand has 78 places, 147 transitions, 1100 flow. Second operand 8 states and 277 transitions. [2024-10-11 14:29:59,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 323 transitions, 2732 flow [2024-10-11 14:29:59,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 323 transitions, 2612 flow, removed 60 selfloop flow, removed 0 redundant places. [2024-10-11 14:29:59,554 INFO L231 Difference]: Finished difference. Result has 86 places, 183 transitions, 1599 flow [2024-10-11 14:29:59,554 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1052, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1599, PETRI_PLACES=86, PETRI_TRANSITIONS=183} [2024-10-11 14:29:59,554 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 46 predicate places. [2024-10-11 14:29:59,555 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 183 transitions, 1599 flow [2024-10-11 14:29:59,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.25) internal successors, (154), 8 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:29:59,555 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:29:59,555 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 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] [2024-10-11 14:29:59,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 14:29:59,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 14:29:59,756 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 14:29:59,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:29:59,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1670525396, now seen corresponding path program 5 times [2024-10-11 14:29:59,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:29:59,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495932859] [2024-10-11 14:29:59,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:29:59,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:29:59,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:30:00,355 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 14:30:00,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:30:00,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495932859] [2024-10-11 14:30:00,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495932859] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:30:00,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515986167] [2024-10-11 14:30:00,355 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 14:30:00,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:30:00,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:30:00,357 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:30:00,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 14:30:00,430 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-10-11 14:30:00,430 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 14:30:00,434 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 14:30:00,438 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:30:00,716 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 14:30:00,716 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:30:00,822 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 14:30:00,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515986167] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 14:30:00,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-11 14:30:00,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 7] total 14 [2024-10-11 14:30:00,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397439711] [2024-10-11 14:30:00,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:30:00,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:30:00,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:30:00,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:30:00,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2024-10-11 14:30:00,830 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 40 [2024-10-11 14:30:00,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 183 transitions, 1599 flow. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:30:00,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:30:00,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 40 [2024-10-11 14:30:00,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:30:05,580 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([321] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][103], [Black: 65#(= ~g3~0 1), 592#true, 84#true, Black: 848#(= ~pos~0 0), Black: 74#(= ~g3~0 1), Black: 594#(= ~pos~0 0), Black: 339#(= ~pos~0 0), Black: 340#(= ~pos~0 1), Black: 341#(= ~pos~0 3), 69#(= ~g2~0 1), Black: 86#(= ~pos~0 0), 337#true, Black: 81#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), 7#L72true, 19#L94true, 75#(and (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), 80#(= ~g1~0 1), 17#L122true, Black: 49#(= ~pos~0 0), 846#true, Black: 53#(= ~g2~0 1), 12#L50true, 1277#(< 0 (mod ~g1~0 256)), Black: 57#(= ~g1~0 1), Black: 61#(and (<= (div ~d2~0 256) 0) (<= 1 ~d2~0))]) [2024-10-11 14:30:05,580 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-10-11 14:30:05,580 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-11 14:30:05,580 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-11 14:30:05,580 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-11 14:30:09,611 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([320] L44-->L50: Formula: (= (+ v_~pos~0_28 1) v_~pos~0_27) InVars {~pos~0=v_~pos~0_28} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_27} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][90], [Black: 65#(= ~g3~0 1), 592#true, 1281#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 69#(= ~g2~0 1), 84#true, Black: 75#(and (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 848#(= ~pos~0 0), Black: 594#(= ~pos~0 0), Black: 339#(= ~pos~0 0), Black: 74#(= ~g3~0 1), Black: 340#(= ~pos~0 1), Black: 341#(= ~pos~0 3), Black: 86#(= ~pos~0 0), 337#true, Black: 80#(= ~g1~0 1), Black: 81#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), 7#L72true, 72#true, 26#thread3EXITtrue, 70#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0))), 5#L121-4true, Black: 49#(= ~pos~0 0), 846#true, Black: 53#(= ~g2~0 1), 78#true, 12#L50true, Black: 57#(= ~g1~0 1), Black: 61#(and (<= (div ~d2~0 256) 0) (<= 1 ~d2~0))]) [2024-10-11 14:30:09,611 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-10-11 14:30:09,611 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-10-11 14:30:09,611 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-10-11 14:30:09,611 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-10-11 14:30:09,611 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([330] L72-->L75-1: Formula: (and (let ((.cse0 (= (mod v_~d2~0_33 256) 0)) (.cse1 (= v_~g2~0_29 v_~g2~0_28))) (or (and (or (= |v_thread2_#t~nondet4_35| 0) (= |v_thread2_#t~nondet4_35| 1)) (not .cse0) (let ((.cse2 (= (mod |v_thread2_#t~nondet4_35| 256) 0))) (or (and .cse1 .cse2) (and (= v_~g2~0_28 0) (not .cse2))))) (and .cse0 (= |v_thread2Thread1of1ForFork0_#t~nondet4_2| |v_thread2Thread1of1ForFork0_#t~nondet4_1|) .cse1))) (= v_~d2~0_33 (ite (= (ite (= (mod v_~d2~0_34 256) 0) 1 0) 0) 0 1))) InVars {~g2~0=v_~g2~0_29, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_1|, ~d2~0=v_~d2~0_34} OutVars{~g2~0=v_~g2~0_28, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_2|, ~d2~0=v_~d2~0_33} AuxVars[|v_thread2_#t~nondet4_35|] AssignedVars[~g2~0, thread2Thread1of1ForFork0_#t~nondet4, ~d2~0][51], [Black: 65#(= ~g3~0 1), 24#L75-1true, 592#true, 851#(= 5 ~pos~0), 1281#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), 84#true, Black: 75#(and (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 848#(= ~pos~0 0), Black: 594#(= ~pos~0 0), Black: 339#(= ~pos~0 0), Black: 74#(= ~g3~0 1), Black: 340#(= ~pos~0 1), Black: 341#(= ~pos~0 3), 69#(= ~g2~0 1), Black: 86#(= ~pos~0 0), 337#true, Black: 80#(= ~g1~0 1), Black: 81#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), 39#L44true, 72#true, 26#thread3EXITtrue, 5#L121-4true, Black: 49#(= ~pos~0 0), Black: 53#(= ~g2~0 1), 78#true, Black: 57#(= ~g1~0 1), Black: 61#(and (<= (div ~d2~0 256) 0) (<= 1 ~d2~0))]) [2024-10-11 14:30:09,612 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-10-11 14:30:09,612 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-10-11 14:30:09,612 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-10-11 14:30:09,612 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-10-11 14:30:10,303 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([320] L44-->L50: Formula: (= (+ v_~pos~0_28 1) v_~pos~0_27) InVars {~pos~0=v_~pos~0_28} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_27} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][90], [Black: 65#(= ~g3~0 1), 592#true, 1281#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 69#(= ~g2~0 1), 84#true, Black: 75#(and (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 848#(= ~pos~0 0), Black: 594#(= ~pos~0 0), Black: 339#(= ~pos~0 0), Black: 74#(= ~g3~0 1), Black: 340#(= ~pos~0 1), Black: 341#(= ~pos~0 3), Black: 86#(= ~pos~0 0), 337#true, Black: 80#(= ~g1~0 1), Black: 81#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), 7#L72true, 72#true, 26#thread3EXITtrue, 70#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0))), 17#L122true, Black: 49#(= ~pos~0 0), 846#true, Black: 53#(= ~g2~0 1), 78#true, 12#L50true, Black: 57#(= ~g1~0 1), Black: 61#(and (<= (div ~d2~0 256) 0) (<= 1 ~d2~0))]) [2024-10-11 14:30:10,303 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-10-11 14:30:10,303 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-10-11 14:30:10,303 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-10-11 14:30:10,303 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-10-11 14:30:10,303 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([330] L72-->L75-1: Formula: (and (let ((.cse0 (= (mod v_~d2~0_33 256) 0)) (.cse1 (= v_~g2~0_29 v_~g2~0_28))) (or (and (or (= |v_thread2_#t~nondet4_35| 0) (= |v_thread2_#t~nondet4_35| 1)) (not .cse0) (let ((.cse2 (= (mod |v_thread2_#t~nondet4_35| 256) 0))) (or (and .cse1 .cse2) (and (= v_~g2~0_28 0) (not .cse2))))) (and .cse0 (= |v_thread2Thread1of1ForFork0_#t~nondet4_2| |v_thread2Thread1of1ForFork0_#t~nondet4_1|) .cse1))) (= v_~d2~0_33 (ite (= (ite (= (mod v_~d2~0_34 256) 0) 1 0) 0) 0 1))) InVars {~g2~0=v_~g2~0_29, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_1|, ~d2~0=v_~d2~0_34} OutVars{~g2~0=v_~g2~0_28, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_2|, ~d2~0=v_~d2~0_33} AuxVars[|v_thread2_#t~nondet4_35|] AssignedVars[~g2~0, thread2Thread1of1ForFork0_#t~nondet4, ~d2~0][51], [24#L75-1true, Black: 65#(= ~g3~0 1), 592#true, 851#(= 5 ~pos~0), 1281#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), 84#true, Black: 75#(and (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 848#(= ~pos~0 0), Black: 594#(= ~pos~0 0), Black: 339#(= ~pos~0 0), Black: 74#(= ~g3~0 1), Black: 340#(= ~pos~0 1), Black: 341#(= ~pos~0 3), 69#(= ~g2~0 1), Black: 86#(= ~pos~0 0), 337#true, Black: 80#(= ~g1~0 1), Black: 81#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), 39#L44true, 72#true, 26#thread3EXITtrue, 17#L122true, Black: 49#(= ~pos~0 0), Black: 53#(= ~g2~0 1), 78#true, Black: 57#(= ~g1~0 1), Black: 61#(and (<= (div ~d2~0 256) 0) (<= 1 ~d2~0))]) [2024-10-11 14:30:10,303 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-10-11 14:30:10,303 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-10-11 14:30:10,303 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-10-11 14:30:10,303 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-10-11 14:30:13,510 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([321] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][103], [Black: 65#(= ~g3~0 1), 592#true, Black: 69#(= ~g2~0 1), 84#true, Black: 75#(and (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 848#(= ~pos~0 0), Black: 594#(= ~pos~0 0), Black: 339#(= ~pos~0 0), Black: 74#(= ~g3~0 1), Black: 340#(= ~pos~0 1), Black: 341#(= ~pos~0 3), Black: 86#(= ~pos~0 0), 337#true, Black: 81#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), 67#true, 7#L72true, 19#L94true, 72#true, 80#(= ~g1~0 1), 5#L121-4true, Black: 49#(= ~pos~0 0), 846#true, Black: 53#(= ~g2~0 1), 12#L50true, 1277#(< 0 (mod ~g1~0 256)), Black: 57#(= ~g1~0 1), Black: 61#(and (<= (div ~d2~0 256) 0) (<= 1 ~d2~0))]) [2024-10-11 14:30:13,510 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2024-10-11 14:30:13,511 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-10-11 14:30:13,511 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-10-11 14:30:13,511 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-10-11 14:30:13,570 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([321] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][103], [Black: 65#(= ~g3~0 1), 592#true, Black: 69#(= ~g2~0 1), 84#true, Black: 75#(and (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 848#(= ~pos~0 0), Black: 594#(= ~pos~0 0), Black: 339#(= ~pos~0 0), Black: 74#(= ~g3~0 1), Black: 340#(= ~pos~0 1), Black: 341#(= ~pos~0 3), Black: 86#(= ~pos~0 0), 337#true, Black: 81#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), 67#true, 7#L72true, 19#L94true, 72#true, 80#(= ~g1~0 1), 17#L122true, Black: 49#(= ~pos~0 0), 846#true, Black: 53#(= ~g2~0 1), 12#L50true, 1277#(< 0 (mod ~g1~0 256)), Black: 57#(= ~g1~0 1), Black: 61#(and (<= (div ~d2~0 256) 0) (<= 1 ~d2~0))]) [2024-10-11 14:30:13,571 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2024-10-11 14:30:13,571 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-10-11 14:30:13,571 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-10-11 14:30:13,571 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-10-11 14:30:13,786 INFO L124 PetriNetUnfolderBase]: 79119/121427 cut-off events. [2024-10-11 14:30:13,787 INFO L125 PetriNetUnfolderBase]: For 297398/325357 co-relation queries the response was YES. [2024-10-11 14:30:14,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 461097 conditions, 121427 events. 79119/121427 cut-off events. For 297398/325357 co-relation queries the response was YES. Maximal size of possible extension queue 4127. Compared 1022102 event pairs, 12940 based on Foata normal form. 10977/126779 useless extension candidates. Maximal degree in co-relation 295827. Up to 51466 conditions per place. [2024-10-11 14:30:15,246 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 102 selfloop transitions, 9 changer transitions 0/217 dead transitions. [2024-10-11 14:30:15,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 217 transitions, 1989 flow [2024-10-11 14:30:15,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:30:15,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 14:30:15,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2024-10-11 14:30:15,247 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.70625 [2024-10-11 14:30:15,247 INFO L175 Difference]: Start difference. First operand has 86 places, 183 transitions, 1599 flow. Second operand 4 states and 113 transitions. [2024-10-11 14:30:15,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 217 transitions, 1989 flow [2024-10-11 14:30:15,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 217 transitions, 1876 flow, removed 33 selfloop flow, removed 2 redundant places. [2024-10-11 14:30:15,985 INFO L231 Difference]: Finished difference. Result has 89 places, 186 transitions, 1534 flow [2024-10-11 14:30:15,986 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1486, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1534, PETRI_PLACES=89, PETRI_TRANSITIONS=186} [2024-10-11 14:30:15,986 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 49 predicate places. [2024-10-11 14:30:15,986 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 186 transitions, 1534 flow [2024-10-11 14:30:15,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:30:15,986 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:30:15,987 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 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] [2024-10-11 14:30:16,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 14:30:16,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 14:30:16,191 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 14:30:16,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:30:16,191 INFO L85 PathProgramCache]: Analyzing trace with hash -588530036, now seen corresponding path program 6 times [2024-10-11 14:30:16,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:30:16,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752644141] [2024-10-11 14:30:16,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:30:16,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:30:16,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:30:16,456 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 14:30:16,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:30:16,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752644141] [2024-10-11 14:30:16,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752644141] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:30:16,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822929326] [2024-10-11 14:30:16,457 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-11 14:30:16,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:30:16,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:30:16,462 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:30:16,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 14:30:16,538 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2024-10-11 14:30:16,538 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 14:30:16,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-11 14:30:16,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:30:16,641 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 14:30:16,642 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 14:30:16,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822929326] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:30:16,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 14:30:16,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2024-10-11 14:30:16,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189895916] [2024-10-11 14:30:16,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:30:16,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 14:30:16,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:30:16,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 14:30:16,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-10-11 14:30:16,665 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40 [2024-10-11 14:30:16,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 186 transitions, 1534 flow. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 7 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:30:16,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:30:16,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40 [2024-10-11 14:30:16,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:30:18,335 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([321] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][143], [592#true, Black: 69#(= ~g2~0 1), 84#true, Black: 848#(= ~pos~0 0), Black: 339#(= ~pos~0 0), Black: 74#(= ~g3~0 1), Black: 340#(= ~pos~0 1), Black: 341#(= ~pos~0 3), 65#(= ~g3~0 1), 337#true, Black: 81#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), 7#L72true, 19#L94true, 75#(and (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), 70#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0))), 80#(= ~g1~0 1), 1470#(and (not (= (mod ~g2~0 256) 0)) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 1101#true, 17#L122true, Black: 49#(= ~pos~0 0), 846#true, Black: 53#(= ~g2~0 1), 12#L50true, 1277#(< 0 (mod ~g1~0 256)), Black: 57#(= ~g1~0 1), Black: 61#(and (<= (div ~d2~0 256) 0) (<= 1 ~d2~0))]) [2024-10-11 14:30:18,335 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-10-11 14:30:18,335 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-11 14:30:18,335 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-11 14:30:18,335 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-11 14:30:18,336 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([320] L44-->L50: Formula: (= (+ v_~pos~0_28 1) v_~pos~0_27) InVars {~pos~0=v_~pos~0_28} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_27} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][144], [592#true, 1281#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 69#(= ~g2~0 1), 84#true, Black: 848#(= ~pos~0 0), Black: 339#(= ~pos~0 0), Black: 74#(= ~g3~0 1), 81#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), Black: 340#(= ~pos~0 1), Black: 341#(= ~pos~0 3), 65#(= ~g3~0 1), 337#true, Black: 80#(= ~g1~0 1), 7#L72true, 19#L94true, 75#(and (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), 70#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0))), 1470#(and (not (= (mod ~g2~0 256) 0)) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 1277#(< 0 (mod ~g1~0 256)), Black: 1101#true, 17#L122true, Black: 49#(= ~pos~0 0), 846#true, Black: 53#(= ~g2~0 1), 12#L50true, Black: 57#(= ~g1~0 1), Black: 61#(and (<= (div ~d2~0 256) 0) (<= 1 ~d2~0))]) [2024-10-11 14:30:18,336 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-10-11 14:30:18,336 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-11 14:30:18,336 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-11 14:30:18,336 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-11 14:30:19,273 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([321] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][143], [592#true, Black: 69#(= ~g2~0 1), 84#true, Black: 848#(= ~pos~0 0), Black: 339#(= ~pos~0 0), Black: 74#(= ~g3~0 1), Black: 340#(= ~pos~0 1), Black: 341#(= ~pos~0 3), 65#(= ~g3~0 1), 337#true, Black: 81#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), 7#L72true, 19#L94true, 75#(and (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), 70#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0))), 80#(= ~g1~0 1), 1470#(and (not (= (mod ~g2~0 256) 0)) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 1101#true, 5#L121-4true, Black: 49#(= ~pos~0 0), 846#true, Black: 53#(= ~g2~0 1), 12#L50true, 1277#(< 0 (mod ~g1~0 256)), Black: 57#(= ~g1~0 1), Black: 61#(and (<= (div ~d2~0 256) 0) (<= 1 ~d2~0))]) [2024-10-11 14:30:19,273 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-10-11 14:30:19,273 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-11 14:30:19,273 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-11 14:30:19,273 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event