./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.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 051706a1eb405a384d7cf371ab2d9b9605b94715fa3ad16d6c2eb8e3fbb8fc38 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:56:18,195 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:56:18,278 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 01:56:18,285 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:56:18,285 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:56:18,313 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:56:18,315 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:56:18,315 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:56:18,316 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:56:18,317 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:56:18,317 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:56:18,317 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:56:18,318 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:56:18,318 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:56:18,320 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:56:18,320 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:56:18,320 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:56:18,321 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:56:18,321 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 01:56:18,321 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:56:18,321 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:56:18,325 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:56:18,325 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:56:18,326 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:56:18,326 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:56:18,326 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:56:18,326 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:56:18,326 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:56:18,327 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:56:18,327 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:56:18,327 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:56:18,327 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:56:18,327 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:56:18,328 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:56:18,328 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:56:18,328 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:56:18,328 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 01:56:18,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 01:56:18,328 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:56:18,329 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:56:18,329 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:56:18,331 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:56:18,331 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 -> 051706a1eb405a384d7cf371ab2d9b9605b94715fa3ad16d6c2eb8e3fbb8fc38 [2024-11-19 01:56:18,560 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:56:18,586 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:56:18,588 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:56:18,589 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:56:18,590 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:56:18,591 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.i [2024-11-19 01:56:20,128 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:56:20,370 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:56:20,371 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.i [2024-11-19 01:56:20,395 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e9f93809/a6b1b12866a04f218c2cbe0869277aa9/FLAG38907c0b2 [2024-11-19 01:56:20,704 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e9f93809/a6b1b12866a04f218c2cbe0869277aa9 [2024-11-19 01:56:20,706 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:56:20,707 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:56:20,710 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:56:20,710 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:56:20,718 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:56:20,719 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:56:20" (1/1) ... [2024-11-19 01:56:20,721 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70fa79c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:56:20, skipping insertion in model container [2024-11-19 01:56:20,721 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:56:20" (1/1) ... [2024-11-19 01:56:20,779 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:56:21,218 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-deagle/arithmetic_prog_bad.i[39758,39771] [2024-11-19 01:56:21,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:56:21,272 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:56:21,328 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-deagle/arithmetic_prog_bad.i[39758,39771] [2024-11-19 01:56:21,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:56:21,405 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:56:21,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:56:21 WrapperNode [2024-11-19 01:56:21,406 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:56:21,407 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:56:21,408 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:56:21,408 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:56:21,415 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:56:21" (1/1) ... [2024-11-19 01:56:21,440 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:56:21" (1/1) ... [2024-11-19 01:56:21,482 INFO L138 Inliner]: procedures = 243, calls = 26, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 260 [2024-11-19 01:56:21,484 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:56:21,485 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:56:21,485 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:56:21,485 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:56:21,499 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:56:21" (1/1) ... [2024-11-19 01:56:21,503 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:56:21" (1/1) ... [2024-11-19 01:56:21,507 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:56:21" (1/1) ... [2024-11-19 01:56:21,539 INFO L175 MemorySlicer]: Split 11 memory accesses to 3 slices as follows [2, 1, 8]. 73 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 1, 8]. The 0 writes are split as follows [0, 0, 0]. [2024-11-19 01:56:21,542 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:56:21" (1/1) ... [2024-11-19 01:56:21,543 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:56:21" (1/1) ... [2024-11-19 01:56:21,554 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:56:21" (1/1) ... [2024-11-19 01:56:21,562 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:56:21" (1/1) ... [2024-11-19 01:56:21,567 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:56:21" (1/1) ... [2024-11-19 01:56:21,573 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:56:21" (1/1) ... [2024-11-19 01:56:21,580 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:56:21,581 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:56:21,581 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:56:21,581 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:56:21,582 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:56:21" (1/1) ... [2024-11-19 01:56:21,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:56:21,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:56:21,625 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 01:56:21,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 01:56:21,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-19 01:56:21,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-19 01:56:21,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-19 01:56:21,681 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-19 01:56:21,681 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-19 01:56:21,681 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-19 01:56:21,681 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-19 01:56:21,683 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-19 01:56:21,683 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-19 01:56:21,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:56:21,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 01:56:21,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 01:56:21,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 01:56:21,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:56:21,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:56:21,686 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 01:56:21,844 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:56:21,846 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:56:22,213 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 01:56:22,214 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:56:23,283 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:56:23,283 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-19 01:56:23,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:56:23 BoogieIcfgContainer [2024-11-19 01:56:23,283 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:56:23,288 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:56:23,289 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:56:23,292 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:56:23,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:56:20" (1/3) ... [2024-11-19 01:56:23,293 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5578d0c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:56:23, skipping insertion in model container [2024-11-19 01:56:23,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:56:21" (2/3) ... [2024-11-19 01:56:23,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5578d0c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:56:23, skipping insertion in model container [2024-11-19 01:56:23,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:56:23" (3/3) ... [2024-11-19 01:56:23,295 INFO L112 eAbstractionObserver]: Analyzing ICFG arithmetic_prog_bad.i [2024-11-19 01:56:23,313 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:56:23,313 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 01:56:23,313 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 01:56:23,370 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-19 01:56:23,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 38 transitions, 90 flow [2024-11-19 01:56:23,474 INFO L124 PetriNetUnfolderBase]: 6/36 cut-off events. [2024-11-19 01:56:23,475 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-19 01:56:23,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 36 events. 6/36 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 27. Up to 3 conditions per place. [2024-11-19 01:56:23,480 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 38 transitions, 90 flow [2024-11-19 01:56:23,483 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 32 transitions, 76 flow [2024-11-19 01:56:23,496 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:56:23,504 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;@53a17f64, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:56:23,505 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-19 01:56:23,525 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 01:56:23,525 INFO L124 PetriNetUnfolderBase]: 4/31 cut-off events. [2024-11-19 01:56:23,525 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-19 01:56:23,526 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:56:23,527 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:56:23,527 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-19 01:56:23,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:56:23,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1822672186, now seen corresponding path program 1 times [2024-11-19 01:56:23,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:56:23,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959631320] [2024-11-19 01:56:23,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:56:23,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:56:24,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:56:24,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:56:24,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:56:24,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959631320] [2024-11-19 01:56:24,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959631320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:56:24,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:56:24,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:56:24,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88319229] [2024-11-19 01:56:24,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:56:24,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:56:24,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:56:24,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:56:24,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:56:24,468 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 38 [2024-11-19 01:56:24,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:56:24,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:56:24,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 38 [2024-11-19 01:56:24,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:56:24,698 INFO L124 PetriNetUnfolderBase]: 429/782 cut-off events. [2024-11-19 01:56:24,699 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-11-19 01:56:24,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1484 conditions, 782 events. 429/782 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3649 event pairs, 169 based on Foata normal form. 18/787 useless extension candidates. Maximal degree in co-relation 1424. Up to 399 conditions per place. [2024-11-19 01:56:24,711 INFO L140 encePairwiseOnDemand]: 35/38 looper letters, 38 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2024-11-19 01:56:24,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 49 transitions, 193 flow [2024-11-19 01:56:24,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:56:24,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 01:56:24,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2024-11-19 01:56:24,722 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7017543859649122 [2024-11-19 01:56:24,724 INFO L175 Difference]: Start difference. First operand has 35 places, 32 transitions, 76 flow. Second operand 3 states and 80 transitions. [2024-11-19 01:56:24,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 49 transitions, 193 flow [2024-11-19 01:56:24,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 49 transitions, 183 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-19 01:56:24,729 INFO L231 Difference]: Finished difference. Result has 34 places, 33 transitions, 80 flow [2024-11-19 01:56:24,731 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=34, PETRI_TRANSITIONS=33} [2024-11-19 01:56:24,734 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places. [2024-11-19 01:56:24,734 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 33 transitions, 80 flow [2024-11-19 01:56:24,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:56:24,734 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:56:24,735 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:56:24,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 01:56:24,735 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-19 01:56:24,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:56:24,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1461822308, now seen corresponding path program 1 times [2024-11-19 01:56:24,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:56:24,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093261123] [2024-11-19 01:56:24,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:56:24,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:56:25,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:56:25,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:56:25,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:56:25,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093261123] [2024-11-19 01:56:25,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093261123] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:56:25,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:56:25,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:56:25,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159206233] [2024-11-19 01:56:25,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:56:25,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:56:25,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:56:25,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:56:25,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:56:25,294 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 38 [2024-11-19 01:56:25,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 33 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:56:25,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:56:25,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 38 [2024-11-19 01:56:25,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:56:25,534 INFO L124 PetriNetUnfolderBase]: 732/1317 cut-off events. [2024-11-19 01:56:25,535 INFO L125 PetriNetUnfolderBase]: For 132/132 co-relation queries the response was YES. [2024-11-19 01:56:25,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2591 conditions, 1317 events. 732/1317 cut-off events. For 132/132 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 6663 event pairs, 295 based on Foata normal form. 29/1324 useless extension candidates. Maximal degree in co-relation 974. Up to 683 conditions per place. [2024-11-19 01:56:25,544 INFO L140 encePairwiseOnDemand]: 35/38 looper letters, 39 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2024-11-19 01:56:25,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 50 transitions, 207 flow [2024-11-19 01:56:25,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:56:25,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 01:56:25,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2024-11-19 01:56:25,548 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6929824561403509 [2024-11-19 01:56:25,548 INFO L175 Difference]: Start difference. First operand has 34 places, 33 transitions, 80 flow. Second operand 3 states and 79 transitions. [2024-11-19 01:56:25,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 50 transitions, 207 flow [2024-11-19 01:56:25,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 50 transitions, 203 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 01:56:25,553 INFO L231 Difference]: Finished difference. Result has 36 places, 34 transitions, 90 flow [2024-11-19 01:56:25,553 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=36, PETRI_TRANSITIONS=34} [2024-11-19 01:56:25,554 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 1 predicate places. [2024-11-19 01:56:25,554 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 34 transitions, 90 flow [2024-11-19 01:56:25,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:56:25,554 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:56:25,554 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:56:25,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 01:56:25,555 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-19 01:56:25,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:56:25,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1305595972, now seen corresponding path program 1 times [2024-11-19 01:56:25,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:56:25,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514669674] [2024-11-19 01:56:25,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:56:25,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:56:25,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:56:25,982 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:56:25,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:56:25,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514669674] [2024-11-19 01:56:25,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514669674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:56:25,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:56:25,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:56:25,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400576269] [2024-11-19 01:56:25,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:56:25,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:56:25,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:56:25,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:56:25,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:56:25,987 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 38 [2024-11-19 01:56:25,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 34 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:56:25,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:56:25,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 38 [2024-11-19 01:56:25,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:56:26,145 INFO L124 PetriNetUnfolderBase]: 427/899 cut-off events. [2024-11-19 01:56:26,146 INFO L125 PetriNetUnfolderBase]: For 192/192 co-relation queries the response was YES. [2024-11-19 01:56:26,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1867 conditions, 899 events. 427/899 cut-off events. For 192/192 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4315 event pairs, 182 based on Foata normal form. 64/962 useless extension candidates. Maximal degree in co-relation 632. Up to 372 conditions per place. [2024-11-19 01:56:26,153 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 29 selfloop transitions, 8 changer transitions 0/46 dead transitions. [2024-11-19 01:56:26,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 46 transitions, 208 flow [2024-11-19 01:56:26,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:56:26,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 01:56:26,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2024-11-19 01:56:26,156 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-11-19 01:56:26,157 INFO L175 Difference]: Start difference. First operand has 36 places, 34 transitions, 90 flow. Second operand 3 states and 76 transitions. [2024-11-19 01:56:26,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 46 transitions, 208 flow [2024-11-19 01:56:26,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 46 transitions, 204 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 01:56:26,160 INFO L231 Difference]: Finished difference. Result has 37 places, 34 transitions, 104 flow [2024-11-19 01:56:26,160 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=37, PETRI_TRANSITIONS=34} [2024-11-19 01:56:26,161 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2024-11-19 01:56:26,162 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 34 transitions, 104 flow [2024-11-19 01:56:26,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:56:26,162 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:56:26,162 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:56:26,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 01:56:26,163 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-19 01:56:26,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:56:26,163 INFO L85 PathProgramCache]: Analyzing trace with hash 532059826, now seen corresponding path program 2 times [2024-11-19 01:56:26,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:56:26,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856951864] [2024-11-19 01:56:26,164 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 01:56:26,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:56:26,436 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 01:56:26,436 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:56:26,519 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:56:26,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:56:26,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856951864] [2024-11-19 01:56:26,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856951864] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:56:26,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790740290] [2024-11-19 01:56:26,520 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 01:56:26,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:56:26,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:56:26,522 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:56:26,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 01:56:27,018 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 01:56:27,019 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:56:27,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 01:56:27,027 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:56:27,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:56:27,069 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:56:27,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:56:27,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790740290] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:56:27,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 01:56:27,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-19 01:56:27,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147132156] [2024-11-19 01:56:27,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 01:56:27,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:56:27,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:56:27,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:56:27,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:56:27,107 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 38 [2024-11-19 01:56:27,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 34 transitions, 104 flow. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:56:27,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:56:27,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 38 [2024-11-19 01:56:27,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:56:27,391 INFO L124 PetriNetUnfolderBase]: 810/1549 cut-off events. [2024-11-19 01:56:27,393 INFO L125 PetriNetUnfolderBase]: For 499/499 co-relation queries the response was YES. [2024-11-19 01:56:27,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3706 conditions, 1549 events. 810/1549 cut-off events. For 499/499 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 7609 event pairs, 109 based on Foata normal form. 58/1597 useless extension candidates. Maximal degree in co-relation 1343. Up to 382 conditions per place. [2024-11-19 01:56:27,402 INFO L140 encePairwiseOnDemand]: 34/38 looper letters, 68 selfloop transitions, 5 changer transitions 0/81 dead transitions. [2024-11-19 01:56:27,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 81 transitions, 413 flow [2024-11-19 01:56:27,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:56:27,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 01:56:27,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2024-11-19 01:56:27,405 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6894736842105263 [2024-11-19 01:56:27,406 INFO L175 Difference]: Start difference. First operand has 37 places, 34 transitions, 104 flow. Second operand 5 states and 131 transitions. [2024-11-19 01:56:27,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 81 transitions, 413 flow [2024-11-19 01:56:27,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 81 transitions, 385 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 01:56:27,411 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 126 flow [2024-11-19 01:56:27,411 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=126, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2024-11-19 01:56:27,412 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 8 predicate places. [2024-11-19 01:56:27,412 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 126 flow [2024-11-19 01:56:27,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:56:27,414 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:56:27,414 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:56:27,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 01:56:27,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:56:27,615 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-19 01:56:27,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:56:27,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1277988480, now seen corresponding path program 3 times [2024-11-19 01:56:27,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:56:27,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693926362] [2024-11-19 01:56:27,616 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 01:56:27,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:56:27,904 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-19 01:56:27,905 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:56:27,965 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 01:56:27,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:56:27,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693926362] [2024-11-19 01:56:27,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693926362] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:56:27,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632535350] [2024-11-19 01:56:27,966 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 01:56:27,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:56:27,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:56:27,968 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:56:27,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 01:56:28,443 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-19 01:56:28,444 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:56:28,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 01:56:28,448 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:56:28,501 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 01:56:28,502 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:56:28,555 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 01:56:28,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632535350] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:56:28,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 01:56:28,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-11-19 01:56:28,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627839358] [2024-11-19 01:56:28,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 01:56:28,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:56:28,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:56:28,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:56:28,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:56:28,560 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 38 [2024-11-19 01:56:28,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 126 flow. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:56:28,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:56:28,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 38 [2024-11-19 01:56:28,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:56:28,843 INFO L124 PetriNetUnfolderBase]: 1165/2267 cut-off events. [2024-11-19 01:56:28,843 INFO L125 PetriNetUnfolderBase]: For 1317/1317 co-relation queries the response was YES. [2024-11-19 01:56:28,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5452 conditions, 2267 events. 1165/2267 cut-off events. For 1317/1317 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 12207 event pairs, 154 based on Foata normal form. 88/2343 useless extension candidates. Maximal degree in co-relation 3215. Up to 568 conditions per place. [2024-11-19 01:56:28,857 INFO L140 encePairwiseOnDemand]: 34/38 looper letters, 75 selfloop transitions, 5 changer transitions 0/89 dead transitions. [2024-11-19 01:56:28,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 89 transitions, 501 flow [2024-11-19 01:56:28,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:56:28,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 01:56:28,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2024-11-19 01:56:28,860 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7052631578947368 [2024-11-19 01:56:28,860 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 126 flow. Second operand 5 states and 134 transitions. [2024-11-19 01:56:28,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 89 transitions, 501 flow [2024-11-19 01:56:28,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 89 transitions, 477 flow, removed 8 selfloop flow, removed 1 redundant places. [2024-11-19 01:56:28,866 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 150 flow [2024-11-19 01:56:28,866 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=150, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2024-11-19 01:56:28,867 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 14 predicate places. [2024-11-19 01:56:28,868 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 150 flow [2024-11-19 01:56:28,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:56:28,868 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:56:28,869 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:56:28,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 01:56:29,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:56:29,073 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-19 01:56:29,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:56:29,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1480419050, now seen corresponding path program 4 times [2024-11-19 01:56:29,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:56:29,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294825711] [2024-11-19 01:56:29,074 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 01:56:29,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:56:29,274 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 01:56:29,275 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:56:29,431 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-19 01:56:29,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:56:29,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294825711] [2024-11-19 01:56:29,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294825711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:56:29,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:56:29,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:56:29,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533044061] [2024-11-19 01:56:29,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:56:29,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:56:29,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:56:29,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:56:29,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:56:29,436 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 38 [2024-11-19 01:56:29,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 150 flow. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:56:29,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:56:29,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 38 [2024-11-19 01:56:29,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:56:29,690 INFO L124 PetriNetUnfolderBase]: 1088/2198 cut-off events. [2024-11-19 01:56:29,690 INFO L125 PetriNetUnfolderBase]: For 1828/1828 co-relation queries the response was YES. [2024-11-19 01:56:29,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5727 conditions, 2198 events. 1088/2198 cut-off events. For 1828/1828 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 11488 event pairs, 304 based on Foata normal form. 0/2077 useless extension candidates. Maximal degree in co-relation 3760. Up to 1039 conditions per place. [2024-11-19 01:56:29,702 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 45 selfloop transitions, 4 changer transitions 0/58 dead transitions. [2024-11-19 01:56:29,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 58 transitions, 340 flow [2024-11-19 01:56:29,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:56:29,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 01:56:29,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2024-11-19 01:56:29,704 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5723684210526315 [2024-11-19 01:56:29,704 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 150 flow. Second operand 4 states and 87 transitions. [2024-11-19 01:56:29,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 58 transitions, 340 flow [2024-11-19 01:56:29,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 58 transitions, 329 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-11-19 01:56:29,708 INFO L231 Difference]: Finished difference. Result has 53 places, 40 transitions, 169 flow [2024-11-19 01:56:29,708 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=169, PETRI_PLACES=53, PETRI_TRANSITIONS=40} [2024-11-19 01:56:29,709 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 18 predicate places. [2024-11-19 01:56:29,709 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 40 transitions, 169 flow [2024-11-19 01:56:29,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:56:29,710 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:56:29,710 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:56:29,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 01:56:29,710 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-19 01:56:29,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:56:29,711 INFO L85 PathProgramCache]: Analyzing trace with hash 707495440, now seen corresponding path program 5 times [2024-11-19 01:56:29,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:56:29,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406767439] [2024-11-19 01:56:29,711 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 01:56:29,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:56:29,951 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-11-19 01:56:29,951 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:56:30,140 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 31 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 01:56:30,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:56:30,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406767439] [2024-11-19 01:56:30,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406767439] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:56:30,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868555778] [2024-11-19 01:56:30,142 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 01:56:30,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:56:30,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:56:30,144 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:56:30,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 01:56:30,740 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-11-19 01:56:30,741 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:56:30,746 INFO L255 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 01:56:30,748 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:56:30,794 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 25 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 01:56:30,795 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:56:30,851 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 25 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 01:56:30,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868555778] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:56:30,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 01:56:30,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2024-11-19 01:56:30,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58667753] [2024-11-19 01:56:30,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 01:56:30,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:56:30,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:56:30,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:56:30,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:56:30,857 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 38 [2024-11-19 01:56:30,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 40 transitions, 169 flow. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:56:30,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:56:30,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 38 [2024-11-19 01:56:30,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:56:31,016 INFO L124 PetriNetUnfolderBase]: 447/981 cut-off events. [2024-11-19 01:56:31,016 INFO L125 PetriNetUnfolderBase]: For 939/941 co-relation queries the response was YES. [2024-11-19 01:56:31,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2711 conditions, 981 events. 447/981 cut-off events. For 939/941 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4020 event pairs, 122 based on Foata normal form. 0/979 useless extension candidates. Maximal degree in co-relation 1272. Up to 435 conditions per place. [2024-11-19 01:56:31,023 INFO L140 encePairwiseOnDemand]: 34/38 looper letters, 44 selfloop transitions, 3 changer transitions 0/56 dead transitions. [2024-11-19 01:56:31,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 56 transitions, 336 flow [2024-11-19 01:56:31,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:56:31,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 01:56:31,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2024-11-19 01:56:31,024 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5592105263157895 [2024-11-19 01:56:31,024 INFO L175 Difference]: Start difference. First operand has 53 places, 40 transitions, 169 flow. Second operand 4 states and 85 transitions. [2024-11-19 01:56:31,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 56 transitions, 336 flow [2024-11-19 01:56:31,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 56 transitions, 335 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 01:56:31,030 INFO L231 Difference]: Finished difference. Result has 55 places, 38 transitions, 164 flow [2024-11-19 01:56:31,030 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=164, PETRI_PLACES=55, PETRI_TRANSITIONS=38} [2024-11-19 01:56:31,032 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 20 predicate places. [2024-11-19 01:56:31,032 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 38 transitions, 164 flow [2024-11-19 01:56:31,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:56:31,032 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:56:31,032 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:56:31,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-19 01:56:31,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:56:31,239 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-19 01:56:31,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:56:31,239 INFO L85 PathProgramCache]: Analyzing trace with hash 591176762, now seen corresponding path program 6 times [2024-11-19 01:56:31,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:56:31,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662484491] [2024-11-19 01:56:31,240 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 01:56:31,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:56:31,461 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2024-11-19 01:56:31,461 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 01:56:31,462 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 01:56:31,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:56:31,546 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 01:56:31,547 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 01:56:31,548 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-11-19 01:56:31,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-11-19 01:56:31,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-11-19 01:56:31,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 01:56:31,550 INFO L407 BasicCegarLoop]: Path program histogram: [6, 1, 1] [2024-11-19 01:56:31,636 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 01:56:31,636 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 01:56:31,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 01:56:31 BasicIcfg [2024-11-19 01:56:31,641 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 01:56:31,642 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 01:56:31,642 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 01:56:31,642 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 01:56:31,643 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:56:23" (3/4) ... [2024-11-19 01:56:31,643 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-19 01:56:31,722 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 01:56:31,723 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 01:56:31,723 INFO L158 Benchmark]: Toolchain (without parser) took 11016.42ms. Allocated memory was 136.3MB in the beginning and 696.3MB in the end (delta: 559.9MB). Free memory was 64.2MB in the beginning and 512.1MB in the end (delta: -447.9MB). Peak memory consumption was 112.7MB. Max. memory is 16.1GB. [2024-11-19 01:56:31,724 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 136.3MB. Free memory is still 98.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 01:56:31,724 INFO L158 Benchmark]: CACSL2BoogieTranslator took 696.37ms. Allocated memory was 136.3MB in the beginning and 190.8MB in the end (delta: 54.5MB). Free memory was 63.9MB in the beginning and 145.2MB in the end (delta: -81.3MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. [2024-11-19 01:56:31,724 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.18ms. Allocated memory is still 190.8MB. Free memory was 145.2MB in the beginning and 142.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 01:56:31,725 INFO L158 Benchmark]: Boogie Preprocessor took 95.66ms. Allocated memory is still 190.8MB. Free memory was 142.2MB in the beginning and 138.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 01:56:31,725 INFO L158 Benchmark]: RCFGBuilder took 1702.29ms. Allocated memory was 190.8MB in the beginning and 272.6MB in the end (delta: 81.8MB). Free memory was 138.0MB in the beginning and 117.2MB in the end (delta: 20.8MB). Peak memory consumption was 105.6MB. Max. memory is 16.1GB. [2024-11-19 01:56:31,725 INFO L158 Benchmark]: TraceAbstraction took 8352.95ms. Allocated memory was 272.6MB in the beginning and 696.3MB in the end (delta: 423.6MB). Free memory was 116.1MB in the beginning and 524.7MB in the end (delta: -408.6MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. [2024-11-19 01:56:31,726 INFO L158 Benchmark]: Witness Printer took 81.02ms. Allocated memory is still 696.3MB. Free memory was 523.6MB in the beginning and 512.1MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-19 01:56:31,727 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.23ms. Allocated memory is still 136.3MB. Free memory is still 98.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 696.37ms. Allocated memory was 136.3MB in the beginning and 190.8MB in the end (delta: 54.5MB). Free memory was 63.9MB in the beginning and 145.2MB in the end (delta: -81.3MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.18ms. Allocated memory is still 190.8MB. Free memory was 145.2MB in the beginning and 142.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 95.66ms. Allocated memory is still 190.8MB. Free memory was 142.2MB in the beginning and 138.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1702.29ms. Allocated memory was 190.8MB in the beginning and 272.6MB in the end (delta: 81.8MB). Free memory was 138.0MB in the beginning and 117.2MB in the end (delta: 20.8MB). Peak memory consumption was 105.6MB. Max. memory is 16.1GB. * TraceAbstraction took 8352.95ms. Allocated memory was 272.6MB in the beginning and 696.3MB in the end (delta: 423.6MB). Free memory was 116.1MB in the beginning and 524.7MB in the end (delta: -408.6MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. * Witness Printer took 81.02ms. Allocated memory is still 696.3MB. Free memory was 523.6MB in the beginning and 512.1MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 919]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L870] 0 int num; [L871] 0 unsigned long total; [L872] 0 int flag; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L874] 0 pthread_cond_t empty, full; [L907] 0 pthread_t t1, t2; [L908] 0 num = 0 [L909] 0 total = 0 [L913] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [\old(arg)={0:0}, flag=0, m={3:0}, num=0, t1=-2, total=0] [L876] 1 int i; [L877] 1 i = 0 VAL [\old(arg)={0:0}, arg={0:0}, flag=0, i=0, m={3:0}, num=0, total=0] [L878] COND TRUE 1 i < 3 VAL [\old(arg)={0:0}, arg={0:0}, flag=0, i=0, m={3:0}, num=0, total=0] [L914] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, flag=0, i=0, m={3:0}, num=0, t1=-2, t2=-1, total=0] [L890] 2 int j; [L891] 2 j = 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=0, j=0, m={3:0}, num=0, total=0] [L880] COND FALSE 1 !(num > 0) [L882] 1 num++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=0, j=0, m={3:0}, num=1, total=0] [L892] COND TRUE 2 j < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=0, j=0, m={3:0}, num=1, total=0] [L885] 1 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=1, total=0] [L894] COND FALSE 2 !(num == 0) [L896] 2 total = total + j [L897] 2 num-- VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=0, total=0] [L878] COND TRUE 1 i < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=0, total=0] [L900] 2 j++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=1, m={3:0}, num=0, total=0] [L880] COND FALSE 1 !(num > 0) [L882] 1 num++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=1, m={3:0}, num=1, total=0] [L892] COND TRUE 2 j < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=1, m={3:0}, num=1, total=0] [L885] 1 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=1, m={3:0}, num=1, total=0] [L894] COND FALSE 2 !(num == 0) [L896] 2 total = total + j [L897] 2 num-- VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=1, m={3:0}, num=0, total=1] [L878] COND TRUE 1 i < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=1, m={3:0}, num=0, total=1] [L900] 2 j++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=2, m={3:0}, num=0, total=1] [L892] COND TRUE 2 j < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=2, m={3:0}, num=0, total=1] [L880] COND FALSE 1 !(num > 0) [L882] 1 num++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=2, m={3:0}, num=1, total=1] [L885] 1 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=1, total=1] [L878] COND FALSE 1 !(i < 3) [L887] 1 return ((void *)0); [L915] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=1, t1=-2, t2=-1, total=1] [L894] COND FALSE 2 !(num == 0) [L896] 2 total = total + j [L897] 2 num-- VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=0, total=3] [L900] 2 j++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=3, m={3:0}, num=0, total=3] [L892] COND FALSE 2 !(j < 3) [L902] 2 total = total + j [L903] 2 flag = 1 [L904] 2 return ((void *)0); [L916] FCALL, JOIN 2 pthread_join(t2, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, t1=-2, t2=-1, total=6] [L917] COND TRUE 0 \read(flag) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, t1=-2, t2=-1, total=6] [L918] COND FALSE 0 !(total != ((3 * (3 + 1)) / 2)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, t1=-2, t2=-1, total=6] [L919] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, t1=-2, t2=-1, total=6] - UnprovableResult [Line: 913]: 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: 914]: 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, 55 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: 8.1s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 220 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 212 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 528 IncrementalHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 1 mSDtfsCounter, 528 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 251 GetRequests, 231 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=169occurred in iteration=6, InterpolantAutomatonStates: 27, 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.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 388 NumberOfCodeBlocks, 364 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 439 ConstructedInterpolants, 0 QuantifiedInterpolants, 965 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1294 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 13 InterpolantComputations, 4 PerfectInterpolantSequences, 213/243 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-19 01:56:31,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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