./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-atomic/lamport.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-atomic/lamport.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 6b308ef82643f3d5bfbffb17cfcc4180faf3590c2e3fc7a25c3079a0f6ea799c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:28:13,575 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:28:13,634 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 01:28:13,643 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:28:13,643 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:28:13,658 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:28:13,659 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:28:13,659 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:28:13,660 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:28:13,660 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:28:13,660 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:28:13,660 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:28:13,661 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:28:13,661 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:28:13,661 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:28:13,662 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:28:13,662 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:28:13,662 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:28:13,662 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 01:28:13,663 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:28:13,663 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:28:13,665 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:28:13,665 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:28:13,666 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:28:13,668 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:28:13,668 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:28:13,668 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:28:13,668 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:28:13,669 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:28:13,669 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:28:13,669 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:28:13,670 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:28:13,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:28:13,670 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:28:13,670 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:28:13,670 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:28:13,670 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 01:28:13,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 01:28:13,670 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:28:13,671 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:28:13,671 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:28:13,671 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:28:13,671 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 -> 6b308ef82643f3d5bfbffb17cfcc4180faf3590c2e3fc7a25c3079a0f6ea799c [2024-11-19 01:28:13,860 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:28:13,880 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:28:13,883 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:28:13,884 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:28:13,884 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:28:13,885 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-atomic/lamport.i [2024-11-19 01:28:15,170 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:28:15,352 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:28:15,353 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/lamport.i [2024-11-19 01:28:15,364 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/653898276/5d6b9cc47726464c90ad9050d72ebe4b/FLAG017ad552c [2024-11-19 01:28:15,378 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/653898276/5d6b9cc47726464c90ad9050d72ebe4b [2024-11-19 01:28:15,381 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:28:15,383 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:28:15,384 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:28:15,384 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:28:15,390 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:28:15,390 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:28:15" (1/1) ... [2024-11-19 01:28:15,392 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c9e1a60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:28:15, skipping insertion in model container [2024-11-19 01:28:15,393 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:28:15" (1/1) ... [2024-11-19 01:28:15,431 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:28:15,674 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-atomic/lamport.i[32541,32554] [2024-11-19 01:28:15,680 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-atomic/lamport.i[32909,32922] [2024-11-19 01:28:15,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:28:15,693 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:28:15,730 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-atomic/lamport.i[32541,32554] [2024-11-19 01:28:15,732 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-atomic/lamport.i[32909,32922] [2024-11-19 01:28:15,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:28:15,769 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:28:15,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:28:15 WrapperNode [2024-11-19 01:28:15,770 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:28:15,770 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:28:15,771 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:28:15,771 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:28:15,775 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:28:15" (1/1) ... [2024-11-19 01:28:15,785 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:28:15" (1/1) ... [2024-11-19 01:28:15,800 INFO L138 Inliner]: procedures = 166, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 31 [2024-11-19 01:28:15,800 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:28:15,801 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:28:15,801 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:28:15,801 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:28:15,809 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:28:15" (1/1) ... [2024-11-19 01:28:15,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:28:15" (1/1) ... [2024-11-19 01:28:15,813 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:28:15" (1/1) ... [2024-11-19 01:28:15,823 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-19 01:28:15,823 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:28:15" (1/1) ... [2024-11-19 01:28:15,823 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:28:15" (1/1) ... [2024-11-19 01:28:15,826 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:28:15" (1/1) ... [2024-11-19 01:28:15,829 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:28:15" (1/1) ... [2024-11-19 01:28:15,830 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:28:15" (1/1) ... [2024-11-19 01:28:15,831 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:28:15" (1/1) ... [2024-11-19 01:28:15,834 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:28:15,835 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:28:15,835 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:28:15,835 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:28:15,835 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:28:15" (1/1) ... [2024-11-19 01:28:15,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:28:15,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:28:15,863 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 01:28:15,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 01:28:15,895 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2024-11-19 01:28:15,896 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2024-11-19 01:28:15,896 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-11-19 01:28:15,896 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-11-19 01:28:15,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:28:15,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 01:28:15,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:28:15,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:28:15,897 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 01:28:15,988 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:28:15,989 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:28:16,109 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 01:28:16,110 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:28:16,154 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:28:16,155 INFO L316 CfgBuilder]: Removed 8 assume(true) statements. [2024-11-19 01:28:16,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:28:16 BoogieIcfgContainer [2024-11-19 01:28:16,155 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:28:16,158 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:28:16,158 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:28:16,161 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:28:16,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:28:15" (1/3) ... [2024-11-19 01:28:16,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7563a06e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:28:16, skipping insertion in model container [2024-11-19 01:28:16,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:28:15" (2/3) ... [2024-11-19 01:28:16,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7563a06e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:28:16, skipping insertion in model container [2024-11-19 01:28:16,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:28:16" (3/3) ... [2024-11-19 01:28:16,164 INFO L112 eAbstractionObserver]: Analyzing ICFG lamport.i [2024-11-19 01:28:16,177 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:28:16,178 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 01:28:16,178 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 01:28:16,234 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-19 01:28:16,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 70 transitions, 154 flow [2024-11-19 01:28:16,295 INFO L124 PetriNetUnfolderBase]: 18/68 cut-off events. [2024-11-19 01:28:16,295 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-19 01:28:16,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 68 events. 18/68 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 169 event pairs, 0 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 65. Up to 4 conditions per place. [2024-11-19 01:28:16,301 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 70 transitions, 154 flow [2024-11-19 01:28:16,305 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 66 transitions, 141 flow [2024-11-19 01:28:16,312 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:28:16,318 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;@1ca676d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:28:16,319 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-19 01:28:16,324 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 01:28:16,327 INFO L124 PetriNetUnfolderBase]: 3/19 cut-off events. [2024-11-19 01:28:16,327 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 01:28:16,327 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:28:16,328 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:28:16,328 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 01:28:16,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:28:16,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1168811722, now seen corresponding path program 1 times [2024-11-19 01:28:16,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:28:16,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129998751] [2024-11-19 01:28:16,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:28:16,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:28:16,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:28:16,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:28:16,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:28:16,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129998751] [2024-11-19 01:28:16,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129998751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:28:16,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:28:16,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 01:28:16,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656395826] [2024-11-19 01:28:16,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:28:16,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 01:28:16,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:28:16,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 01:28:16,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:28:16,562 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 70 [2024-11-19 01:28:16,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 66 transitions, 141 flow. Second operand has 2 states, 2 states have (on average 49.5) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:28:16,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:28:16,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 70 [2024-11-19 01:28:16,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:28:16,636 INFO L124 PetriNetUnfolderBase]: 126/341 cut-off events. [2024-11-19 01:28:16,636 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-19 01:28:16,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 495 conditions, 341 events. 126/341 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1587 event pairs, 34 based on Foata normal form. 59/325 useless extension candidates. Maximal degree in co-relation 459. Up to 137 conditions per place. [2024-11-19 01:28:16,644 INFO L140 encePairwiseOnDemand]: 64/70 looper letters, 14 selfloop transitions, 0 changer transitions 0/60 dead transitions. [2024-11-19 01:28:16,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 60 transitions, 157 flow [2024-11-19 01:28:16,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 01:28:16,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-19 01:28:16,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 116 transitions. [2024-11-19 01:28:16,654 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8285714285714286 [2024-11-19 01:28:16,655 INFO L175 Difference]: Start difference. First operand has 55 places, 66 transitions, 141 flow. Second operand 2 states and 116 transitions. [2024-11-19 01:28:16,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 60 transitions, 157 flow [2024-11-19 01:28:16,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 60 transitions, 152 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 01:28:16,659 INFO L231 Difference]: Finished difference. Result has 53 places, 60 transitions, 124 flow [2024-11-19 01:28:16,661 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=124, PETRI_PLACES=53, PETRI_TRANSITIONS=60} [2024-11-19 01:28:16,663 INFO L277 CegarLoopForPetriNet]: 55 programPoint places, -2 predicate places. [2024-11-19 01:28:16,663 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 60 transitions, 124 flow [2024-11-19 01:28:16,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 49.5) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:28:16,663 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:28:16,663 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:28:16,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 01:28:16,664 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 01:28:16,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:28:16,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1154901182, now seen corresponding path program 1 times [2024-11-19 01:28:16,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:28:16,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676076526] [2024-11-19 01:28:16,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:28:16,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:28:16,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:28:16,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:28:16,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:28:16,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676076526] [2024-11-19 01:28:16,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676076526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:28:16,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:28:16,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:28:16,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359977582] [2024-11-19 01:28:16,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:28:16,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:28:16,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:28:16,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:28:16,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:28:16,777 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 70 [2024-11-19 01:28:16,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 60 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:28:16,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:28:16,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 70 [2024-11-19 01:28:16,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:28:16,861 INFO L124 PetriNetUnfolderBase]: 204/496 cut-off events. [2024-11-19 01:28:16,861 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-19 01:28:16,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 770 conditions, 496 events. 204/496 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2704 event pairs, 40 based on Foata normal form. 18/434 useless extension candidates. Maximal degree in co-relation 767. Up to 154 conditions per place. [2024-11-19 01:28:16,868 INFO L140 encePairwiseOnDemand]: 65/70 looper letters, 22 selfloop transitions, 3 changer transitions 1/68 dead transitions. [2024-11-19 01:28:16,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 68 transitions, 193 flow [2024-11-19 01:28:16,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:28:16,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 01:28:16,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2024-11-19 01:28:16,869 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7619047619047619 [2024-11-19 01:28:16,869 INFO L175 Difference]: Start difference. First operand has 53 places, 60 transitions, 124 flow. Second operand 3 states and 160 transitions. [2024-11-19 01:28:16,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 68 transitions, 193 flow [2024-11-19 01:28:16,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 68 transitions, 193 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 01:28:16,872 INFO L231 Difference]: Finished difference. Result has 57 places, 61 transitions, 144 flow [2024-11-19 01:28:16,872 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=57, PETRI_TRANSITIONS=61} [2024-11-19 01:28:16,872 INFO L277 CegarLoopForPetriNet]: 55 programPoint places, 2 predicate places. [2024-11-19 01:28:16,873 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 61 transitions, 144 flow [2024-11-19 01:28:16,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:28:16,873 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:28:16,873 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:28:16,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 01:28:16,873 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr2Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 01:28:16,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:28:16,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1149312553, now seen corresponding path program 1 times [2024-11-19 01:28:16,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:28:16,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819291936] [2024-11-19 01:28:16,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:28:16,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:28:16,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:28:16,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:28:16,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:28:16,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819291936] [2024-11-19 01:28:16,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819291936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:28:16,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:28:16,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:28:16,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373150122] [2024-11-19 01:28:16,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:28:16,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:28:16,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:28:16,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:28:16,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:28:16,939 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 70 [2024-11-19 01:28:16,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 61 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:28:16,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:28:16,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 70 [2024-11-19 01:28:16,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:28:17,003 INFO L124 PetriNetUnfolderBase]: 212/518 cut-off events. [2024-11-19 01:28:17,003 INFO L125 PetriNetUnfolderBase]: For 106/106 co-relation queries the response was YES. [2024-11-19 01:28:17,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 917 conditions, 518 events. 212/518 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2870 event pairs, 59 based on Foata normal form. 17/447 useless extension candidates. Maximal degree in co-relation 912. Up to 207 conditions per place. [2024-11-19 01:28:17,008 INFO L140 encePairwiseOnDemand]: 66/70 looper letters, 21 selfloop transitions, 2 changer transitions 3/68 dead transitions. [2024-11-19 01:28:17,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 68 transitions, 211 flow [2024-11-19 01:28:17,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:28:17,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 01:28:17,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2024-11-19 01:28:17,013 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7619047619047619 [2024-11-19 01:28:17,013 INFO L175 Difference]: Start difference. First operand has 57 places, 61 transitions, 144 flow. Second operand 3 states and 160 transitions. [2024-11-19 01:28:17,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 68 transitions, 211 flow [2024-11-19 01:28:17,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 68 transitions, 205 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 01:28:17,015 INFO L231 Difference]: Finished difference. Result has 58 places, 61 transitions, 148 flow [2024-11-19 01:28:17,015 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=58, PETRI_TRANSITIONS=61} [2024-11-19 01:28:17,015 INFO L277 CegarLoopForPetriNet]: 55 programPoint places, 3 predicate places. [2024-11-19 01:28:17,015 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 61 transitions, 148 flow [2024-11-19 01:28:17,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:28:17,016 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:28:17,016 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:28:17,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 01:28:17,016 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 01:28:17,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:28:17,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1000099017, now seen corresponding path program 1 times [2024-11-19 01:28:17,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:28:17,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034578637] [2024-11-19 01:28:17,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:28:17,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:28:17,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:28:17,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:28:17,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:28:17,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034578637] [2024-11-19 01:28:17,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034578637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:28:17,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:28:17,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:28:17,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022701561] [2024-11-19 01:28:17,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:28:17,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:28:17,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:28:17,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:28:17,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:28:17,119 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 70 [2024-11-19 01:28:17,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 61 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:28:17,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:28:17,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 70 [2024-11-19 01:28:17,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:28:17,210 INFO L124 PetriNetUnfolderBase]: 406/925 cut-off events. [2024-11-19 01:28:17,210 INFO L125 PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES. [2024-11-19 01:28:17,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1630 conditions, 925 events. 406/925 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5710 event pairs, 142 based on Foata normal form. 15/865 useless extension candidates. Maximal degree in co-relation 1624. Up to 431 conditions per place. [2024-11-19 01:28:17,216 INFO L140 encePairwiseOnDemand]: 60/70 looper letters, 27 selfloop transitions, 5 changer transitions 1/71 dead transitions. [2024-11-19 01:28:17,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 71 transitions, 236 flow [2024-11-19 01:28:17,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:28:17,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 01:28:17,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2024-11-19 01:28:17,218 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7380952380952381 [2024-11-19 01:28:17,218 INFO L175 Difference]: Start difference. First operand has 58 places, 61 transitions, 148 flow. Second operand 3 states and 155 transitions. [2024-11-19 01:28:17,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 71 transitions, 236 flow [2024-11-19 01:28:17,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 71 transitions, 234 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 01:28:17,222 INFO L231 Difference]: Finished difference. Result has 61 places, 65 transitions, 192 flow [2024-11-19 01:28:17,222 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=192, PETRI_PLACES=61, PETRI_TRANSITIONS=65} [2024-11-19 01:28:17,224 INFO L277 CegarLoopForPetriNet]: 55 programPoint places, 6 predicate places. [2024-11-19 01:28:17,224 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 65 transitions, 192 flow [2024-11-19 01:28:17,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:28:17,225 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:28:17,225 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:28:17,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 01:28:17,226 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 01:28:17,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:28:17,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1261944621, now seen corresponding path program 2 times [2024-11-19 01:28:17,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:28:17,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85455051] [2024-11-19 01:28:17,227 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 01:28:17,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:28:17,243 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 01:28:17,244 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:28:17,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:28:17,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:28:17,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85455051] [2024-11-19 01:28:17,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85455051] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:28:17,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:28:17,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:28:17,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639161939] [2024-11-19 01:28:17,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:28:17,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:28:17,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:28:17,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:28:17,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:28:17,289 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 70 [2024-11-19 01:28:17,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 65 transitions, 192 flow. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:28:17,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:28:17,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 70 [2024-11-19 01:28:17,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:28:17,412 INFO L124 PetriNetUnfolderBase]: 557/1395 cut-off events. [2024-11-19 01:28:17,413 INFO L125 PetriNetUnfolderBase]: For 180/197 co-relation queries the response was YES. [2024-11-19 01:28:17,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2644 conditions, 1395 events. 557/1395 cut-off events. For 180/197 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 10050 event pairs, 145 based on Foata normal form. 20/1261 useless extension candidates. Maximal degree in co-relation 2637. Up to 351 conditions per place. [2024-11-19 01:28:17,418 INFO L140 encePairwiseOnDemand]: 65/70 looper letters, 27 selfloop transitions, 3 changer transitions 0/76 dead transitions. [2024-11-19 01:28:17,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 76 transitions, 277 flow [2024-11-19 01:28:17,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:28:17,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 01:28:17,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 161 transitions. [2024-11-19 01:28:17,420 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7666666666666667 [2024-11-19 01:28:17,420 INFO L175 Difference]: Start difference. First operand has 61 places, 65 transitions, 192 flow. Second operand 3 states and 161 transitions. [2024-11-19 01:28:17,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 76 transitions, 277 flow [2024-11-19 01:28:17,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 76 transitions, 267 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 01:28:17,424 INFO L231 Difference]: Finished difference. Result has 63 places, 68 transitions, 210 flow [2024-11-19 01:28:17,424 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=210, PETRI_PLACES=63, PETRI_TRANSITIONS=68} [2024-11-19 01:28:17,424 INFO L277 CegarLoopForPetriNet]: 55 programPoint places, 8 predicate places. [2024-11-19 01:28:17,425 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 68 transitions, 210 flow [2024-11-19 01:28:17,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:28:17,425 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:28:17,425 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:28:17,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 01:28:17,426 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 01:28:17,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:28:17,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1595243137, now seen corresponding path program 3 times [2024-11-19 01:28:17,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:28:17,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144615113] [2024-11-19 01:28:17,428 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 01:28:17,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:28:17,437 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 01:28:17,437 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:28:17,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:28:17,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:28:17,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144615113] [2024-11-19 01:28:17,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144615113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:28:17,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:28:17,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:28:17,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353079220] [2024-11-19 01:28:17,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:28:17,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:28:17,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:28:17,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:28:17,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:28:17,495 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 70 [2024-11-19 01:28:17,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 68 transitions, 210 flow. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:28:17,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:28:17,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 70 [2024-11-19 01:28:17,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:28:17,622 INFO L124 PetriNetUnfolderBase]: 598/1533 cut-off events. [2024-11-19 01:28:17,622 INFO L125 PetriNetUnfolderBase]: For 352/406 co-relation queries the response was YES. [2024-11-19 01:28:17,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3209 conditions, 1533 events. 598/1533 cut-off events. For 352/406 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 11311 event pairs, 249 based on Foata normal form. 61/1516 useless extension candidates. Maximal degree in co-relation 3201. Up to 694 conditions per place. [2024-11-19 01:28:17,628 INFO L140 encePairwiseOnDemand]: 60/70 looper letters, 23 selfloop transitions, 5 changer transitions 9/77 dead transitions. [2024-11-19 01:28:17,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 77 transitions, 309 flow [2024-11-19 01:28:17,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:28:17,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 01:28:17,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 154 transitions. [2024-11-19 01:28:17,629 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2024-11-19 01:28:17,629 INFO L175 Difference]: Start difference. First operand has 63 places, 68 transitions, 210 flow. Second operand 3 states and 154 transitions. [2024-11-19 01:28:17,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 77 transitions, 309 flow [2024-11-19 01:28:17,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 77 transitions, 303 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 01:28:17,632 INFO L231 Difference]: Finished difference. Result has 65 places, 65 transitions, 226 flow [2024-11-19 01:28:17,632 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=65, PETRI_TRANSITIONS=65} [2024-11-19 01:28:17,633 INFO L277 CegarLoopForPetriNet]: 55 programPoint places, 10 predicate places. [2024-11-19 01:28:17,634 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 65 transitions, 226 flow [2024-11-19 01:28:17,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:28:17,634 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:28:17,634 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:28:17,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 01:28:17,634 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 01:28:17,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:28:17,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1374516727, now seen corresponding path program 4 times [2024-11-19 01:28:17,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:28:17,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629086127] [2024-11-19 01:28:17,635 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 01:28:17,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:28:17,643 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 01:28:17,643 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:28:17,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:28:17,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:28:17,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629086127] [2024-11-19 01:28:17,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629086127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:28:17,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:28:17,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:28:17,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344346988] [2024-11-19 01:28:17,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:28:17,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:28:17,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:28:17,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:28:17,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:28:17,674 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 70 [2024-11-19 01:28:17,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 65 transitions, 226 flow. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:28:17,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:28:17,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 70 [2024-11-19 01:28:17,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:28:17,748 INFO L124 PetriNetUnfolderBase]: 359/1141 cut-off events. [2024-11-19 01:28:17,748 INFO L125 PetriNetUnfolderBase]: For 438/490 co-relation queries the response was YES. [2024-11-19 01:28:17,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2432 conditions, 1141 events. 359/1141 cut-off events. For 438/490 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 8916 event pairs, 124 based on Foata normal form. 19/1062 useless extension candidates. Maximal degree in co-relation 2423. Up to 275 conditions per place. [2024-11-19 01:28:17,752 INFO L140 encePairwiseOnDemand]: 66/70 looper letters, 22 selfloop transitions, 3 changer transitions 2/72 dead transitions. [2024-11-19 01:28:17,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 72 transitions, 299 flow [2024-11-19 01:28:17,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:28:17,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 01:28:17,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2024-11-19 01:28:17,754 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7619047619047619 [2024-11-19 01:28:17,754 INFO L175 Difference]: Start difference. First operand has 65 places, 65 transitions, 226 flow. Second operand 3 states and 160 transitions. [2024-11-19 01:28:17,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 72 transitions, 299 flow [2024-11-19 01:28:17,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 72 transitions, 289 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 01:28:17,757 INFO L231 Difference]: Finished difference. Result has 64 places, 63 transitions, 214 flow [2024-11-19 01:28:17,757 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=64, PETRI_TRANSITIONS=63} [2024-11-19 01:28:17,758 INFO L277 CegarLoopForPetriNet]: 55 programPoint places, 9 predicate places. [2024-11-19 01:28:17,758 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 63 transitions, 214 flow [2024-11-19 01:28:17,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:28:17,758 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:28:17,758 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:28:17,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 01:28:17,758 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 01:28:17,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:28:17,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1094404787, now seen corresponding path program 1 times [2024-11-19 01:28:17,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:28:17,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211059096] [2024-11-19 01:28:17,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:28:17,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:28:17,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:28:17,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:28:17,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:28:17,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211059096] [2024-11-19 01:28:17,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211059096] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:28:17,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:28:17,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:28:17,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350000354] [2024-11-19 01:28:17,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:28:17,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:28:17,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:28:17,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:28:17,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:28:17,803 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 70 [2024-11-19 01:28:17,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 63 transitions, 214 flow. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:28:17,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:28:17,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 70 [2024-11-19 01:28:17,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:28:17,859 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([350] L757-->thr1EXIT: Formula: (and (= |v_thr1Thread1of1ForFork1_#res.base_1| 0) (= |v_thr1Thread1of1ForFork1_#res.offset_1| 0)) InVars {} OutVars{thr1Thread1of1ForFork1_#res.offset=|v_thr1Thread1of1ForFork1_#res.offset_1|, thr1Thread1of1ForFork1_#res.base=|v_thr1Thread1of1ForFork1_#res.base_1|} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#res.base, thr1Thread1of1ForFork1_#res.offset][45], [60#true, Black: 80#(= 2 ~x~0), Black: 64#true, 90#(<= ~x~0 1), 32#L762-1true, Black: 85#(= 2 ~y~0), 3#L790true, Black: 71#(= ~X~0 1), 6#thr1EXITtrue, 62#true, 93#(= ~b2~0 1), Black: 75#(= ~y~0 1)]) [2024-11-19 01:28:17,859 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-11-19 01:28:17,859 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-11-19 01:28:17,859 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 01:28:17,859 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 01:28:17,876 INFO L124 PetriNetUnfolderBase]: 406/1195 cut-off events. [2024-11-19 01:28:17,876 INFO L125 PetriNetUnfolderBase]: For 218/253 co-relation queries the response was YES. [2024-11-19 01:28:17,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2449 conditions, 1195 events. 406/1195 cut-off events. For 218/253 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 9077 event pairs, 175 based on Foata normal form. 21/1126 useless extension candidates. Maximal degree in co-relation 2440. Up to 427 conditions per place. [2024-11-19 01:28:17,882 INFO L140 encePairwiseOnDemand]: 65/70 looper letters, 17 selfloop transitions, 4 changer transitions 0/68 dead transitions. [2024-11-19 01:28:17,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 68 transitions, 269 flow [2024-11-19 01:28:17,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:28:17,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 01:28:17,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 154 transitions. [2024-11-19 01:28:17,883 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2024-11-19 01:28:17,883 INFO L175 Difference]: Start difference. First operand has 64 places, 63 transitions, 214 flow. Second operand 3 states and 154 transitions. [2024-11-19 01:28:17,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 68 transitions, 269 flow [2024-11-19 01:28:17,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 68 transitions, 266 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 01:28:17,887 INFO L231 Difference]: Finished difference. Result has 66 places, 64 transitions, 229 flow [2024-11-19 01:28:17,887 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=229, PETRI_PLACES=66, PETRI_TRANSITIONS=64} [2024-11-19 01:28:17,888 INFO L277 CegarLoopForPetriNet]: 55 programPoint places, 11 predicate places. [2024-11-19 01:28:17,888 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 64 transitions, 229 flow [2024-11-19 01:28:17,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:28:17,890 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:28:17,890 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:28:17,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 01:28:17,890 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 01:28:17,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:28:17,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1670642357, now seen corresponding path program 1 times [2024-11-19 01:28:17,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:28:17,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64329698] [2024-11-19 01:28:17,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:28:17,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:28:17,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:28:17,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:28:17,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:28:17,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64329698] [2024-11-19 01:28:17,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64329698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:28:17,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:28:17,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:28:17,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142244568] [2024-11-19 01:28:17,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:28:17,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:28:17,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:28:17,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:28:17,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:28:17,928 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 70 [2024-11-19 01:28:17,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 64 transitions, 229 flow. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:28:17,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:28:17,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 70 [2024-11-19 01:28:17,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:28:18,029 INFO L124 PetriNetUnfolderBase]: 398/1204 cut-off events. [2024-11-19 01:28:18,029 INFO L125 PetriNetUnfolderBase]: For 227/255 co-relation queries the response was YES. [2024-11-19 01:28:18,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2577 conditions, 1204 events. 398/1204 cut-off events. For 227/255 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 8588 event pairs, 138 based on Foata normal form. 14/1147 useless extension candidates. Maximal degree in co-relation 2567. Up to 461 conditions per place. [2024-11-19 01:28:18,032 INFO L140 encePairwiseOnDemand]: 65/70 looper letters, 0 selfloop transitions, 0 changer transitions 66/66 dead transitions. [2024-11-19 01:28:18,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 66 transitions, 277 flow [2024-11-19 01:28:18,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:28:18,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 01:28:18,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2024-11-19 01:28:18,034 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7380952380952381 [2024-11-19 01:28:18,034 INFO L175 Difference]: Start difference. First operand has 66 places, 64 transitions, 229 flow. Second operand 3 states and 155 transitions. [2024-11-19 01:28:18,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 66 transitions, 277 flow [2024-11-19 01:28:18,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 66 transitions, 267 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-19 01:28:18,037 INFO L231 Difference]: Finished difference. Result has 62 places, 0 transitions, 0 flow [2024-11-19 01:28:18,037 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=62, PETRI_TRANSITIONS=0} [2024-11-19 01:28:18,038 INFO L277 CegarLoopForPetriNet]: 55 programPoint places, 7 predicate places. [2024-11-19 01:28:18,038 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 0 transitions, 0 flow [2024-11-19 01:28:18,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:28:18,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-11-19 01:28:18,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-11-19 01:28:18,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-11-19 01:28:18,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-19 01:28:18,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2024-11-19 01:28:18,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-11-19 01:28:18,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 01:28:18,042 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-11-19 01:28:18,046 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 01:28:18,046 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 01:28:18,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 01:28:18 BasicIcfg [2024-11-19 01:28:18,049 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 01:28:18,050 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 01:28:18,050 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 01:28:18,050 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 01:28:18,050 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:28:16" (3/4) ... [2024-11-19 01:28:18,051 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 01:28:18,053 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thr2 [2024-11-19 01:28:18,053 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thr1 [2024-11-19 01:28:18,056 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2024-11-19 01:28:18,056 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-19 01:28:18,056 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-19 01:28:18,056 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 01:28:18,114 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 01:28:18,114 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 01:28:18,114 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 01:28:18,116 INFO L158 Benchmark]: Toolchain (without parser) took 2732.04ms. Allocated memory was 161.5MB in the beginning and 224.4MB in the end (delta: 62.9MB). Free memory was 104.0MB in the beginning and 164.7MB in the end (delta: -60.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 01:28:18,117 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 161.5MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 01:28:18,117 INFO L158 Benchmark]: CACSL2BoogieTranslator took 385.58ms. Allocated memory is still 161.5MB. Free memory was 104.0MB in the beginning and 81.5MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-19 01:28:18,118 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.08ms. Allocated memory is still 161.5MB. Free memory was 81.5MB in the beginning and 79.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 01:28:18,118 INFO L158 Benchmark]: Boogie Preprocessor took 33.26ms. Allocated memory is still 161.5MB. Free memory was 79.5MB in the beginning and 77.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 01:28:18,118 INFO L158 Benchmark]: RCFGBuilder took 320.55ms. Allocated memory is still 161.5MB. Free memory was 77.4MB in the beginning and 59.2MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-19 01:28:18,119 INFO L158 Benchmark]: TraceAbstraction took 1891.75ms. Allocated memory was 161.5MB in the beginning and 224.4MB in the end (delta: 62.9MB). Free memory was 58.5MB in the beginning and 168.9MB in the end (delta: -110.3MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2024-11-19 01:28:18,119 INFO L158 Benchmark]: Witness Printer took 64.43ms. Allocated memory is still 224.4MB. Free memory was 168.9MB in the beginning and 164.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 01:28:18,120 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.11ms. Allocated memory is still 161.5MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 385.58ms. Allocated memory is still 161.5MB. Free memory was 104.0MB in the beginning and 81.5MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.08ms. Allocated memory is still 161.5MB. Free memory was 81.5MB in the beginning and 79.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.26ms. Allocated memory is still 161.5MB. Free memory was 79.5MB in the beginning and 77.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 320.55ms. Allocated memory is still 161.5MB. Free memory was 77.4MB in the beginning and 59.2MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1891.75ms. Allocated memory was 161.5MB in the beginning and 224.4MB in the end (delta: 62.9MB). Free memory was 58.5MB in the beginning and 168.9MB in the end (delta: -110.3MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. * Witness Printer took 64.43ms. Allocated memory is still 224.4MB. Free memory was 168.9MB in the beginning and 164.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 781]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 755]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 99 locations, 6 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: 1.8s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 169 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 91 mSDsluCounter, 25 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 337 IncrementalHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 25 mSDtfsCounter, 337 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=229occurred in iteration=8, InterpolantAutomatonStates: 26, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 185 NumberOfCodeBlocks, 184 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 176 ConstructedInterpolants, 0 QuantifiedInterpolants, 258 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-19 01:28:18,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE