./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-theta/unwind2-1.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-theta/unwind2-1.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 84506b1a5f2f1a1be74252915eb3882c15865a3a673842f14f5796dbb89eb736 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:57:46,957 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:57:47,012 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 01:57:47,018 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:57:47,019 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:57:47,043 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:57:47,044 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:57:47,045 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:57:47,046 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:57:47,047 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:57:47,048 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:57:47,048 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:57:47,048 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:57:47,049 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:57:47,050 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:57:47,050 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:57:47,051 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:57:47,051 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:57:47,051 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 01:57:47,051 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:57:47,052 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:57:47,054 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:57:47,054 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:57:47,054 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:57:47,054 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:57:47,055 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:57:47,055 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:57:47,055 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:57:47,055 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:57:47,055 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:57:47,056 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:57:47,056 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:57:47,056 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:57:47,056 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:57:47,056 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:57:47,057 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:57:47,057 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 01:57:47,057 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 01:57:47,058 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:57:47,058 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:57:47,059 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:57:47,059 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:57:47,059 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 -> 84506b1a5f2f1a1be74252915eb3882c15865a3a673842f14f5796dbb89eb736 [2024-11-19 01:57:47,268 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:57:47,287 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:57:47,289 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:57:47,290 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:57:47,290 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:57:47,291 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind2-1.i [2024-11-19 01:57:48,489 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:57:48,683 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:57:48,684 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind2-1.i [2024-11-19 01:57:48,699 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/293b32f00/8cf3b79bfdac444ebe305868158bcf84/FLAGc4b8c88d8 [2024-11-19 01:57:48,709 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/293b32f00/8cf3b79bfdac444ebe305868158bcf84 [2024-11-19 01:57:48,710 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:57:48,711 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:57:48,713 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:57:48,713 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:57:48,717 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:57:48,718 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:57:48" (1/1) ... [2024-11-19 01:57:48,718 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@293cdfd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:57:48, skipping insertion in model container [2024-11-19 01:57:48,718 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:57:48" (1/1) ... [2024-11-19 01:57:48,749 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:57:49,029 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-theta/unwind2-1.i[33026,33039] [2024-11-19 01:57:49,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:57:49,053 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:57:49,082 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-theta/unwind2-1.i[33026,33039] [2024-11-19 01:57:49,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:57:49,121 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:57:49,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:57:49 WrapperNode [2024-11-19 01:57:49,122 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:57:49,123 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:57:49,124 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:57:49,124 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:57:49,131 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:57:49" (1/1) ... [2024-11-19 01:57:49,144 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:57:49" (1/1) ... [2024-11-19 01:57:49,164 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 81 [2024-11-19 01:57:49,165 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:57:49,165 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:57:49,166 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:57:49,166 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:57:49,173 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:57:49" (1/1) ... [2024-11-19 01:57:49,174 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:57:49" (1/1) ... [2024-11-19 01:57:49,178 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:57:49" (1/1) ... [2024-11-19 01:57:49,195 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:57:49,196 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:57:49" (1/1) ... [2024-11-19 01:57:49,196 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:57:49" (1/1) ... [2024-11-19 01:57:49,200 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:57:49" (1/1) ... [2024-11-19 01:57:49,206 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:57:49" (1/1) ... [2024-11-19 01:57:49,207 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:57:49" (1/1) ... [2024-11-19 01:57:49,208 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:57:49" (1/1) ... [2024-11-19 01:57:49,214 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:57:49,215 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:57:49,215 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:57:49,215 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:57:49,216 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:57:49" (1/1) ... [2024-11-19 01:57:49,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:57:49,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:57:49,252 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:57:49,254 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:57:49,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:57:49,291 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2024-11-19 01:57:49,292 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2024-11-19 01:57:49,292 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2024-11-19 01:57:49,292 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2024-11-19 01:57:49,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 01:57:49,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:57:49,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:57:49,295 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:57:49,392 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:57:49,393 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:57:49,517 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 01:57:49,517 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:57:49,611 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:57:49,612 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 01:57:49,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:57:49 BoogieIcfgContainer [2024-11-19 01:57:49,612 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:57:49,615 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:57:49,615 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:57:49,618 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:57:49,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:57:48" (1/3) ... [2024-11-19 01:57:49,619 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fb6bf8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:57:49, skipping insertion in model container [2024-11-19 01:57:49,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:57:49" (2/3) ... [2024-11-19 01:57:49,619 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fb6bf8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:57:49, skipping insertion in model container [2024-11-19 01:57:49,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:57:49" (3/3) ... [2024-11-19 01:57:49,621 INFO L112 eAbstractionObserver]: Analyzing ICFG unwind2-1.i [2024-11-19 01:57:49,634 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:57:49,635 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 01:57:49,635 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 01:57:49,664 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-19 01:57:49,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 30 transitions, 74 flow [2024-11-19 01:57:49,713 INFO L124 PetriNetUnfolderBase]: 4/28 cut-off events. [2024-11-19 01:57:49,714 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-19 01:57:49,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 28 events. 4/28 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 34 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2024-11-19 01:57:49,719 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 30 transitions, 74 flow [2024-11-19 01:57:49,722 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 26 transitions, 61 flow [2024-11-19 01:57:49,732 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:57:49,738 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;@3cc4b631, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:57:49,738 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-19 01:57:49,749 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 01:57:49,750 INFO L124 PetriNetUnfolderBase]: 3/17 cut-off events. [2024-11-19 01:57:49,750 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 01:57:49,750 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:57:49,750 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:57:49,751 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-19 01:57:49,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:57:49,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1841696643, now seen corresponding path program 1 times [2024-11-19 01:57:49,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:57:49,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571111495] [2024-11-19 01:57:49,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:57:49,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:57:49,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:57:50,073 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:57:50,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:57:50,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571111495] [2024-11-19 01:57:50,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571111495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:57:50,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:57:50,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:57:50,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206713446] [2024-11-19 01:57:50,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:57:50,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:57:50,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:57:50,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:57:50,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:57:50,112 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2024-11-19 01:57:50,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 26 transitions, 61 flow. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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:57:50,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:57:50,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2024-11-19 01:57:50,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:57:50,319 INFO L124 PetriNetUnfolderBase]: 211/450 cut-off events. [2024-11-19 01:57:50,319 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-11-19 01:57:50,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 840 conditions, 450 events. 211/450 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2194 event pairs, 26 based on Foata normal form. 48/420 useless extension candidates. Maximal degree in co-relation 780. Up to 153 conditions per place. [2024-11-19 01:57:50,325 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 49 selfloop transitions, 8 changer transitions 0/63 dead transitions. [2024-11-19 01:57:50,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 63 transitions, 261 flow [2024-11-19 01:57:50,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:57:50,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-19 01:57:50,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions. [2024-11-19 01:57:50,335 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.580952380952381 [2024-11-19 01:57:50,337 INFO L175 Difference]: Start difference. First operand has 29 places, 26 transitions, 61 flow. Second operand 7 states and 122 transitions. [2024-11-19 01:57:50,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 63 transitions, 261 flow [2024-11-19 01:57:50,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 63 transitions, 251 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 01:57:50,343 INFO L231 Difference]: Finished difference. Result has 35 places, 29 transitions, 101 flow [2024-11-19 01:57:50,345 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=101, PETRI_PLACES=35, PETRI_TRANSITIONS=29} [2024-11-19 01:57:50,349 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 6 predicate places. [2024-11-19 01:57:50,349 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 29 transitions, 101 flow [2024-11-19 01:57:50,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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:57:50,350 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:57:50,350 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:57:50,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 01:57:50,350 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-19 01:57:50,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:57:50,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1257990492, now seen corresponding path program 1 times [2024-11-19 01:57:50,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:57:50,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878966160] [2024-11-19 01:57:50,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:57:50,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:57:50,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:57:50,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:57:50,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:57:50,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878966160] [2024-11-19 01:57:50,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878966160] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:57:50,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754177667] [2024-11-19 01:57:50,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:57:50,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:57:50,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:57:50,506 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:57:50,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 01:57:50,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:57:50,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 01:57:50,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:57:50,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:57:50,636 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:57:50,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:57:50,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754177667] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:57:50,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 01:57:50,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2024-11-19 01:57:50,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857215145] [2024-11-19 01:57:50,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 01:57:50,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 01:57:50,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:57:50,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 01:57:50,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-19 01:57:50,703 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2024-11-19 01:57:50,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 101 flow. Second operand has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 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:57:50,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:57:50,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2024-11-19 01:57:50,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:57:51,022 INFO L124 PetriNetUnfolderBase]: 424/821 cut-off events. [2024-11-19 01:57:51,023 INFO L125 PetriNetUnfolderBase]: For 123/131 co-relation queries the response was YES. [2024-11-19 01:57:51,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1878 conditions, 821 events. 424/821 cut-off events. For 123/131 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4339 event pairs, 61 based on Foata normal form. 8/672 useless extension candidates. Maximal degree in co-relation 1714. Up to 274 conditions per place. [2024-11-19 01:57:51,030 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 60 selfloop transitions, 14 changer transitions 3/85 dead transitions. [2024-11-19 01:57:51,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 85 transitions, 395 flow [2024-11-19 01:57:51,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 01:57:51,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-19 01:57:51,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2024-11-19 01:57:51,034 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5444444444444444 [2024-11-19 01:57:51,035 INFO L175 Difference]: Start difference. First operand has 35 places, 29 transitions, 101 flow. Second operand 9 states and 147 transitions. [2024-11-19 01:57:51,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 85 transitions, 395 flow [2024-11-19 01:57:51,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 85 transitions, 384 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-11-19 01:57:51,040 INFO L231 Difference]: Finished difference. Result has 42 places, 36 transitions, 160 flow [2024-11-19 01:57:51,041 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=160, PETRI_PLACES=42, PETRI_TRANSITIONS=36} [2024-11-19 01:57:51,041 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 13 predicate places. [2024-11-19 01:57:51,042 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 160 flow [2024-11-19 01:57:51,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 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:57:51,042 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:57:51,042 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:57:51,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 01:57:51,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:57:51,247 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-19 01:57:51,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:57:51,247 INFO L85 PathProgramCache]: Analyzing trace with hash -592937479, now seen corresponding path program 1 times [2024-11-19 01:57:51,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:57:51,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819086417] [2024-11-19 01:57:51,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:57:51,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:57:51,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:57:51,316 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:57:51,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:57:51,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819086417] [2024-11-19 01:57:51,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819086417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:57:51,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:57:51,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:57:51,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825350811] [2024-11-19 01:57:51,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:57:51,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:57:51,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:57:51,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:57:51,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:57:51,325 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2024-11-19 01:57:51,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 160 flow. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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:57:51,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:57:51,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2024-11-19 01:57:51,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:57:51,477 INFO L124 PetriNetUnfolderBase]: 425/915 cut-off events. [2024-11-19 01:57:51,477 INFO L125 PetriNetUnfolderBase]: For 933/947 co-relation queries the response was YES. [2024-11-19 01:57:51,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2406 conditions, 915 events. 425/915 cut-off events. For 933/947 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 5313 event pairs, 89 based on Foata normal form. 0/828 useless extension candidates. Maximal degree in co-relation 1816. Up to 298 conditions per place. [2024-11-19 01:57:51,483 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 70 selfloop transitions, 10 changer transitions 0/88 dead transitions. [2024-11-19 01:57:51,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 88 transitions, 610 flow [2024-11-19 01:57:51,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:57:51,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-19 01:57:51,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions. [2024-11-19 01:57:51,487 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-11-19 01:57:51,487 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 160 flow. Second operand 7 states and 112 transitions. [2024-11-19 01:57:51,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 88 transitions, 610 flow [2024-11-19 01:57:51,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 88 transitions, 564 flow, removed 20 selfloop flow, removed 2 redundant places. [2024-11-19 01:57:51,494 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 208 flow [2024-11-19 01:57:51,494 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=208, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2024-11-19 01:57:51,495 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 20 predicate places. [2024-11-19 01:57:51,495 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 208 flow [2024-11-19 01:57:51,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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:57:51,496 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:57:51,496 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:57:51,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 01:57:51,497 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-19 01:57:51,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:57:51,497 INFO L85 PathProgramCache]: Analyzing trace with hash 342968995, now seen corresponding path program 2 times [2024-11-19 01:57:51,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:57:51,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391079515] [2024-11-19 01:57:51,497 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 01:57:51,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:57:51,506 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 01:57:51,506 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:57:51,575 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:57:51,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:57:51,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391079515] [2024-11-19 01:57:51,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391079515] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:57:51,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030065497] [2024-11-19 01:57:51,576 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 01:57:51,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:57:51,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:57:51,578 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:57:51,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 01:57:51,627 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 01:57:51,627 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:57:51,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 01:57:51,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:57:51,697 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:57:51,699 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:57:51,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030065497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:57:51,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:57:51,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2024-11-19 01:57:51,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220875383] [2024-11-19 01:57:51,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:57:51,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 01:57:51,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:57:51,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 01:57:51,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-19 01:57:51,708 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2024-11-19 01:57:51,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 208 flow. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:57:51,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:57:51,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2024-11-19 01:57:51,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:57:51,937 INFO L124 PetriNetUnfolderBase]: 373/802 cut-off events. [2024-11-19 01:57:51,937 INFO L125 PetriNetUnfolderBase]: For 755/765 co-relation queries the response was YES. [2024-11-19 01:57:51,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2434 conditions, 802 events. 373/802 cut-off events. For 755/765 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4543 event pairs, 85 based on Foata normal form. 26/754 useless extension candidates. Maximal degree in co-relation 2321. Up to 309 conditions per place. [2024-11-19 01:57:51,941 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 67 selfloop transitions, 13 changer transitions 6/94 dead transitions. [2024-11-19 01:57:51,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 94 transitions, 611 flow [2024-11-19 01:57:51,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 01:57:51,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-19 01:57:51,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 154 transitions. [2024-11-19 01:57:51,943 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5133333333333333 [2024-11-19 01:57:51,944 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 208 flow. Second operand 10 states and 154 transitions. [2024-11-19 01:57:51,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 94 transitions, 611 flow [2024-11-19 01:57:51,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 94 transitions, 578 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-11-19 01:57:51,951 INFO L231 Difference]: Finished difference. Result has 57 places, 44 transitions, 246 flow [2024-11-19 01:57:51,951 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=246, PETRI_PLACES=57, PETRI_TRANSITIONS=44} [2024-11-19 01:57:51,952 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 28 predicate places. [2024-11-19 01:57:51,953 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 44 transitions, 246 flow [2024-11-19 01:57:51,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:57:51,953 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:57:51,953 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:57:51,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 01:57:52,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-19 01:57:52,158 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-19 01:57:52,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:57:52,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1201223248, now seen corresponding path program 1 times [2024-11-19 01:57:52,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:57:52,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330627025] [2024-11-19 01:57:52,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:57:52,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:57:52,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:57:52,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:57:52,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:57:52,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330627025] [2024-11-19 01:57:52,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330627025] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:57:52,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840788027] [2024-11-19 01:57:52,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:57:52,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:57:52,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:57:52,224 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:57:52,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 01:57:52,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:57:52,266 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 01:57:52,267 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:57:52,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:57:52,302 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:57:52,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:57:52,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840788027] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:57:52,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 01:57:52,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-11-19 01:57:52,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516021054] [2024-11-19 01:57:52,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 01:57:52,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 01:57:52,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:57:52,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 01:57:52,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-19 01:57:52,352 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2024-11-19 01:57:52,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 44 transitions, 246 flow. Second operand has 11 states, 11 states have (on average 9.727272727272727) internal successors, (107), 11 states have internal predecessors, (107), 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:57:52,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:57:52,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2024-11-19 01:57:52,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:57:52,562 INFO L124 PetriNetUnfolderBase]: 437/919 cut-off events. [2024-11-19 01:57:52,563 INFO L125 PetriNetUnfolderBase]: For 1262/1280 co-relation queries the response was YES. [2024-11-19 01:57:52,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2865 conditions, 919 events. 437/919 cut-off events. For 1262/1280 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5274 event pairs, 108 based on Foata normal form. 0/833 useless extension candidates. Maximal degree in co-relation 2600. Up to 351 conditions per place. [2024-11-19 01:57:52,569 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 76 selfloop transitions, 15 changer transitions 1/100 dead transitions. [2024-11-19 01:57:52,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 100 transitions, 761 flow [2024-11-19 01:57:52,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 01:57:52,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-19 01:57:52,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions. [2024-11-19 01:57:52,570 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-11-19 01:57:52,570 INFO L175 Difference]: Start difference. First operand has 57 places, 44 transitions, 246 flow. Second operand 9 states and 144 transitions. [2024-11-19 01:57:52,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 100 transitions, 761 flow [2024-11-19 01:57:52,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 100 transitions, 741 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-11-19 01:57:52,578 INFO L231 Difference]: Finished difference. Result has 64 places, 47 transitions, 298 flow [2024-11-19 01:57:52,578 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=298, PETRI_PLACES=64, PETRI_TRANSITIONS=47} [2024-11-19 01:57:52,580 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 35 predicate places. [2024-11-19 01:57:52,581 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 47 transitions, 298 flow [2024-11-19 01:57:52,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.727272727272727) internal successors, (107), 11 states have internal predecessors, (107), 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:57:52,581 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:57:52,581 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:57:52,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 01:57:52,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:57:52,783 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting f1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-19 01:57:52,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:57:52,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1929875536, now seen corresponding path program 1 times [2024-11-19 01:57:52,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:57:52,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239907665] [2024-11-19 01:57:52,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:57:52,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:57:52,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:57:52,857 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:57:52,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:57:52,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239907665] [2024-11-19 01:57:52,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239907665] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:57:52,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:57:52,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:57:52,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976136640] [2024-11-19 01:57:52,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:57:52,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:57:52,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:57:52,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:57:52,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:57:52,863 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2024-11-19 01:57:52,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 47 transitions, 298 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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:57:52,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:57:52,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2024-11-19 01:57:52,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:57:52,983 INFO L124 PetriNetUnfolderBase]: 395/833 cut-off events. [2024-11-19 01:57:52,983 INFO L125 PetriNetUnfolderBase]: For 1439/1455 co-relation queries the response was YES. [2024-11-19 01:57:52,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2964 conditions, 833 events. 395/833 cut-off events. For 1439/1455 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4551 event pairs, 115 based on Foata normal form. 12/772 useless extension candidates. Maximal degree in co-relation 2682. Up to 417 conditions per place. [2024-11-19 01:57:52,987 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 47 selfloop transitions, 12 changer transitions 1/67 dead transitions. [2024-11-19 01:57:52,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 67 transitions, 545 flow [2024-11-19 01:57:52,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:57:52,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 01:57:52,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2024-11-19 01:57:52,989 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2024-11-19 01:57:52,989 INFO L175 Difference]: Start difference. First operand has 64 places, 47 transitions, 298 flow. Second operand 6 states and 93 transitions. [2024-11-19 01:57:52,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 67 transitions, 545 flow [2024-11-19 01:57:52,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 67 transitions, 496 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-11-19 01:57:52,995 INFO L231 Difference]: Finished difference. Result has 63 places, 45 transitions, 279 flow [2024-11-19 01:57:52,995 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=279, PETRI_PLACES=63, PETRI_TRANSITIONS=45} [2024-11-19 01:57:52,996 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 34 predicate places. [2024-11-19 01:57:52,996 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 45 transitions, 279 flow [2024-11-19 01:57:52,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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:57:52,996 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:57:52,996 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:57:52,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 01:57:52,997 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-19 01:57:52,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:57:52,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1782392078, now seen corresponding path program 1 times [2024-11-19 01:57:52,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:57:52,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054760851] [2024-11-19 01:57:52,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:57:52,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:57:53,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:57:53,040 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:57:53,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:57:53,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054760851] [2024-11-19 01:57:53,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054760851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:57:53,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:57:53,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:57:53,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229922298] [2024-11-19 01:57:53,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:57:53,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:57:53,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:57:53,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:57:53,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:57:53,046 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2024-11-19 01:57:53,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 45 transitions, 279 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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:57:53,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:57:53,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2024-11-19 01:57:53,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:57:53,176 INFO L124 PetriNetUnfolderBase]: 409/878 cut-off events. [2024-11-19 01:57:53,176 INFO L125 PetriNetUnfolderBase]: For 1516/1540 co-relation queries the response was YES. [2024-11-19 01:57:53,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2934 conditions, 878 events. 409/878 cut-off events. For 1516/1540 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4918 event pairs, 114 based on Foata normal form. 0/801 useless extension candidates. Maximal degree in co-relation 2811. Up to 439 conditions per place. [2024-11-19 01:57:53,180 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 51 selfloop transitions, 12 changer transitions 2/72 dead transitions. [2024-11-19 01:57:53,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 72 transitions, 551 flow [2024-11-19 01:57:53,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:57:53,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 01:57:53,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2024-11-19 01:57:53,182 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5388888888888889 [2024-11-19 01:57:53,182 INFO L175 Difference]: Start difference. First operand has 63 places, 45 transitions, 279 flow. Second operand 6 states and 97 transitions. [2024-11-19 01:57:53,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 72 transitions, 551 flow [2024-11-19 01:57:53,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 72 transitions, 522 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-11-19 01:57:53,187 INFO L231 Difference]: Finished difference. Result has 65 places, 46 transitions, 296 flow [2024-11-19 01:57:53,187 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=296, PETRI_PLACES=65, PETRI_TRANSITIONS=46} [2024-11-19 01:57:53,187 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 36 predicate places. [2024-11-19 01:57:53,188 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 46 transitions, 296 flow [2024-11-19 01:57:53,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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:57:53,188 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:57:53,188 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:57:53,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 01:57:53,189 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-19 01:57:53,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:57:53,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1416754393, now seen corresponding path program 2 times [2024-11-19 01:57:53,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:57:53,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916821467] [2024-11-19 01:57:53,190 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 01:57:53,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:57:53,197 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 01:57:53,198 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:57:53,308 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:57:53,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:57:53,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916821467] [2024-11-19 01:57:53,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916821467] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:57:53,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704973248] [2024-11-19 01:57:53,309 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 01:57:53,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:57:53,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:57:53,313 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:57:53,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 01:57:53,372 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 01:57:53,372 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:57:53,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 01:57:53,375 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:57:53,489 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:57:53,489 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:57:53,643 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:57:53,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704973248] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:57:53,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 01:57:53,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2024-11-19 01:57:53,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909992660] [2024-11-19 01:57:53,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 01:57:53,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 01:57:53,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:57:53,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 01:57:53,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2024-11-19 01:57:53,663 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-11-19 01:57:53,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 46 transitions, 296 flow. Second operand has 18 states, 18 states have (on average 7.444444444444445) internal successors, (134), 18 states have internal predecessors, (134), 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:57:53,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:57:53,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-11-19 01:57:53,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:57:54,022 INFO L124 PetriNetUnfolderBase]: 751/1392 cut-off events. [2024-11-19 01:57:54,022 INFO L125 PetriNetUnfolderBase]: For 2958/3010 co-relation queries the response was YES. [2024-11-19 01:57:54,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5016 conditions, 1392 events. 751/1392 cut-off events. For 2958/3010 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7668 event pairs, 127 based on Foata normal form. 0/1264 useless extension candidates. Maximal degree in co-relation 4610. Up to 375 conditions per place. [2024-11-19 01:57:54,030 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 106 selfloop transitions, 22 changer transitions 31/164 dead transitions. [2024-11-19 01:57:54,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 164 transitions, 1325 flow [2024-11-19 01:57:54,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 01:57:54,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-11-19 01:57:54,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 216 transitions. [2024-11-19 01:57:54,033 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48 [2024-11-19 01:57:54,033 INFO L175 Difference]: Start difference. First operand has 65 places, 46 transitions, 296 flow. Second operand 15 states and 216 transitions. [2024-11-19 01:57:54,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 164 transitions, 1325 flow [2024-11-19 01:57:54,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 164 transitions, 1284 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-11-19 01:57:54,043 INFO L231 Difference]: Finished difference. Result has 82 places, 52 transitions, 409 flow [2024-11-19 01:57:54,044 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=409, PETRI_PLACES=82, PETRI_TRANSITIONS=52} [2024-11-19 01:57:54,044 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 53 predicate places. [2024-11-19 01:57:54,045 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 52 transitions, 409 flow [2024-11-19 01:57:54,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.444444444444445) internal successors, (134), 18 states have internal predecessors, (134), 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:57:54,045 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:57:54,045 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:57:54,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 01:57:54,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:57:54,250 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-19 01:57:54,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:57:54,250 INFO L85 PathProgramCache]: Analyzing trace with hash -580451013, now seen corresponding path program 1 times [2024-11-19 01:57:54,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:57:54,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799906385] [2024-11-19 01:57:54,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:57:54,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:57:54,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:57:54,258 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 01:57:54,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:57:54,299 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 01:57:54,299 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 01:57:54,300 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-11-19 01:57:54,301 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2024-11-19 01:57:54,302 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-11-19 01:57:54,302 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2024-11-19 01:57:54,302 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2024-11-19 01:57:54,302 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-11-19 01:57:54,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 01:57:54,302 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1] [2024-11-19 01:57:54,330 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 01:57:54,330 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 01:57:54,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 01:57:54 BasicIcfg [2024-11-19 01:57:54,333 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 01:57:54,334 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 01:57:54,334 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 01:57:54,334 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 01:57:54,335 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:57:49" (3/4) ... [2024-11-19 01:57:54,336 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-19 01:57:54,373 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 01:57:54,373 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 01:57:54,374 INFO L158 Benchmark]: Toolchain (without parser) took 5662.42ms. Allocated memory was 142.6MB in the beginning and 232.8MB in the end (delta: 90.2MB). Free memory was 69.2MB in the beginning and 190.9MB in the end (delta: -121.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 01:57:54,374 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 142.6MB. Free memory is still 114.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 01:57:54,374 INFO L158 Benchmark]: CACSL2BoogieTranslator took 408.88ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 69.1MB in the beginning and 152.2MB in the end (delta: -83.2MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2024-11-19 01:57:54,374 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.74ms. Allocated memory is still 192.9MB. Free memory was 152.2MB in the beginning and 150.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 01:57:54,374 INFO L158 Benchmark]: Boogie Preprocessor took 48.68ms. Allocated memory is still 192.9MB. Free memory was 150.1MB in the beginning and 148.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 01:57:54,374 INFO L158 Benchmark]: RCFGBuilder took 397.69ms. Allocated memory is still 192.9MB. Free memory was 148.0MB in the beginning and 126.0MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-19 01:57:54,375 INFO L158 Benchmark]: TraceAbstraction took 4719.06ms. Allocated memory was 192.9MB in the beginning and 232.8MB in the end (delta: 39.8MB). Free memory was 126.0MB in the beginning and 194.1MB in the end (delta: -68.1MB). Peak memory consumption was 101.8MB. Max. memory is 16.1GB. [2024-11-19 01:57:54,375 INFO L158 Benchmark]: Witness Printer took 39.37ms. Allocated memory is still 232.8MB. Free memory was 194.1MB in the beginning and 190.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 01:57:54,376 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.14ms. Allocated memory is still 142.6MB. Free memory is still 114.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 408.88ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 69.1MB in the beginning and 152.2MB in the end (delta: -83.2MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.74ms. Allocated memory is still 192.9MB. Free memory was 152.2MB in the beginning and 150.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.68ms. Allocated memory is still 192.9MB. Free memory was 150.1MB in the beginning and 148.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 397.69ms. Allocated memory is still 192.9MB. Free memory was 148.0MB in the beginning and 126.0MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 4719.06ms. Allocated memory was 192.9MB in the beginning and 232.8MB in the end (delta: 39.8MB). Free memory was 126.0MB in the beginning and 194.1MB in the end (delta: -68.1MB). Peak memory consumption was 101.8MB. Max. memory is 16.1GB. * Witness Printer took 39.37ms. Allocated memory is still 232.8MB. Free memory was 194.1MB in the beginning and 190.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 753]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L754] 0 int _N; [L755] 0 atomic_int limit; [L775] 0 _N = 1 [L776] CALL 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L750] COND FALSE 0 !(!cond) [L776] RET 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L777] 0 pthread_t t1, t2; [L778] FCALL, FORK 0 pthread_create(&t1, 0, f1, 0) VAL [_N=1, limit=0, t1=0] [L757] 1 int i, bound; [L758] 1 int lim = _N; VAL [\old(arg)={0:0}, _N=1, arg={0:0}, lim=1, limit=0] [L779] FCALL, FORK 0 pthread_create(&t2, 0, f2, 0) VAL [_N=1, limit=0, t1=0, t2=1] [L766] 2 int i, bound; [L767] 2 int lim = _N + 1; VAL [\old(arg)={0:0}, _N=1, arg={0:0}, lim=2, limit=0] [L768] 2 limit = lim VAL [\old(arg)={0:0}, _N=1, arg={0:0}, lim=2, limit=2] [L759] 1 limit = lim VAL [\old(arg)={0:0}, _N=1, arg={0:0}, lim=1, limit=1] [L769] 2 bound = limit [L770] 2 i = 0 VAL [\old(arg)={0:0}, _N=1, arg={0:0}, bound=1, i=0, lim=2, limit=1] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=1, arg={0:0}, bound=1, i=1, lim=2, limit=1] [L770] COND FALSE 2 !(i < bound) [L771] CALL 2 __VERIFIER_assert(i == lim) [L753] COND TRUE 2 !expression VAL [\old(expression)=0, _N=1, expression=0, limit=1] [L753] 2 reach_error() VAL [\old(expression)=0, _N=1, expression=0, limit=1] - UnprovableResult [Line: 779]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 778]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 753]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 47 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: 4.6s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 837 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 825 mSDsluCounter, 170 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 136 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1416 IncrementalHoareTripleChecker+Invalid, 1421 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 34 mSDtfsCounter, 1416 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 159 GetRequests, 47 SyntacticMatches, 8 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=409occurred in iteration=8, InterpolantAutomatonStates: 69, 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, 1.3s InterpolantComputationTime, 139 NumberOfCodeBlocks, 139 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 143 ConstructedInterpolants, 0 QuantifiedInterpolants, 555 SizeOfPredicates, 18 NumberOfNonLiveVariables, 274 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 15 InterpolantComputations, 5 PerfectInterpolantSequences, 5/21 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-19 01:57:54,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE