./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/triangular-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/triangular-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9ca4ad6de5ce46f9737c47ccc55c2628eaef135acf1b94c234f6d96d13f1ccb1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 19:05:42,552 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 19:05:42,647 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 19:05:42,652 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 19:05:42,653 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 19:05:42,680 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 19:05:42,681 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 19:05:42,682 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 19:05:42,683 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 19:05:42,683 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 19:05:42,683 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 19:05:42,684 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 19:05:42,684 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 19:05:42,684 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 19:05:42,685 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 19:05:42,685 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 19:05:42,687 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 19:05:42,689 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 19:05:42,689 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 19:05:42,690 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 19:05:42,690 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 19:05:42,691 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 19:05:42,691 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 19:05:42,693 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 19:05:42,694 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 19:05:42,694 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 19:05:42,694 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 19:05:42,695 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 19:05:42,695 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 19:05:42,695 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 19:05:42,696 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 19:05:42,696 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 19:05:42,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 19:05:42,696 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 19:05:42,697 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 19:05:42,697 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 19:05:42,697 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 19:05:42,697 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 19:05:42,698 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 19:05:42,699 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 19:05:42,699 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 19:05:42,700 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 19:05:42,700 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9ca4ad6de5ce46f9737c47ccc55c2628eaef135acf1b94c234f6d96d13f1ccb1 [2024-11-16 19:05:42,966 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 19:05:42,991 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 19:05:42,994 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 19:05:42,996 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 19:05:42,996 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 19:05:42,998 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/triangular-2.i [2024-11-16 19:05:44,432 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 19:05:44,706 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 19:05:44,707 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-2.i [2024-11-16 19:05:44,726 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5ef2b417/f2d46342c53349c189ae3440206ce07d/FLAGf662e6369 [2024-11-16 19:05:44,754 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5ef2b417/f2d46342c53349c189ae3440206ce07d [2024-11-16 19:05:44,757 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 19:05:44,759 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 19:05:44,762 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 19:05:44,762 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 19:05:44,767 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 19:05:44,770 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:05:44" (1/1) ... [2024-11-16 19:05:44,771 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2553f788 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:05:44, skipping insertion in model container [2024-11-16 19:05:44,771 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:05:44" (1/1) ... [2024-11-16 19:05:44,824 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 19:05:45,219 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-2.i[30952,30965] [2024-11-16 19:05:45,225 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 19:05:45,234 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 19:05:45,295 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-2.i[30952,30965] [2024-11-16 19:05:45,297 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 19:05:45,340 INFO L204 MainTranslator]: Completed translation [2024-11-16 19:05:45,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:05:45 WrapperNode [2024-11-16 19:05:45,341 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 19:05:45,342 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 19:05:45,343 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 19:05:45,343 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 19:05:45,350 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:05:45" (1/1) ... [2024-11-16 19:05:45,367 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:05:45" (1/1) ... [2024-11-16 19:05:45,387 INFO L138 Inliner]: procedures = 168, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 37 [2024-11-16 19:05:45,388 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 19:05:45,390 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 19:05:45,390 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 19:05:45,390 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 19:05:45,398 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:05:45" (1/1) ... [2024-11-16 19:05:45,398 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:05:45" (1/1) ... [2024-11-16 19:05:45,400 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:05:45" (1/1) ... [2024-11-16 19:05:45,415 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 19:05:45,416 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:05:45" (1/1) ... [2024-11-16 19:05:45,420 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:05:45" (1/1) ... [2024-11-16 19:05:45,424 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:05:45" (1/1) ... [2024-11-16 19:05:45,425 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:05:45" (1/1) ... [2024-11-16 19:05:45,430 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:05:45" (1/1) ... [2024-11-16 19:05:45,433 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:05:45" (1/1) ... [2024-11-16 19:05:45,440 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 19:05:45,441 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 19:05:45,441 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 19:05:45,441 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 19:05:45,442 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:05:45" (1/1) ... [2024-11-16 19:05:45,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 19:05:45,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 19:05:45,488 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 19:05:45,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 19:05:45,544 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-16 19:05:45,544 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-16 19:05:45,545 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-16 19:05:45,545 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-16 19:05:45,546 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-16 19:05:45,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 19:05:45,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 19:05:45,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-16 19:05:45,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 19:05:45,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 19:05:45,549 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-16 19:05:45,727 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 19:05:45,730 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 19:05:45,874 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-16 19:05:45,874 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 19:05:45,962 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 19:05:45,963 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 19:05:45,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:05:45 BoogieIcfgContainer [2024-11-16 19:05:45,964 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 19:05:45,966 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 19:05:45,966 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 19:05:45,973 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 19:05:45,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 07:05:44" (1/3) ... [2024-11-16 19:05:45,974 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39569085 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:05:45, skipping insertion in model container [2024-11-16 19:05:45,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:05:45" (2/3) ... [2024-11-16 19:05:45,975 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39569085 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:05:45, skipping insertion in model container [2024-11-16 19:05:45,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:05:45" (3/3) ... [2024-11-16 19:05:45,976 INFO L112 eAbstractionObserver]: Analyzing ICFG triangular-2.i [2024-11-16 19:05:45,991 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 19:05:45,991 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 19:05:45,992 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-16 19:05:46,028 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-16 19:05:46,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 30 transitions, 68 flow [2024-11-16 19:05:46,094 INFO L124 PetriNetUnfolderBase]: 5/28 cut-off events. [2024-11-16 19:05:46,095 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 19:05:46,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 28 events. 5/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 51 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 28. Up to 2 conditions per place. [2024-11-16 19:05:46,100 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 30 transitions, 68 flow [2024-11-16 19:05:46,103 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 28 transitions, 62 flow [2024-11-16 19:05:46,114 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 19:05:46,121 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;@b9f3884, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 19:05:46,121 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-16 19:05:46,139 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 19:05:46,142 INFO L124 PetriNetUnfolderBase]: 5/27 cut-off events. [2024-11-16 19:05:46,142 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 19:05:46,142 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:05:46,143 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:05:46,143 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-16 19:05:46,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:05:46,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1518046071, now seen corresponding path program 1 times [2024-11-16 19:05:46,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:05:46,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078444460] [2024-11-16 19:05:46,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:05:46,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:05:46,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:05:46,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:05:46,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:05:46,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078444460] [2024-11-16 19:05:46,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078444460] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:05:46,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:05:46,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 19:05:46,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551142487] [2024-11-16 19:05:46,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:05:46,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 19:05:46,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:05:46,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 19:05:46,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 19:05:46,671 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 30 [2024-11-16 19:05:46,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 28 transitions, 62 flow. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:05:46,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:05:46,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 30 [2024-11-16 19:05:46,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:05:46,954 INFO L124 PetriNetUnfolderBase]: 321/609 cut-off events. [2024-11-16 19:05:46,958 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 19:05:46,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1121 conditions, 609 events. 321/609 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3137 event pairs, 62 based on Foata normal form. 112/664 useless extension candidates. Maximal degree in co-relation 1111. Up to 221 conditions per place. [2024-11-16 19:05:46,970 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 25 selfloop transitions, 4 changer transitions 22/58 dead transitions. [2024-11-16 19:05:46,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 58 transitions, 224 flow [2024-11-16 19:05:46,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 19:05:46,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 19:05:46,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2024-11-16 19:05:46,987 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6555555555555556 [2024-11-16 19:05:46,989 INFO L175 Difference]: Start difference. First operand has 30 places, 28 transitions, 62 flow. Second operand 6 states and 118 transitions. [2024-11-16 19:05:46,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 58 transitions, 224 flow [2024-11-16 19:05:46,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 58 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 19:05:46,995 INFO L231 Difference]: Finished difference. Result has 37 places, 26 transitions, 79 flow [2024-11-16 19:05:46,999 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=79, PETRI_PLACES=37, PETRI_TRANSITIONS=26} [2024-11-16 19:05:47,005 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 7 predicate places. [2024-11-16 19:05:47,005 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 79 flow [2024-11-16 19:05:47,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:05:47,006 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:05:47,006 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:05:47,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 19:05:47,008 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-16 19:05:47,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:05:47,009 INFO L85 PathProgramCache]: Analyzing trace with hash -2109871830, now seen corresponding path program 1 times [2024-11-16 19:05:47,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:05:47,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764517899] [2024-11-16 19:05:47,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:05:47,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:05:47,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:05:47,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:05:47,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:05:47,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764517899] [2024-11-16 19:05:47,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764517899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:05:47,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:05:47,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 19:05:47,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20810912] [2024-11-16 19:05:47,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:05:47,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 19:05:47,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:05:47,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 19:05:47,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 19:05:47,182 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 30 [2024-11-16 19:05:47,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 79 flow. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:05:47,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:05:47,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 30 [2024-11-16 19:05:47,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:05:47,481 INFO L124 PetriNetUnfolderBase]: 382/791 cut-off events. [2024-11-16 19:05:47,481 INFO L125 PetriNetUnfolderBase]: For 291/297 co-relation queries the response was YES. [2024-11-16 19:05:47,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1688 conditions, 791 events. 382/791 cut-off events. For 291/297 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4305 event pairs, 65 based on Foata normal form. 33/757 useless extension candidates. Maximal degree in co-relation 1674. Up to 246 conditions per place. [2024-11-16 19:05:47,496 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 46 selfloop transitions, 9 changer transitions 20/82 dead transitions. [2024-11-16 19:05:47,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 82 transitions, 387 flow [2024-11-16 19:05:47,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 19:05:47,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-16 19:05:47,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions. [2024-11-16 19:05:47,518 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2024-11-16 19:05:47,519 INFO L175 Difference]: Start difference. First operand has 37 places, 26 transitions, 79 flow. Second operand 9 states and 153 transitions. [2024-11-16 19:05:47,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 82 transitions, 387 flow [2024-11-16 19:05:47,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 82 transitions, 371 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-11-16 19:05:47,523 INFO L231 Difference]: Finished difference. Result has 46 places, 35 transitions, 164 flow [2024-11-16 19:05:47,524 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=164, PETRI_PLACES=46, PETRI_TRANSITIONS=35} [2024-11-16 19:05:47,524 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 16 predicate places. [2024-11-16 19:05:47,525 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 164 flow [2024-11-16 19:05:47,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:05:47,525 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:05:47,525 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:05:47,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 19:05:47,526 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-16 19:05:47,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:05:47,527 INFO L85 PathProgramCache]: Analyzing trace with hash -280399476, now seen corresponding path program 2 times [2024-11-16 19:05:47,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:05:47,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226211068] [2024-11-16 19:05:47,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:05:47,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:05:47,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:05:47,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:05:47,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:05:47,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226211068] [2024-11-16 19:05:47,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226211068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:05:47,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:05:47,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 19:05:47,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307538442] [2024-11-16 19:05:47,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:05:47,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 19:05:47,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:05:47,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 19:05:47,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 19:05:47,690 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 30 [2024-11-16 19:05:47,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 164 flow. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:05:47,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:05:47,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 30 [2024-11-16 19:05:47,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:05:47,945 INFO L124 PetriNetUnfolderBase]: 373/806 cut-off events. [2024-11-16 19:05:47,946 INFO L125 PetriNetUnfolderBase]: For 1157/1181 co-relation queries the response was YES. [2024-11-16 19:05:47,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2073 conditions, 806 events. 373/806 cut-off events. For 1157/1181 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4579 event pairs, 80 based on Foata normal form. 54/778 useless extension candidates. Maximal degree in co-relation 2052. Up to 237 conditions per place. [2024-11-16 19:05:47,952 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 42 selfloop transitions, 15 changer transitions 32/96 dead transitions. [2024-11-16 19:05:47,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 96 transitions, 586 flow [2024-11-16 19:05:47,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 19:05:47,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-16 19:05:47,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 166 transitions. [2024-11-16 19:05:47,957 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5533333333333333 [2024-11-16 19:05:47,957 INFO L175 Difference]: Start difference. First operand has 46 places, 35 transitions, 164 flow. Second operand 10 states and 166 transitions. [2024-11-16 19:05:47,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 96 transitions, 586 flow [2024-11-16 19:05:47,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 96 transitions, 576 flow, removed 5 selfloop flow, removed 2 redundant places. [2024-11-16 19:05:47,968 INFO L231 Difference]: Finished difference. Result has 57 places, 43 transitions, 278 flow [2024-11-16 19:05:47,968 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=278, PETRI_PLACES=57, PETRI_TRANSITIONS=43} [2024-11-16 19:05:47,969 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 27 predicate places. [2024-11-16 19:05:47,970 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 43 transitions, 278 flow [2024-11-16 19:05:47,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:05:47,971 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:05:47,971 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:05:47,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 19:05:47,971 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-16 19:05:47,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:05:47,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1519403417, now seen corresponding path program 1 times [2024-11-16 19:05:47,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:05:47,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089327811] [2024-11-16 19:05:47,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:05:47,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:05:47,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:05:48,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:05:48,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:05:48,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089327811] [2024-11-16 19:05:48,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089327811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:05:48,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:05:48,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 19:05:48,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726680374] [2024-11-16 19:05:48,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:05:48,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 19:05:48,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:05:48,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 19:05:48,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 19:05:48,143 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 30 [2024-11-16 19:05:48,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 43 transitions, 278 flow. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:05:48,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:05:48,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 30 [2024-11-16 19:05:48,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:05:48,441 INFO L124 PetriNetUnfolderBase]: 508/1103 cut-off events. [2024-11-16 19:05:48,441 INFO L125 PetriNetUnfolderBase]: For 3675/3714 co-relation queries the response was YES. [2024-11-16 19:05:48,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3305 conditions, 1103 events. 508/1103 cut-off events. For 3675/3714 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6589 event pairs, 53 based on Foata normal form. 47/1050 useless extension candidates. Maximal degree in co-relation 3277. Up to 238 conditions per place. [2024-11-16 19:05:48,451 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 56 selfloop transitions, 21 changer transitions 23/107 dead transitions. [2024-11-16 19:05:48,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 107 transitions, 782 flow [2024-11-16 19:05:48,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 19:05:48,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-16 19:05:48,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 185 transitions. [2024-11-16 19:05:48,454 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5606060606060606 [2024-11-16 19:05:48,454 INFO L175 Difference]: Start difference. First operand has 57 places, 43 transitions, 278 flow. Second operand 11 states and 185 transitions. [2024-11-16 19:05:48,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 107 transitions, 782 flow [2024-11-16 19:05:48,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 107 transitions, 717 flow, removed 29 selfloop flow, removed 4 redundant places. [2024-11-16 19:05:48,468 INFO L231 Difference]: Finished difference. Result has 67 places, 49 transitions, 386 flow [2024-11-16 19:05:48,468 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=386, PETRI_PLACES=67, PETRI_TRANSITIONS=49} [2024-11-16 19:05:48,470 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 37 predicate places. [2024-11-16 19:05:48,470 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 49 transitions, 386 flow [2024-11-16 19:05:48,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:05:48,470 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:05:48,471 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:05:48,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 19:05:48,471 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-16 19:05:48,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:05:48,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1506852439, now seen corresponding path program 2 times [2024-11-16 19:05:48,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:05:48,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667052449] [2024-11-16 19:05:48,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:05:48,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:05:48,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:05:48,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:05:48,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:05:48,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667052449] [2024-11-16 19:05:48,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667052449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:05:48,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:05:48,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 19:05:48,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439402086] [2024-11-16 19:05:48,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:05:48,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 19:05:48,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:05:48,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 19:05:48,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 19:05:48,634 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 30 [2024-11-16 19:05:48,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 49 transitions, 386 flow. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:05:48,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:05:48,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 30 [2024-11-16 19:05:48,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:05:48,928 INFO L124 PetriNetUnfolderBase]: 481/1040 cut-off events. [2024-11-16 19:05:48,928 INFO L125 PetriNetUnfolderBase]: For 5689/5755 co-relation queries the response was YES. [2024-11-16 19:05:48,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3553 conditions, 1040 events. 481/1040 cut-off events. For 5689/5755 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 6120 event pairs, 59 based on Foata normal form. 77/1026 useless extension candidates. Maximal degree in co-relation 3520. Up to 154 conditions per place. [2024-11-16 19:05:48,938 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 45 selfloop transitions, 25 changer transitions 33/110 dead transitions. [2024-11-16 19:05:48,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 110 transitions, 978 flow [2024-11-16 19:05:48,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 19:05:48,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-16 19:05:48,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 182 transitions. [2024-11-16 19:05:48,940 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5515151515151515 [2024-11-16 19:05:48,940 INFO L175 Difference]: Start difference. First operand has 67 places, 49 transitions, 386 flow. Second operand 11 states and 182 transitions. [2024-11-16 19:05:48,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 110 transitions, 978 flow [2024-11-16 19:05:48,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 110 transitions, 901 flow, removed 27 selfloop flow, removed 6 redundant places. [2024-11-16 19:05:48,951 INFO L231 Difference]: Finished difference. Result has 74 places, 52 transitions, 482 flow [2024-11-16 19:05:48,952 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=482, PETRI_PLACES=74, PETRI_TRANSITIONS=52} [2024-11-16 19:05:48,952 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 44 predicate places. [2024-11-16 19:05:48,952 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 52 transitions, 482 flow [2024-11-16 19:05:48,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:05:48,953 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:05:48,953 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:05:48,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 19:05:48,953 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-16 19:05:48,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:05:48,954 INFO L85 PathProgramCache]: Analyzing trace with hash -635280593, now seen corresponding path program 1 times [2024-11-16 19:05:48,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:05:48,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553111098] [2024-11-16 19:05:48,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:05:48,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:05:48,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:05:49,114 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:05:49,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:05:49,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553111098] [2024-11-16 19:05:49,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553111098] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 19:05:49,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210332524] [2024-11-16 19:05:49,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:05:49,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 19:05:49,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 19:05:49,121 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 19:05:49,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 19:05:49,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:05:49,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-16 19:05:49,195 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 19:05:49,321 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:05:49,321 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 19:05:49,493 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:05:49,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210332524] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 19:05:49,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 19:05:49,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-11-16 19:05:49,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136825240] [2024-11-16 19:05:49,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 19:05:49,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 19:05:49,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:05:49,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 19:05:49,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-11-16 19:05:49,498 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 30 [2024-11-16 19:05:49,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 52 transitions, 482 flow. Second operand has 13 states, 13 states have (on average 11.153846153846153) internal successors, (145), 13 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:05:49,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:05:49,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 30 [2024-11-16 19:05:49,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:05:50,046 INFO L124 PetriNetUnfolderBase]: 589/1322 cut-off events. [2024-11-16 19:05:50,046 INFO L125 PetriNetUnfolderBase]: For 11166/11256 co-relation queries the response was YES. [2024-11-16 19:05:50,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4951 conditions, 1322 events. 589/1322 cut-off events. For 11166/11256 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 7499 event pairs, 149 based on Foata normal form. 88/1261 useless extension candidates. Maximal degree in co-relation 4915. Up to 486 conditions per place. [2024-11-16 19:05:50,055 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 65 selfloop transitions, 19 changer transitions 67/158 dead transitions. [2024-11-16 19:05:50,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 158 transitions, 1554 flow [2024-11-16 19:05:50,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-16 19:05:50,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-11-16 19:05:50,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 307 transitions. [2024-11-16 19:05:50,059 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5385964912280702 [2024-11-16 19:05:50,059 INFO L175 Difference]: Start difference. First operand has 74 places, 52 transitions, 482 flow. Second operand 19 states and 307 transitions. [2024-11-16 19:05:50,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 158 transitions, 1554 flow [2024-11-16 19:05:50,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 158 transitions, 1439 flow, removed 40 selfloop flow, removed 9 redundant places. [2024-11-16 19:05:50,075 INFO L231 Difference]: Finished difference. Result has 93 places, 58 transitions, 612 flow [2024-11-16 19:05:50,076 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=612, PETRI_PLACES=93, PETRI_TRANSITIONS=58} [2024-11-16 19:05:50,077 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 63 predicate places. [2024-11-16 19:05:50,078 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 58 transitions, 612 flow [2024-11-16 19:05:50,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.153846153846153) internal successors, (145), 13 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:05:50,079 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:05:50,079 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:05:50,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 19:05:50,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-16 19:05:50,284 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-16 19:05:50,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:05:50,285 INFO L85 PathProgramCache]: Analyzing trace with hash -792172533, now seen corresponding path program 2 times [2024-11-16 19:05:50,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:05:50,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662078619] [2024-11-16 19:05:50,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:05:50,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:05:50,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:05:50,415 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:05:50,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:05:50,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662078619] [2024-11-16 19:05:50,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662078619] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 19:05:50,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703431783] [2024-11-16 19:05:50,415 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 19:05:50,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 19:05:50,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 19:05:50,418 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 19:05:50,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 19:05:50,475 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-16 19:05:50,475 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 19:05:50,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-16 19:05:50,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 19:05:50,530 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:05:50,531 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 19:05:50,640 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:05:50,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703431783] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 19:05:50,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 19:05:50,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-11-16 19:05:50,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211092494] [2024-11-16 19:05:50,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 19:05:50,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 19:05:50,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:05:50,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 19:05:50,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-16 19:05:50,646 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 30 [2024-11-16 19:05:50,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 58 transitions, 612 flow. Second operand has 13 states, 13 states have (on average 11.153846153846153) internal successors, (145), 13 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:05:50,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:05:50,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 30 [2024-11-16 19:05:50,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:05:51,383 INFO L124 PetriNetUnfolderBase]: 877/1910 cut-off events. [2024-11-16 19:05:51,384 INFO L125 PetriNetUnfolderBase]: For 36897/37116 co-relation queries the response was YES. [2024-11-16 19:05:51,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9402 conditions, 1910 events. 877/1910 cut-off events. For 36897/37116 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 11935 event pairs, 68 based on Foata normal form. 102/1847 useless extension candidates. Maximal degree in co-relation 9357. Up to 309 conditions per place. [2024-11-16 19:05:51,401 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 88 selfloop transitions, 47 changer transitions 80/222 dead transitions. [2024-11-16 19:05:51,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 222 transitions, 2798 flow [2024-11-16 19:05:51,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-16 19:05:51,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2024-11-16 19:05:51,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 442 transitions. [2024-11-16 19:05:51,404 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5456790123456791 [2024-11-16 19:05:51,404 INFO L175 Difference]: Start difference. First operand has 93 places, 58 transitions, 612 flow. Second operand 27 states and 442 transitions. [2024-11-16 19:05:51,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 222 transitions, 2798 flow [2024-11-16 19:05:51,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 222 transitions, 2189 flow, removed 292 selfloop flow, removed 12 redundant places. [2024-11-16 19:05:51,438 INFO L231 Difference]: Finished difference. Result has 119 places, 74 transitions, 994 flow [2024-11-16 19:05:51,439 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=471, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=994, PETRI_PLACES=119, PETRI_TRANSITIONS=74} [2024-11-16 19:05:51,440 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 89 predicate places. [2024-11-16 19:05:51,440 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 74 transitions, 994 flow [2024-11-16 19:05:51,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.153846153846153) internal successors, (145), 13 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:05:51,440 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:05:51,440 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:05:51,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-16 19:05:51,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-16 19:05:51,641 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-16 19:05:51,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:05:51,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1390998023, now seen corresponding path program 1 times [2024-11-16 19:05:51,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:05:51,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859316445] [2024-11-16 19:05:51,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:05:51,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:05:51,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:05:51,798 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:05:51,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:05:51,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859316445] [2024-11-16 19:05:51,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859316445] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 19:05:51,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071791164] [2024-11-16 19:05:51,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:05:51,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 19:05:51,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 19:05:51,802 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 19:05:51,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-16 19:05:51,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:05:51,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-16 19:05:51,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 19:05:51,927 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:05:51,928 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 19:05:52,087 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:05:52,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071791164] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 19:05:52,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 19:05:52,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-11-16 19:05:52,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532099714] [2024-11-16 19:05:52,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 19:05:52,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-16 19:05:52,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:05:52,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-16 19:05:52,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2024-11-16 19:05:52,093 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 30 [2024-11-16 19:05:52,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 74 transitions, 994 flow. Second operand has 15 states, 15 states have (on average 11.066666666666666) internal successors, (166), 15 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:05:52,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:05:52,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 30 [2024-11-16 19:05:52,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:05:52,974 INFO L124 PetriNetUnfolderBase]: 1111/2510 cut-off events. [2024-11-16 19:05:52,974 INFO L125 PetriNetUnfolderBase]: For 82724/82936 co-relation queries the response was YES. [2024-11-16 19:05:52,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14599 conditions, 2510 events. 1111/2510 cut-off events. For 82724/82936 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 16969 event pairs, 153 based on Foata normal form. 98/2378 useless extension candidates. Maximal degree in co-relation 14542. Up to 490 conditions per place. [2024-11-16 19:05:52,998 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 99 selfloop transitions, 51 changer transitions 67/224 dead transitions. [2024-11-16 19:05:52,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 224 transitions, 3542 flow [2024-11-16 19:05:52,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-16 19:05:52,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2024-11-16 19:05:53,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 409 transitions. [2024-11-16 19:05:53,001 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5453333333333333 [2024-11-16 19:05:53,001 INFO L175 Difference]: Start difference. First operand has 119 places, 74 transitions, 994 flow. Second operand 25 states and 409 transitions. [2024-11-16 19:05:53,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 224 transitions, 3542 flow [2024-11-16 19:05:53,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 224 transitions, 2968 flow, removed 271 selfloop flow, removed 13 redundant places. [2024-11-16 19:05:53,075 INFO L231 Difference]: Finished difference. Result has 137 places, 85 transitions, 1276 flow [2024-11-16 19:05:53,075 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1276, PETRI_PLACES=137, PETRI_TRANSITIONS=85} [2024-11-16 19:05:53,076 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 107 predicate places. [2024-11-16 19:05:53,076 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 85 transitions, 1276 flow [2024-11-16 19:05:53,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 11.066666666666666) internal successors, (166), 15 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:05:53,077 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:05:53,077 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:05:53,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-16 19:05:53,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 19:05:53,282 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-16 19:05:53,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:05:53,282 INFO L85 PathProgramCache]: Analyzing trace with hash -415949327, now seen corresponding path program 2 times [2024-11-16 19:05:53,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:05:53,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788046885] [2024-11-16 19:05:53,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:05:53,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:05:53,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:05:53,423 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:05:53,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:05:53,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788046885] [2024-11-16 19:05:53,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788046885] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 19:05:53,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624849502] [2024-11-16 19:05:53,424 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 19:05:53,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 19:05:53,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 19:05:53,426 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 19:05:53,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-16 19:05:53,488 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-16 19:05:53,488 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 19:05:53,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-16 19:05:53,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 19:05:53,544 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:05:53,545 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 19:05:53,660 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:05:53,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624849502] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 19:05:53,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 19:05:53,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-11-16 19:05:53,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371333676] [2024-11-16 19:05:53,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 19:05:53,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-16 19:05:53,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:05:53,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-16 19:05:53,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-11-16 19:05:53,665 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 30 [2024-11-16 19:05:53,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 85 transitions, 1276 flow. Second operand has 16 states, 16 states have (on average 11.0625) internal successors, (177), 16 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:05:53,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:05:53,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 30 [2024-11-16 19:05:53,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:05:54,780 INFO L124 PetriNetUnfolderBase]: 1192/2720 cut-off events. [2024-11-16 19:05:54,780 INFO L125 PetriNetUnfolderBase]: For 125455/125655 co-relation queries the response was YES. [2024-11-16 19:05:54,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16915 conditions, 2720 events. 1192/2720 cut-off events. For 125455/125655 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 18591 event pairs, 65 based on Foata normal form. 176/2656 useless extension candidates. Maximal degree in co-relation 16852. Up to 477 conditions per place. [2024-11-16 19:05:54,810 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 86 selfloop transitions, 74 changer transitions 89/256 dead transitions. [2024-11-16 19:05:54,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 256 transitions, 4748 flow [2024-11-16 19:05:54,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-16 19:05:54,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2024-11-16 19:05:54,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 425 transitions. [2024-11-16 19:05:54,813 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5448717948717948 [2024-11-16 19:05:54,813 INFO L175 Difference]: Start difference. First operand has 137 places, 85 transitions, 1276 flow. Second operand 26 states and 425 transitions. [2024-11-16 19:05:54,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 256 transitions, 4748 flow [2024-11-16 19:05:54,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 256 transitions, 4015 flow, removed 330 selfloop flow, removed 18 redundant places. [2024-11-16 19:05:54,933 INFO L231 Difference]: Finished difference. Result has 154 places, 104 transitions, 1821 flow [2024-11-16 19:05:54,933 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=978, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=1821, PETRI_PLACES=154, PETRI_TRANSITIONS=104} [2024-11-16 19:05:54,934 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 124 predicate places. [2024-11-16 19:05:54,934 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 104 transitions, 1821 flow [2024-11-16 19:05:54,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.0625) internal successors, (177), 16 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:05:54,934 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:05:54,935 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:05:54,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-16 19:05:55,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 19:05:55,136 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-16 19:05:55,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:05:55,136 INFO L85 PathProgramCache]: Analyzing trace with hash -101294447, now seen corresponding path program 3 times [2024-11-16 19:05:55,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:05:55,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691868500] [2024-11-16 19:05:55,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:05:55,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:05:55,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:05:55,356 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:05:55,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:05:55,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691868500] [2024-11-16 19:05:55,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691868500] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 19:05:55,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69618662] [2024-11-16 19:05:55,357 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-16 19:05:55,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 19:05:55,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 19:05:55,359 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 19:05:55,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-16 19:05:55,419 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-16 19:05:55,419 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 19:05:55,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-16 19:05:55,421 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 19:05:55,502 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:05:55,502 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 19:05:55,680 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:05:55,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69618662] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 19:05:55,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 19:05:55,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 19 [2024-11-16 19:05:55,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140631648] [2024-11-16 19:05:55,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 19:05:55,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-16 19:05:55,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:05:55,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-16 19:05:55,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2024-11-16 19:05:55,685 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 30 [2024-11-16 19:05:55,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 104 transitions, 1821 flow. Second operand has 20 states, 20 states have (on average 11.2) internal successors, (224), 20 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:05:55,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:05:55,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 30 [2024-11-16 19:05:55,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:05:57,180 INFO L124 PetriNetUnfolderBase]: 1426/3185 cut-off events. [2024-11-16 19:05:57,180 INFO L125 PetriNetUnfolderBase]: For 186170/186629 co-relation queries the response was YES. [2024-11-16 19:05:57,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21621 conditions, 3185 events. 1426/3185 cut-off events. For 186170/186629 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 21178 event pairs, 40 based on Foata normal form. 102/3016 useless extension candidates. Maximal degree in co-relation 21550. Up to 555 conditions per place. [2024-11-16 19:05:57,225 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 114 selfloop transitions, 98 changer transitions 91/310 dead transitions. [2024-11-16 19:05:57,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 310 transitions, 6027 flow [2024-11-16 19:05:57,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-16 19:05:57,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2024-11-16 19:05:57,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 553 transitions. [2024-11-16 19:05:57,228 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.542156862745098 [2024-11-16 19:05:57,229 INFO L175 Difference]: Start difference. First operand has 154 places, 104 transitions, 1821 flow. Second operand 34 states and 553 transitions. [2024-11-16 19:05:57,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 310 transitions, 6027 flow [2024-11-16 19:05:57,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 310 transitions, 5060 flow, removed 457 selfloop flow, removed 17 redundant places. [2024-11-16 19:05:57,516 INFO L231 Difference]: Finished difference. Result has 179 places, 126 transitions, 2398 flow [2024-11-16 19:05:57,516 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1382, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=2398, PETRI_PLACES=179, PETRI_TRANSITIONS=126} [2024-11-16 19:05:57,517 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 149 predicate places. [2024-11-16 19:05:57,517 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 126 transitions, 2398 flow [2024-11-16 19:05:57,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 11.2) internal successors, (224), 20 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:05:57,517 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:05:57,518 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:05:57,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-16 19:05:57,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-16 19:05:57,718 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-16 19:05:57,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:05:57,719 INFO L85 PathProgramCache]: Analyzing trace with hash -671878623, now seen corresponding path program 4 times [2024-11-16 19:05:57,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:05:57,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275912778] [2024-11-16 19:05:57,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:05:57,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:05:57,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 19:05:57,730 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 19:05:57,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 19:05:57,764 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 19:05:57,764 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 19:05:57,765 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-11-16 19:05:57,770 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-11-16 19:05:57,770 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-11-16 19:05:57,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 19:05:57,771 INFO L407 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 1] [2024-11-16 19:05:57,867 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-16 19:05:57,867 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 19:05:57,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 07:05:57 BasicIcfg [2024-11-16 19:05:57,872 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 19:05:57,873 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 19:05:57,873 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 19:05:57,873 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 19:05:57,874 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:05:45" (3/4) ... [2024-11-16 19:05:57,875 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-16 19:05:57,958 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 19:05:57,958 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 19:05:57,959 INFO L158 Benchmark]: Toolchain (without parser) took 13200.37ms. Allocated memory was 142.6MB in the beginning and 423.6MB in the end (delta: 281.0MB). Free memory was 86.7MB in the beginning and 235.8MB in the end (delta: -149.0MB). Peak memory consumption was 133.1MB. Max. memory is 16.1GB. [2024-11-16 19:05:57,959 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 142.6MB. Free memory is still 103.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 19:05:57,959 INFO L158 Benchmark]: CACSL2BoogieTranslator took 579.59ms. Allocated memory is still 142.6MB. Free memory was 86.4MB in the beginning and 63.9MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-16 19:05:57,960 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.11ms. Allocated memory is still 142.6MB. Free memory was 63.9MB in the beginning and 62.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 19:05:57,960 INFO L158 Benchmark]: Boogie Preprocessor took 49.72ms. Allocated memory is still 142.6MB. Free memory was 61.9MB in the beginning and 60.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 19:05:57,960 INFO L158 Benchmark]: IcfgBuilder took 523.02ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 60.2MB in the beginning and 154.2MB in the end (delta: -94.0MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. [2024-11-16 19:05:57,960 INFO L158 Benchmark]: TraceAbstraction took 11906.49ms. Allocated memory was 192.9MB in the beginning and 423.6MB in the end (delta: 230.7MB). Free memory was 153.1MB in the beginning and 245.2MB in the end (delta: -92.1MB). Peak memory consumption was 138.6MB. Max. memory is 16.1GB. [2024-11-16 19:05:57,961 INFO L158 Benchmark]: Witness Printer took 85.92ms. Allocated memory is still 423.6MB. Free memory was 245.2MB in the beginning and 235.8MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-16 19:05:57,962 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 142.6MB. Free memory is still 103.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 579.59ms. Allocated memory is still 142.6MB. Free memory was 86.4MB in the beginning and 63.9MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.11ms. Allocated memory is still 142.6MB. Free memory was 63.9MB in the beginning and 62.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.72ms. Allocated memory is still 142.6MB. Free memory was 61.9MB in the beginning and 60.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 523.02ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 60.2MB in the beginning and 154.2MB in the end (delta: -94.0MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. * TraceAbstraction took 11906.49ms. Allocated memory was 192.9MB in the beginning and 423.6MB in the end (delta: 230.7MB). Free memory was 153.1MB in the beginning and 245.2MB in the end (delta: -92.1MB). Peak memory consumption was 138.6MB. Max. memory is 16.1GB. * Witness Printer took 85.92ms. Allocated memory is still 423.6MB. Free memory was 245.2MB in the beginning and 235.8MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 722]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L694] 0 int i = 3, j = 6; [L712] 0 pthread_t id1, id2; [L713] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=49, \old(argv)={50:51}, argc=49, i=3, id1=-1, j=6] [L696] 1 int k = 0; VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=6, k=0] [L714] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=49, \old(argv)={50:51}, arg={0:0}, argc=49, i=3, id1=-1, id2=0, j=6, k=0] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, i=3, j=6, k=0] [L704] 2 int k = 0; VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=0] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L716] 0 int condI = i >= (2*5 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=49, \old(argv)={50:51}, arg={0:0}, arg={0:0}, argc=49, condI=0, i=7, id1=-1, id2=0, j=6, k=0, k=1] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=1] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=2] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=3] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=4] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=4] [L719] 0 int condJ = j >= (2*5 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=49, \old(argv)={50:51}, arg={0:0}, arg={0:0}, argc=49, condI=0, condJ=1, i=15, id1=-1, id2=0, j=16, k=4, k=4] [L721] COND TRUE 0 condI || condJ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=49, \old(argv)={50:51}, arg={0:0}, arg={0:0}, argc=49, condI=0, condJ=1, i=15, id1=-1, id2=0, j=16, k=4, k=4] [L722] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=49, \old(argv)={50:51}, arg={0:0}, arg={0:0}, argc=49, condI=0, condJ=1, i=15, id1=-1, id2=0, j=16, k=4, k=4] - UnprovableResult [Line: 713]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 42 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.7s, OverallIterations: 11, TraceHistogramMax: 5, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1617 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1616 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 98 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2688 IncrementalHoareTripleChecker+Invalid, 2786 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 98 mSolverCounterUnsat, 0 mSDtfsCounter, 2688 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 450 GetRequests, 232 SyntacticMatches, 4 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1573 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2398occurred in iteration=10, InterpolantAutomatonStates: 178, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 384 NumberOfCodeBlocks, 384 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 448 ConstructedInterpolants, 0 QuantifiedInterpolants, 1801 SizeOfPredicates, 27 NumberOfNonLiveVariables, 502 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 20 InterpolantComputations, 5 PerfectInterpolantSequences, 0/180 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-16 19:05:57,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE