./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/triangular-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/triangular-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9ca4ad6de5ce46f9737c47ccc55c2628eaef135acf1b94c234f6d96d13f1ccb1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 10:08:16,329 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 10:08:16,414 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 10:08:16,423 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 10:08:16,424 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 10:08:16,450 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 10:08:16,450 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 10:08:16,451 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 10:08:16,451 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 10:08:16,452 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 10:08:16,452 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 10:08:16,453 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 10:08:16,455 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 10:08:16,458 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 10:08:16,459 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 10:08:16,459 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 10:08:16,459 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 10:08:16,460 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 10:08:16,460 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 10:08:16,460 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 10:08:16,460 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 10:08:16,461 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 10:08:16,463 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 10:08:16,463 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 10:08:16,464 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 10:08:16,464 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 10:08:16,464 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 10:08:16,464 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 10:08:16,465 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 10:08:16,465 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 10:08:16,465 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 10:08:16,465 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 10:08:16,465 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:08:16,466 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 10:08:16,466 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 10:08:16,466 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 10:08:16,466 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 10:08:16,467 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 10:08:16,467 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 10:08:16,467 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 10:08:16,468 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 10:08:16,468 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 10:08:16,468 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9ca4ad6de5ce46f9737c47ccc55c2628eaef135acf1b94c234f6d96d13f1ccb1 [2024-11-10 10:08:16,704 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 10:08:16,729 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 10:08:16,733 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 10:08:16,734 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 10:08:16,735 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 10:08:16,736 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/triangular-2.i [2024-11-10 10:08:18,272 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 10:08:18,543 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 10:08:18,545 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-2.i [2024-11-10 10:08:18,562 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce99c756a/109d1bdc85b04792937c82d091167826/FLAG2127912d5 [2024-11-10 10:08:18,574 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce99c756a/109d1bdc85b04792937c82d091167826 [2024-11-10 10:08:18,576 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 10:08:18,577 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 10:08:18,579 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 10:08:18,580 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 10:08:18,584 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 10:08:18,584 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:08:18" (1/1) ... [2024-11-10 10:08:18,585 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24ab5135 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:18, skipping insertion in model container [2024-11-10 10:08:18,585 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:08:18" (1/1) ... [2024-11-10 10:08:18,631 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 10:08:19,001 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-2.i[30952,30965] [2024-11-10 10:08:19,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:08:19,014 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 10:08:19,064 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-2.i[30952,30965] [2024-11-10 10:08:19,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:08:19,104 INFO L204 MainTranslator]: Completed translation [2024-11-10 10:08:19,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:19 WrapperNode [2024-11-10 10:08:19,105 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 10:08:19,106 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 10:08:19,106 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 10:08:19,106 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 10:08:19,113 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:19" (1/1) ... [2024-11-10 10:08:19,125 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:19" (1/1) ... [2024-11-10 10:08:19,143 INFO L138 Inliner]: procedures = 168, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 37 [2024-11-10 10:08:19,143 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 10:08:19,144 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 10:08:19,144 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 10:08:19,145 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 10:08:19,154 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:19" (1/1) ... [2024-11-10 10:08:19,154 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:19" (1/1) ... [2024-11-10 10:08:19,158 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:19" (1/1) ... [2024-11-10 10:08:19,181 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-10 10:08:19,181 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:19" (1/1) ... [2024-11-10 10:08:19,181 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:19" (1/1) ... [2024-11-10 10:08:19,188 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:19" (1/1) ... [2024-11-10 10:08:19,192 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:19" (1/1) ... [2024-11-10 10:08:19,194 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:19" (1/1) ... [2024-11-10 10:08:19,195 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:19" (1/1) ... [2024-11-10 10:08:19,197 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 10:08:19,198 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 10:08:19,198 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 10:08:19,198 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 10:08:19,199 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:19" (1/1) ... [2024-11-10 10:08:19,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:08:19,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:08:19,232 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-10 10:08:19,234 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-10 10:08:19,277 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-10 10:08:19,277 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-10 10:08:19,278 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-10 10:08:19,278 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-10 10:08:19,278 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-10 10:08:19,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 10:08:19,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 10:08:19,280 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-10 10:08:19,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 10:08:19,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 10:08:19,282 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 10:08:19,436 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 10:08:19,440 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 10:08:19,666 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 10:08:19,666 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 10:08:19,749 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 10:08:19,749 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 10:08:19,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:08:19 BoogieIcfgContainer [2024-11-10 10:08:19,750 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 10:08:19,752 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 10:08:19,752 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 10:08:19,755 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 10:08:19,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:08:18" (1/3) ... [2024-11-10 10:08:19,756 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dff33bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:08:19, skipping insertion in model container [2024-11-10 10:08:19,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:19" (2/3) ... [2024-11-10 10:08:19,757 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dff33bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:08:19, skipping insertion in model container [2024-11-10 10:08:19,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:08:19" (3/3) ... [2024-11-10 10:08:19,758 INFO L112 eAbstractionObserver]: Analyzing ICFG triangular-2.i [2024-11-10 10:08:19,775 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 10:08:19,776 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 10:08:19,776 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 10:08:19,817 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 10:08:19,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 30 transitions, 68 flow [2024-11-10 10:08:19,878 INFO L124 PetriNetUnfolderBase]: 5/28 cut-off events. [2024-11-10 10:08:19,879 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 10:08:19,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 28 events. 5/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 51 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 28. Up to 2 conditions per place. [2024-11-10 10:08:19,883 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 30 transitions, 68 flow [2024-11-10 10:08:19,888 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 28 transitions, 62 flow [2024-11-10 10:08:19,900 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:08:19,909 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;@2e6b7d59, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:08:19,909 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-10 10:08:19,925 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 10:08:19,928 INFO L124 PetriNetUnfolderBase]: 5/27 cut-off events. [2024-11-10 10:08:19,929 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 10:08:19,929 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:08:19,930 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:08:19,930 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:08:19,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:08:19,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1518046071, now seen corresponding path program 1 times [2024-11-10 10:08:19,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:08:19,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36505417] [2024-11-10 10:08:19,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:08:19,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:08:20,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:08:20,405 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-10 10:08:20,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:08:20,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36505417] [2024-11-10 10:08:20,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36505417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:08:20,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:08:20,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:08:20,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396484105] [2024-11-10 10:08:20,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:08:20,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 10:08:20,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:08:20,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 10:08:20,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 10:08:20,454 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 30 [2024-11-10 10:08:20,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 28 transitions, 62 flow. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:08:20,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:08:20,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 30 [2024-11-10 10:08:20,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:08:20,748 INFO L124 PetriNetUnfolderBase]: 321/609 cut-off events. [2024-11-10 10:08:20,748 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 10:08:20,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1121 conditions, 609 events. 321/609 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3137 event pairs, 62 based on Foata normal form. 112/664 useless extension candidates. Maximal degree in co-relation 1111. Up to 221 conditions per place. [2024-11-10 10:08:20,756 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 25 selfloop transitions, 4 changer transitions 22/58 dead transitions. [2024-11-10 10:08:20,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 58 transitions, 224 flow [2024-11-10 10:08:20,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:08:20,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 10:08:20,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2024-11-10 10:08:20,769 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6555555555555556 [2024-11-10 10:08:20,771 INFO L175 Difference]: Start difference. First operand has 30 places, 28 transitions, 62 flow. Second operand 6 states and 118 transitions. [2024-11-10 10:08:20,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 58 transitions, 224 flow [2024-11-10 10:08:20,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 58 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 10:08:20,776 INFO L231 Difference]: Finished difference. Result has 37 places, 26 transitions, 79 flow [2024-11-10 10:08:20,778 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=79, PETRI_PLACES=37, PETRI_TRANSITIONS=26} [2024-11-10 10:08:20,781 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 7 predicate places. [2024-11-10 10:08:20,781 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 79 flow [2024-11-10 10:08:20,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:08:20,782 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:08:20,782 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:08:20,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 10:08:20,782 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:08:20,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:08:20,783 INFO L85 PathProgramCache]: Analyzing trace with hash -2109871830, now seen corresponding path program 1 times [2024-11-10 10:08:20,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:08:20,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861324326] [2024-11-10 10:08:20,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:08:20,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:08:20,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:08:20,973 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-10 10:08:20,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:08:20,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861324326] [2024-11-10 10:08:20,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861324326] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:08:20,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:08:20,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 10:08:20,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713049302] [2024-11-10 10:08:20,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:08:20,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 10:08:20,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:08:20,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 10:08:20,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 10:08:20,979 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 30 [2024-11-10 10:08:20,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 79 flow. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:08:20,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:08:20,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 30 [2024-11-10 10:08:20,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:08:21,228 INFO L124 PetriNetUnfolderBase]: 382/791 cut-off events. [2024-11-10 10:08:21,229 INFO L125 PetriNetUnfolderBase]: For 291/297 co-relation queries the response was YES. [2024-11-10 10:08:21,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1688 conditions, 791 events. 382/791 cut-off events. For 291/297 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4305 event pairs, 65 based on Foata normal form. 33/757 useless extension candidates. Maximal degree in co-relation 1674. Up to 246 conditions per place. [2024-11-10 10:08:21,237 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 46 selfloop transitions, 9 changer transitions 20/82 dead transitions. [2024-11-10 10:08:21,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 82 transitions, 387 flow [2024-11-10 10:08:21,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 10:08:21,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-10 10:08:21,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions. [2024-11-10 10:08:21,240 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2024-11-10 10:08:21,240 INFO L175 Difference]: Start difference. First operand has 37 places, 26 transitions, 79 flow. Second operand 9 states and 153 transitions. [2024-11-10 10:08:21,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 82 transitions, 387 flow [2024-11-10 10:08:21,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 82 transitions, 371 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-11-10 10:08:21,245 INFO L231 Difference]: Finished difference. Result has 46 places, 35 transitions, 164 flow [2024-11-10 10:08:21,246 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=164, PETRI_PLACES=46, PETRI_TRANSITIONS=35} [2024-11-10 10:08:21,247 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 16 predicate places. [2024-11-10 10:08:21,247 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 164 flow [2024-11-10 10:08:21,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:08:21,247 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:08:21,247 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:08:21,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 10:08:21,248 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:08:21,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:08:21,249 INFO L85 PathProgramCache]: Analyzing trace with hash -280399476, now seen corresponding path program 2 times [2024-11-10 10:08:21,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:08:21,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701518363] [2024-11-10 10:08:21,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:08:21,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:08:21,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:08:21,388 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-10 10:08:21,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:08:21,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701518363] [2024-11-10 10:08:21,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701518363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:08:21,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:08:21,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 10:08:21,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944467262] [2024-11-10 10:08:21,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:08:21,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 10:08:21,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:08:21,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 10:08:21,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 10:08:21,394 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 30 [2024-11-10 10:08:21,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 164 flow. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:08:21,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:08:21,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 30 [2024-11-10 10:08:21,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:08:21,691 INFO L124 PetriNetUnfolderBase]: 373/806 cut-off events. [2024-11-10 10:08:21,692 INFO L125 PetriNetUnfolderBase]: For 1157/1181 co-relation queries the response was YES. [2024-11-10 10:08:21,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2073 conditions, 806 events. 373/806 cut-off events. For 1157/1181 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4579 event pairs, 80 based on Foata normal form. 54/778 useless extension candidates. Maximal degree in co-relation 2052. Up to 237 conditions per place. [2024-11-10 10:08:21,696 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 42 selfloop transitions, 15 changer transitions 32/96 dead transitions. [2024-11-10 10:08:21,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 96 transitions, 586 flow [2024-11-10 10:08:21,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 10:08:21,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-10 10:08:21,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 166 transitions. [2024-11-10 10:08:21,702 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5533333333333333 [2024-11-10 10:08:21,702 INFO L175 Difference]: Start difference. First operand has 46 places, 35 transitions, 164 flow. Second operand 10 states and 166 transitions. [2024-11-10 10:08:21,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 96 transitions, 586 flow [2024-11-10 10:08:21,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 96 transitions, 576 flow, removed 5 selfloop flow, removed 2 redundant places. [2024-11-10 10:08:21,712 INFO L231 Difference]: Finished difference. Result has 57 places, 43 transitions, 278 flow [2024-11-10 10:08:21,712 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=278, PETRI_PLACES=57, PETRI_TRANSITIONS=43} [2024-11-10 10:08:21,713 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 27 predicate places. [2024-11-10 10:08:21,714 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 43 transitions, 278 flow [2024-11-10 10:08:21,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:08:21,714 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:08:21,715 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:08:21,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 10:08:21,715 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:08:21,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:08:21,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1519403417, now seen corresponding path program 1 times [2024-11-10 10:08:21,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:08:21,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25545635] [2024-11-10 10:08:21,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:08:21,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:08:21,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:08:21,880 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-10 10:08:21,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:08:21,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25545635] [2024-11-10 10:08:21,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25545635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:08:21,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:08:21,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 10:08:21,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024472662] [2024-11-10 10:08:21,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:08:21,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 10:08:21,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:08:21,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 10:08:21,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 10:08:21,886 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 30 [2024-11-10 10:08:21,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 43 transitions, 278 flow. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:08:21,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:08:21,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 30 [2024-11-10 10:08:21,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:08:22,179 INFO L124 PetriNetUnfolderBase]: 508/1103 cut-off events. [2024-11-10 10:08:22,179 INFO L125 PetriNetUnfolderBase]: For 3675/3714 co-relation queries the response was YES. [2024-11-10 10:08:22,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3305 conditions, 1103 events. 508/1103 cut-off events. For 3675/3714 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6589 event pairs, 53 based on Foata normal form. 47/1050 useless extension candidates. Maximal degree in co-relation 3277. Up to 238 conditions per place. [2024-11-10 10:08:22,202 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 56 selfloop transitions, 21 changer transitions 23/107 dead transitions. [2024-11-10 10:08:22,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 107 transitions, 782 flow [2024-11-10 10:08:22,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 10:08:22,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-10 10:08:22,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 185 transitions. [2024-11-10 10:08:22,205 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5606060606060606 [2024-11-10 10:08:22,206 INFO L175 Difference]: Start difference. First operand has 57 places, 43 transitions, 278 flow. Second operand 11 states and 185 transitions. [2024-11-10 10:08:22,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 107 transitions, 782 flow [2024-11-10 10:08:22,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 107 transitions, 717 flow, removed 29 selfloop flow, removed 4 redundant places. [2024-11-10 10:08:22,222 INFO L231 Difference]: Finished difference. Result has 67 places, 49 transitions, 386 flow [2024-11-10 10:08:22,223 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=386, PETRI_PLACES=67, PETRI_TRANSITIONS=49} [2024-11-10 10:08:22,224 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 37 predicate places. [2024-11-10 10:08:22,224 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 49 transitions, 386 flow [2024-11-10 10:08:22,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:08:22,225 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:08:22,225 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:08:22,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 10:08:22,227 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:08:22,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:08:22,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1506852439, now seen corresponding path program 2 times [2024-11-10 10:08:22,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:08:22,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830382158] [2024-11-10 10:08:22,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:08:22,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:08:22,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:08:22,364 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-10 10:08:22,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:08:22,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830382158] [2024-11-10 10:08:22,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830382158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:08:22,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:08:22,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 10:08:22,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240896556] [2024-11-10 10:08:22,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:08:22,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 10:08:22,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:08:22,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 10:08:22,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 10:08:22,373 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 30 [2024-11-10 10:08:22,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 49 transitions, 386 flow. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:08:22,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:08:22,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 30 [2024-11-10 10:08:22,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:08:22,679 INFO L124 PetriNetUnfolderBase]: 481/1040 cut-off events. [2024-11-10 10:08:22,679 INFO L125 PetriNetUnfolderBase]: For 5689/5755 co-relation queries the response was YES. [2024-11-10 10:08:22,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3553 conditions, 1040 events. 481/1040 cut-off events. For 5689/5755 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 6120 event pairs, 59 based on Foata normal form. 77/1026 useless extension candidates. Maximal degree in co-relation 3520. Up to 154 conditions per place. [2024-11-10 10:08:22,689 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 45 selfloop transitions, 25 changer transitions 33/110 dead transitions. [2024-11-10 10:08:22,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 110 transitions, 978 flow [2024-11-10 10:08:22,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 10:08:22,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-10 10:08:22,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 182 transitions. [2024-11-10 10:08:22,691 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5515151515151515 [2024-11-10 10:08:22,691 INFO L175 Difference]: Start difference. First operand has 67 places, 49 transitions, 386 flow. Second operand 11 states and 182 transitions. [2024-11-10 10:08:22,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 110 transitions, 978 flow [2024-11-10 10:08:22,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 110 transitions, 901 flow, removed 27 selfloop flow, removed 6 redundant places. [2024-11-10 10:08:22,707 INFO L231 Difference]: Finished difference. Result has 74 places, 52 transitions, 482 flow [2024-11-10 10:08:22,708 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=482, PETRI_PLACES=74, PETRI_TRANSITIONS=52} [2024-11-10 10:08:22,708 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 44 predicate places. [2024-11-10 10:08:22,709 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 52 transitions, 482 flow [2024-11-10 10:08:22,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:08:22,709 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:08:22,709 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:08:22,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 10:08:22,710 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:08:22,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:08:22,711 INFO L85 PathProgramCache]: Analyzing trace with hash -635280593, now seen corresponding path program 1 times [2024-11-10 10:08:22,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:08:22,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111893086] [2024-11-10 10:08:22,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:08:22,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:08:22,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:08:22,829 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-10 10:08:22,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:08:22,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111893086] [2024-11-10 10:08:22,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111893086] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:08:22,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292891313] [2024-11-10 10:08:22,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:08:22,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:08:22,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:08:22,835 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-10 10:08:22,837 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-10 10:08:22,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:08:22,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 10:08:22,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:08:23,028 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-10 10:08:23,029 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:08:23,200 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-10 10:08:23,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292891313] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:08:23,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:08:23,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-11-10 10:08:23,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080997853] [2024-11-10 10:08:23,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:08:23,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 10:08:23,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:08:23,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 10:08:23,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-11-10 10:08:23,209 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 30 [2024-11-10 10:08:23,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 52 transitions, 482 flow. Second operand has 13 states, 13 states have (on average 11.153846153846153) internal successors, (145), 13 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:08:23,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:08:23,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 30 [2024-11-10 10:08:23,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:08:23,731 INFO L124 PetriNetUnfolderBase]: 589/1322 cut-off events. [2024-11-10 10:08:23,732 INFO L125 PetriNetUnfolderBase]: For 11166/11256 co-relation queries the response was YES. [2024-11-10 10:08:23,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4951 conditions, 1322 events. 589/1322 cut-off events. For 11166/11256 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 7499 event pairs, 149 based on Foata normal form. 88/1261 useless extension candidates. Maximal degree in co-relation 4915. Up to 486 conditions per place. [2024-11-10 10:08:23,744 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 65 selfloop transitions, 19 changer transitions 67/158 dead transitions. [2024-11-10 10:08:23,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 158 transitions, 1554 flow [2024-11-10 10:08:23,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 10:08:23,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-11-10 10:08:23,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 307 transitions. [2024-11-10 10:08:23,746 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5385964912280702 [2024-11-10 10:08:23,747 INFO L175 Difference]: Start difference. First operand has 74 places, 52 transitions, 482 flow. Second operand 19 states and 307 transitions. [2024-11-10 10:08:23,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 158 transitions, 1554 flow [2024-11-10 10:08:23,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 158 transitions, 1439 flow, removed 40 selfloop flow, removed 9 redundant places. [2024-11-10 10:08:23,763 INFO L231 Difference]: Finished difference. Result has 93 places, 58 transitions, 612 flow [2024-11-10 10:08:23,764 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=612, PETRI_PLACES=93, PETRI_TRANSITIONS=58} [2024-11-10 10:08:23,765 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 63 predicate places. [2024-11-10 10:08:23,766 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 58 transitions, 612 flow [2024-11-10 10:08:23,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.153846153846153) internal successors, (145), 13 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:08:23,766 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:08:23,766 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:08:23,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 10:08:23,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-10 10:08:23,971 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:08:23,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:08:23,972 INFO L85 PathProgramCache]: Analyzing trace with hash -792172533, now seen corresponding path program 2 times [2024-11-10 10:08:23,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:08:23,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129329903] [2024-11-10 10:08:23,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:08:23,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:08:23,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:08:24,106 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-10 10:08:24,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:08:24,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129329903] [2024-11-10 10:08:24,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129329903] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:08:24,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114790433] [2024-11-10 10:08:24,107 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 10:08:24,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:08:24,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:08:24,109 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-10 10:08:24,110 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-10 10:08:24,168 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 10:08:24,169 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 10:08:24,170 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 10:08:24,171 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:08:24,230 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-10 10:08:24,230 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:08:24,348 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-10 10:08:24,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114790433] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:08:24,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:08:24,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-11-10 10:08:24,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063199675] [2024-11-10 10:08:24,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:08:24,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 10:08:24,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:08:24,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 10:08:24,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-10 10:08:24,354 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 30 [2024-11-10 10:08:24,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 58 transitions, 612 flow. Second operand has 13 states, 13 states have (on average 11.153846153846153) internal successors, (145), 13 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:08:24,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:08:24,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 30 [2024-11-10 10:08:24,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:08:25,118 INFO L124 PetriNetUnfolderBase]: 877/1910 cut-off events. [2024-11-10 10:08:25,118 INFO L125 PetriNetUnfolderBase]: For 36897/37116 co-relation queries the response was YES. [2024-11-10 10:08:25,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9402 conditions, 1910 events. 877/1910 cut-off events. For 36897/37116 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 11935 event pairs, 68 based on Foata normal form. 102/1847 useless extension candidates. Maximal degree in co-relation 9357. Up to 309 conditions per place. [2024-11-10 10:08:25,139 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 88 selfloop transitions, 47 changer transitions 80/222 dead transitions. [2024-11-10 10:08:25,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 222 transitions, 2798 flow [2024-11-10 10:08:25,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-10 10:08:25,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2024-11-10 10:08:25,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 442 transitions. [2024-11-10 10:08:25,142 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5456790123456791 [2024-11-10 10:08:25,142 INFO L175 Difference]: Start difference. First operand has 93 places, 58 transitions, 612 flow. Second operand 27 states and 442 transitions. [2024-11-10 10:08:25,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 222 transitions, 2798 flow [2024-11-10 10:08:25,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 222 transitions, 2189 flow, removed 292 selfloop flow, removed 12 redundant places. [2024-11-10 10:08:25,178 INFO L231 Difference]: Finished difference. Result has 119 places, 74 transitions, 994 flow [2024-11-10 10:08:25,178 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=471, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=994, PETRI_PLACES=119, PETRI_TRANSITIONS=74} [2024-11-10 10:08:25,179 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 89 predicate places. [2024-11-10 10:08:25,179 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 74 transitions, 994 flow [2024-11-10 10:08:25,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.153846153846153) internal successors, (145), 13 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:08:25,179 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:08:25,179 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:08:25,197 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-10 10:08:25,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-10 10:08:25,380 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:08:25,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:08:25,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1390998023, now seen corresponding path program 1 times [2024-11-10 10:08:25,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:08:25,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971123356] [2024-11-10 10:08:25,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:08:25,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:08:25,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:08:25,515 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:08:25,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:08:25,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971123356] [2024-11-10 10:08:25,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971123356] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:08:25,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417401263] [2024-11-10 10:08:25,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:08:25,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:08:25,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:08:25,521 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-10 10:08:25,523 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-10 10:08:25,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:08:25,584 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 10:08:25,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:08:25,647 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:08:25,648 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:08:25,786 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:08:25,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417401263] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:08:25,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:08:25,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-11-10 10:08:25,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040519845] [2024-11-10 10:08:25,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:08:25,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 10:08:25,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:08:25,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 10:08:25,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2024-11-10 10:08:25,791 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 30 [2024-11-10 10:08:25,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 74 transitions, 994 flow. Second operand has 15 states, 15 states have (on average 11.066666666666666) internal successors, (166), 15 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:08:25,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:08:25,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 30 [2024-11-10 10:08:25,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:08:26,680 INFO L124 PetriNetUnfolderBase]: 1111/2510 cut-off events. [2024-11-10 10:08:26,681 INFO L125 PetriNetUnfolderBase]: For 82724/82936 co-relation queries the response was YES. [2024-11-10 10:08:26,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14599 conditions, 2510 events. 1111/2510 cut-off events. For 82724/82936 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 16969 event pairs, 153 based on Foata normal form. 98/2378 useless extension candidates. Maximal degree in co-relation 14542. Up to 490 conditions per place. [2024-11-10 10:08:26,710 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 99 selfloop transitions, 51 changer transitions 67/224 dead transitions. [2024-11-10 10:08:26,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 224 transitions, 3542 flow [2024-11-10 10:08:26,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-10 10:08:26,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2024-11-10 10:08:26,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 409 transitions. [2024-11-10 10:08:26,712 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5453333333333333 [2024-11-10 10:08:26,713 INFO L175 Difference]: Start difference. First operand has 119 places, 74 transitions, 994 flow. Second operand 25 states and 409 transitions. [2024-11-10 10:08:26,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 224 transitions, 3542 flow [2024-11-10 10:08:26,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 224 transitions, 2968 flow, removed 271 selfloop flow, removed 13 redundant places. [2024-11-10 10:08:26,842 INFO L231 Difference]: Finished difference. Result has 137 places, 85 transitions, 1276 flow [2024-11-10 10:08:26,843 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1276, PETRI_PLACES=137, PETRI_TRANSITIONS=85} [2024-11-10 10:08:26,843 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 107 predicate places. [2024-11-10 10:08:26,844 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 85 transitions, 1276 flow [2024-11-10 10:08:26,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 11.066666666666666) internal successors, (166), 15 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:08:26,844 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:08:26,844 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:08:26,864 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-10 10:08:27,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:08:27,049 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:08:27,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:08:27,050 INFO L85 PathProgramCache]: Analyzing trace with hash -415949327, now seen corresponding path program 2 times [2024-11-10 10:08:27,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:08:27,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008071799] [2024-11-10 10:08:27,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:08:27,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:08:27,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:08:27,203 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:08:27,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:08:27,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008071799] [2024-11-10 10:08:27,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008071799] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:08:27,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207899476] [2024-11-10 10:08:27,204 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 10:08:27,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:08:27,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:08:27,206 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-10 10:08:27,207 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-10 10:08:27,266 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 10:08:27,267 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 10:08:27,269 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-10 10:08:27,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:08:27,325 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:08:27,326 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:08:27,451 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:08:27,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207899476] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:08:27,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:08:27,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-11-10 10:08:27,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77507588] [2024-11-10 10:08:27,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:08:27,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 10:08:27,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:08:27,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 10:08:27,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-11-10 10:08:27,456 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 30 [2024-11-10 10:08:27,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 85 transitions, 1276 flow. Second operand has 16 states, 16 states have (on average 11.0625) internal successors, (177), 16 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:08:27,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:08:27,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 30 [2024-11-10 10:08:27,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:08:28,458 INFO L124 PetriNetUnfolderBase]: 1192/2720 cut-off events. [2024-11-10 10:08:28,459 INFO L125 PetriNetUnfolderBase]: For 125455/125655 co-relation queries the response was YES. [2024-11-10 10:08:28,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16915 conditions, 2720 events. 1192/2720 cut-off events. For 125455/125655 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 18591 event pairs, 65 based on Foata normal form. 176/2656 useless extension candidates. Maximal degree in co-relation 16852. Up to 477 conditions per place. [2024-11-10 10:08:28,491 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 86 selfloop transitions, 74 changer transitions 89/256 dead transitions. [2024-11-10 10:08:28,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 256 transitions, 4748 flow [2024-11-10 10:08:28,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-10 10:08:28,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2024-11-10 10:08:28,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 425 transitions. [2024-11-10 10:08:28,494 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5448717948717948 [2024-11-10 10:08:28,494 INFO L175 Difference]: Start difference. First operand has 137 places, 85 transitions, 1276 flow. Second operand 26 states and 425 transitions. [2024-11-10 10:08:28,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 256 transitions, 4748 flow [2024-11-10 10:08:28,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 256 transitions, 4015 flow, removed 330 selfloop flow, removed 18 redundant places. [2024-11-10 10:08:28,697 INFO L231 Difference]: Finished difference. Result has 154 places, 104 transitions, 1821 flow [2024-11-10 10:08:28,697 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=978, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=1821, PETRI_PLACES=154, PETRI_TRANSITIONS=104} [2024-11-10 10:08:28,698 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 124 predicate places. [2024-11-10 10:08:28,698 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 104 transitions, 1821 flow [2024-11-10 10:08:28,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.0625) internal successors, (177), 16 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:08:28,698 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:08:28,698 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:08:28,713 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-10 10:08:28,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:08:28,899 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:08:28,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:08:28,900 INFO L85 PathProgramCache]: Analyzing trace with hash -101294447, now seen corresponding path program 3 times [2024-11-10 10:08:28,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:08:28,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128493243] [2024-11-10 10:08:28,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:08:28,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:08:28,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:08:29,113 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:08:29,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:08:29,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128493243] [2024-11-10 10:08:29,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128493243] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:08:29,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895712726] [2024-11-10 10:08:29,114 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 10:08:29,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:08:29,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:08:29,116 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 10:08:29,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 10:08:29,169 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-10 10:08:29,169 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 10:08:29,170 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 10:08:29,171 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:08:29,242 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:08:29,242 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:08:29,432 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:08:29,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895712726] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:08:29,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:08:29,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 19 [2024-11-10 10:08:29,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994832408] [2024-11-10 10:08:29,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:08:29,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-10 10:08:29,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:08:29,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-10 10:08:29,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2024-11-10 10:08:29,438 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 30 [2024-11-10 10:08:29,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 104 transitions, 1821 flow. Second operand has 20 states, 20 states have (on average 11.2) internal successors, (224), 20 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:08:29,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:08:29,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 30 [2024-11-10 10:08:29,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:08:30,715 INFO L124 PetriNetUnfolderBase]: 1426/3185 cut-off events. [2024-11-10 10:08:30,716 INFO L125 PetriNetUnfolderBase]: For 186170/186629 co-relation queries the response was YES. [2024-11-10 10:08:30,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21621 conditions, 3185 events. 1426/3185 cut-off events. For 186170/186629 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 21178 event pairs, 40 based on Foata normal form. 102/3016 useless extension candidates. Maximal degree in co-relation 21550. Up to 555 conditions per place. [2024-11-10 10:08:30,762 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 114 selfloop transitions, 98 changer transitions 91/310 dead transitions. [2024-11-10 10:08:30,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 310 transitions, 6027 flow [2024-11-10 10:08:30,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-10 10:08:30,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2024-11-10 10:08:30,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 553 transitions. [2024-11-10 10:08:30,765 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.542156862745098 [2024-11-10 10:08:30,765 INFO L175 Difference]: Start difference. First operand has 154 places, 104 transitions, 1821 flow. Second operand 34 states and 553 transitions. [2024-11-10 10:08:30,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 310 transitions, 6027 flow [2024-11-10 10:08:30,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 310 transitions, 5060 flow, removed 457 selfloop flow, removed 17 redundant places. [2024-11-10 10:08:30,944 INFO L231 Difference]: Finished difference. Result has 179 places, 126 transitions, 2398 flow [2024-11-10 10:08:30,945 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1382, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=2398, PETRI_PLACES=179, PETRI_TRANSITIONS=126} [2024-11-10 10:08:30,945 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 149 predicate places. [2024-11-10 10:08:30,945 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 126 transitions, 2398 flow [2024-11-10 10:08:30,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 11.2) internal successors, (224), 20 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:08:30,946 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:08:30,946 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:08:30,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-10 10:08:31,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-10 10:08:31,149 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:08:31,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:08:31,150 INFO L85 PathProgramCache]: Analyzing trace with hash -671878623, now seen corresponding path program 4 times [2024-11-10 10:08:31,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:08:31,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922139756] [2024-11-10 10:08:31,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:08:31,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:08:31,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:08:31,162 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 10:08:31,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:08:31,191 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 10:08:31,191 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 10:08:31,192 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-11-10 10:08:31,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-11-10 10:08:31,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-11-10 10:08:31,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 10:08:31,194 INFO L407 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 1] [2024-11-10 10:08:31,321 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 10:08:31,323 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 10:08:31,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 10:08:31 BasicIcfg [2024-11-10 10:08:31,331 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 10:08:31,332 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 10:08:31,332 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 10:08:31,332 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 10:08:31,332 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:08:19" (3/4) ... [2024-11-10 10:08:31,333 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-10 10:08:31,405 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 10:08:31,405 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 10:08:31,406 INFO L158 Benchmark]: Toolchain (without parser) took 12828.42ms. Allocated memory was 163.6MB in the beginning and 469.8MB in the end (delta: 306.2MB). Free memory was 93.7MB in the beginning and 324.4MB in the end (delta: -230.6MB). Peak memory consumption was 76.8MB. Max. memory is 16.1GB. [2024-11-10 10:08:31,406 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 121.6MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 10:08:31,407 INFO L158 Benchmark]: CACSL2BoogieTranslator took 525.88ms. Allocated memory is still 163.6MB. Free memory was 93.7MB in the beginning and 71.5MB in the end (delta: 22.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-10 10:08:31,407 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.40ms. Allocated memory is still 163.6MB. Free memory was 71.5MB in the beginning and 69.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 10:08:31,407 INFO L158 Benchmark]: Boogie Preprocessor took 53.22ms. Allocated memory is still 163.6MB. Free memory was 69.9MB in the beginning and 68.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 10:08:31,407 INFO L158 Benchmark]: IcfgBuilder took 551.89ms. Allocated memory is still 163.6MB. Free memory was 67.8MB in the beginning and 122.8MB in the end (delta: -55.0MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. [2024-11-10 10:08:31,408 INFO L158 Benchmark]: TraceAbstraction took 11579.69ms. Allocated memory was 163.6MB in the beginning and 469.8MB in the end (delta: 306.2MB). Free memory was 122.8MB in the beginning and 333.8MB in the end (delta: -211.0MB). Peak memory consumption was 241.7MB. Max. memory is 16.1GB. [2024-11-10 10:08:31,408 INFO L158 Benchmark]: Witness Printer took 73.23ms. Allocated memory is still 469.8MB. Free memory was 333.8MB in the beginning and 324.4MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-10 10:08:31,409 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.20ms. Allocated memory is still 121.6MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 525.88ms. Allocated memory is still 163.6MB. Free memory was 93.7MB in the beginning and 71.5MB in the end (delta: 22.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.40ms. Allocated memory is still 163.6MB. Free memory was 71.5MB in the beginning and 69.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 53.22ms. Allocated memory is still 163.6MB. Free memory was 69.9MB in the beginning and 68.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 551.89ms. Allocated memory is still 163.6MB. Free memory was 67.8MB in the beginning and 122.8MB in the end (delta: -55.0MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. * TraceAbstraction took 11579.69ms. Allocated memory was 163.6MB in the beginning and 469.8MB in the end (delta: 306.2MB). Free memory was 122.8MB in the beginning and 333.8MB in the end (delta: -211.0MB). Peak memory consumption was 241.7MB. Max. memory is 16.1GB. * Witness Printer took 73.23ms. Allocated memory is still 469.8MB. Free memory was 333.8MB in the beginning and 324.4MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 722]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L694] 0 int i = 3, j = 6; [L712] 0 pthread_t id1, id2; [L713] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=49, \old(argv)={50:51}, argc=49, i=3, id1=-1, j=6] [L696] 1 int k = 0; VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=6, k=0] [L714] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=49, \old(argv)={50:51}, arg={0:0}, argc=49, i=3, id1=-1, id2=0, j=6, k=0] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, i=3, j=6, k=0] [L704] 2 int k = 0; VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=0] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L716] 0 int condI = i >= (2*5 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=49, \old(argv)={50:51}, arg={0:0}, arg={0:0}, argc=49, condI=0, i=7, id1=-1, id2=0, j=6, k=0, k=1] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=1] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=2] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=3] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=4] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=4] [L719] 0 int condJ = j >= (2*5 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=49, \old(argv)={50:51}, arg={0:0}, arg={0:0}, argc=49, condI=0, condJ=1, i=15, id1=-1, id2=0, j=16, k=4, k=4] [L721] COND TRUE 0 condI || condJ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=49, \old(argv)={50:51}, arg={0:0}, arg={0:0}, argc=49, condI=0, condJ=1, i=15, id1=-1, id2=0, j=16, k=4, k=4] [L722] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=49, \old(argv)={50:51}, arg={0:0}, arg={0:0}, argc=49, condI=0, condJ=1, i=15, id1=-1, id2=0, j=16, k=4, k=4] - UnprovableResult [Line: 713]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 42 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.3s, OverallIterations: 11, TraceHistogramMax: 5, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1617 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1616 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 98 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2688 IncrementalHoareTripleChecker+Invalid, 2786 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 98 mSolverCounterUnsat, 0 mSDtfsCounter, 2688 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 450 GetRequests, 232 SyntacticMatches, 4 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1573 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2398occurred in iteration=10, InterpolantAutomatonStates: 178, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 384 NumberOfCodeBlocks, 384 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 448 ConstructedInterpolants, 0 QuantifiedInterpolants, 1801 SizeOfPredicates, 27 NumberOfNonLiveVariables, 502 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 20 InterpolantComputations, 5 PerfectInterpolantSequences, 0/180 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-10 10:08:31,430 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