./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-trans.wvr.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 c9008ebcceff34245d74f1892a84a552f8268a9318e8a2970f14b3ec6b594daf --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 14:27:22,289 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 14:27:22,378 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 14:27:22,385 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 14:27:22,386 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 14:27:22,418 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 14:27:22,418 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 14:27:22,419 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 14:27:22,419 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 14:27:22,420 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 14:27:22,420 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 14:27:22,421 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 14:27:22,421 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 14:27:22,424 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 14:27:22,424 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 14:27:22,424 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 14:27:22,425 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 14:27:22,425 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 14:27:22,425 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 14:27:22,425 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 14:27:22,426 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 14:27:22,430 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 14:27:22,430 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 14:27:22,431 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 14:27:22,431 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 14:27:22,431 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 14:27:22,431 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 14:27:22,431 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 14:27:22,432 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 14:27:22,432 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 14:27:22,432 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 14:27:22,432 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 14:27:22,432 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:27:22,433 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 14:27:22,433 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 14:27:22,433 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 14:27:22,434 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 14:27:22,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 14:27:22,435 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 14:27:22,435 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 14:27:22,435 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 14:27:22,436 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 14:27:22,436 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-clean/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-clean/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 -> c9008ebcceff34245d74f1892a84a552f8268a9318e8a2970f14b3ec6b594daf [2024-10-11 14:27:22,715 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 14:27:22,737 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 14:27:22,740 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 14:27:22,741 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 14:27:22,742 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 14:27:22,743 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-trans.wvr.c [2024-10-11 14:27:24,148 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 14:27:24,329 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 14:27:24,330 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-trans.wvr.c [2024-10-11 14:27:24,341 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/31569fbc9/2d1a1f6b7a1f45c1a529b81b7f16c848/FLAGd96ca4a1f [2024-10-11 14:27:24,353 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/31569fbc9/2d1a1f6b7a1f45c1a529b81b7f16c848 [2024-10-11 14:27:24,356 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 14:27:24,357 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 14:27:24,358 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 14:27:24,358 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 14:27:24,366 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 14:27:24,367 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:27:24" (1/1) ... [2024-10-11 14:27:24,368 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14e0184f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:27:24, skipping insertion in model container [2024-10-11 14:27:24,368 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:27:24" (1/1) ... [2024-10-11 14:27:24,400 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 14:27:24,608 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-trans.wvr.c[3984,3997] [2024-10-11 14:27:24,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:27:24,633 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 14:27:24,667 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-trans.wvr.c[3984,3997] [2024-10-11 14:27:24,673 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:27:24,691 INFO L204 MainTranslator]: Completed translation [2024-10-11 14:27:24,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:27:24 WrapperNode [2024-10-11 14:27:24,694 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 14:27:24,696 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 14:27:24,696 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 14:27:24,696 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 14:27:24,701 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:27:24" (1/1) ... [2024-10-11 14:27:24,710 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:27:24" (1/1) ... [2024-10-11 14:27:24,744 INFO L138 Inliner]: procedures = 26, calls = 51, calls flagged for inlining = 22, calls inlined = 34, statements flattened = 424 [2024-10-11 14:27:24,745 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 14:27:24,746 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 14:27:24,746 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 14:27:24,746 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 14:27:24,763 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:27:24" (1/1) ... [2024-10-11 14:27:24,763 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:27:24" (1/1) ... [2024-10-11 14:27:24,771 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:27:24" (1/1) ... [2024-10-11 14:27:24,792 INFO L175 MemorySlicer]: Split 26 memory accesses to 3 slices as follows [2, 15, 9]. 58 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 6 writes are split as follows [0, 3, 3]. [2024-10-11 14:27:24,793 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:27:24" (1/1) ... [2024-10-11 14:27:24,793 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:27:24" (1/1) ... [2024-10-11 14:27:24,812 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:27:24" (1/1) ... [2024-10-11 14:27:24,822 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:27:24" (1/1) ... [2024-10-11 14:27:24,824 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:27:24" (1/1) ... [2024-10-11 14:27:24,826 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:27:24" (1/1) ... [2024-10-11 14:27:24,831 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 14:27:24,834 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 14:27:24,835 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 14:27:24,835 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 14:27:24,836 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:27:24" (1/1) ... [2024-10-11 14:27:24,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:27:24,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:27:24,876 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 14:27:24,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 14:27:24,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 14:27:24,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 14:27:24,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 14:27:24,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 14:27:24,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 14:27:24,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 14:27:24,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 14:27:24,931 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-11 14:27:24,931 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-11 14:27:24,931 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-11 14:27:24,931 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-11 14:27:24,932 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-11 14:27:24,933 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-11 14:27:24,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 14:27:24,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 14:27:24,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 14:27:24,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 14:27:24,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 14:27:24,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 14:27:24,936 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 14:27:25,122 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 14:27:25,124 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 14:27:25,741 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 14:27:25,741 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 14:27:26,270 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 14:27:26,271 INFO L314 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-11 14:27:26,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:27:26 BoogieIcfgContainer [2024-10-11 14:27:26,272 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 14:27:26,274 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 14:27:26,274 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 14:27:26,278 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 14:27:26,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:27:24" (1/3) ... [2024-10-11 14:27:26,279 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@700447cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:27:26, skipping insertion in model container [2024-10-11 14:27:26,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:27:24" (2/3) ... [2024-10-11 14:27:26,279 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@700447cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:27:26, skipping insertion in model container [2024-10-11 14:27:26,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:27:26" (3/3) ... [2024-10-11 14:27:26,280 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-node-trans.wvr.c [2024-10-11 14:27:26,298 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 14:27:26,299 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 14:27:26,299 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 14:27:26,365 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-11 14:27:26,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 31 transitions, 83 flow [2024-10-11 14:27:26,435 INFO L124 PetriNetUnfolderBase]: 6/28 cut-off events. [2024-10-11 14:27:26,436 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-11 14:27:26,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 28 events. 6/28 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 13 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2024-10-11 14:27:26,439 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 31 transitions, 83 flow [2024-10-11 14:27:26,442 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 27 transitions, 72 flow [2024-10-11 14:27:26,454 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:27:26,463 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;@186e5635, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:27:26,464 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-11 14:27:26,481 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 14:27:26,481 INFO L124 PetriNetUnfolderBase]: 6/26 cut-off events. [2024-10-11 14:27:26,481 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-11 14:27:26,482 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:27:26,483 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] [2024-10-11 14:27:26,483 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 14:27:26,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:27:26,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1832792802, now seen corresponding path program 1 times [2024-10-11 14:27:26,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:27:26,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420732923] [2024-10-11 14:27:26,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:27:26,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:27:26,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:27:27,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:27:27,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:27:27,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420732923] [2024-10-11 14:27:27,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420732923] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:27:27,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:27:27,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 14:27:27,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667660637] [2024-10-11 14:27:27,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:27:27,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:27:27,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:27:27,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:27:27,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:27:27,206 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-10-11 14:27:27,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 27 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-10-11 14:27:27,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:27:27,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-10-11 14:27:27,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:27:27,331 INFO L124 PetriNetUnfolderBase]: 38/83 cut-off events. [2024-10-11 14:27:27,331 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-10-11 14:27:27,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 83 events. 38/83 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 32 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 120. Up to 82 conditions per place. [2024-10-11 14:27:27,334 INFO L140 encePairwiseOnDemand]: 28/31 looper letters, 25 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2024-10-11 14:27:27,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 28 transitions, 128 flow [2024-10-11 14:27:27,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:27:27,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 14:27:27,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2024-10-11 14:27:27,347 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.43010752688172044 [2024-10-11 14:27:27,349 INFO L175 Difference]: Start difference. First operand has 31 places, 27 transitions, 72 flow. Second operand 3 states and 40 transitions. [2024-10-11 14:27:27,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 28 transitions, 128 flow [2024-10-11 14:27:27,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 28 transitions, 116 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-11 14:27:27,354 INFO L231 Difference]: Finished difference. Result has 28 places, 28 transitions, 72 flow [2024-10-11 14:27:27,357 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=28, PETRI_TRANSITIONS=28} [2024-10-11 14:27:27,362 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, -3 predicate places. [2024-10-11 14:27:27,362 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 28 transitions, 72 flow [2024-10-11 14:27:27,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-10-11 14:27:27,363 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:27:27,363 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] [2024-10-11 14:27:27,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 14:27:27,364 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 14:27:27,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:27:27,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1211915053, now seen corresponding path program 1 times [2024-10-11 14:27:27,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:27:27,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066339111] [2024-10-11 14:27:27,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:27:27,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:27:27,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:27:27,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 14:27:27,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:27:27,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066339111] [2024-10-11 14:27:27,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066339111] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:27:27,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:27:27,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:27:27,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543691834] [2024-10-11 14:27:27,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:27:27,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:27:27,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:27:27,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:27:27,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:27:27,626 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-10-11 14:27:27,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 28 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-10-11 14:27:27,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:27:27,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-10-11 14:27:27,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:27:27,764 INFO L124 PetriNetUnfolderBase]: 38/84 cut-off events. [2024-10-11 14:27:27,765 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 14:27:27,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 84 events. 38/84 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 32 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 172. Up to 81 conditions per place. [2024-10-11 14:27:27,767 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 24 selfloop transitions, 4 changer transitions 0/29 dead transitions. [2024-10-11 14:27:27,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 29 transitions, 130 flow [2024-10-11 14:27:27,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:27:27,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 14:27:27,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2024-10-11 14:27:27,769 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3629032258064516 [2024-10-11 14:27:27,769 INFO L175 Difference]: Start difference. First operand has 28 places, 28 transitions, 72 flow. Second operand 4 states and 45 transitions. [2024-10-11 14:27:27,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 29 transitions, 130 flow [2024-10-11 14:27:27,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 29 transitions, 126 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-10-11 14:27:27,771 INFO L231 Difference]: Finished difference. Result has 31 places, 29 transitions, 86 flow [2024-10-11 14:27:27,771 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=86, PETRI_PLACES=31, PETRI_TRANSITIONS=29} [2024-10-11 14:27:27,772 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 0 predicate places. [2024-10-11 14:27:27,773 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 29 transitions, 86 flow [2024-10-11 14:27:27,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-10-11 14:27:27,773 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:27:27,773 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] [2024-10-11 14:27:27,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 14:27:27,774 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 14:27:27,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:27:27,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1038909340, now seen corresponding path program 1 times [2024-10-11 14:27:27,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:27:27,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354912258] [2024-10-11 14:27:27,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:27:27,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:27:27,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:27:27,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 14:27:27,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:27:27,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354912258] [2024-10-11 14:27:27,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354912258] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:27:27,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:27:27,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:27:27,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899876689] [2024-10-11 14:27:27,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:27:27,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:27:27,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:27:27,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:27:27,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:27:27,955 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-10-11 14:27:27,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 29 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-10-11 14:27:27,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:27:27,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-10-11 14:27:27,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:27:28,074 INFO L124 PetriNetUnfolderBase]: 38/85 cut-off events. [2024-10-11 14:27:28,075 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 14:27:28,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 85 events. 38/85 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 32 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 172. Up to 82 conditions per place. [2024-10-11 14:27:28,076 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 25 selfloop transitions, 4 changer transitions 0/30 dead transitions. [2024-10-11 14:27:28,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 30 transitions, 146 flow [2024-10-11 14:27:28,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:27:28,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 14:27:28,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2024-10-11 14:27:28,081 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3629032258064516 [2024-10-11 14:27:28,082 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 86 flow. Second operand 4 states and 45 transitions. [2024-10-11 14:27:28,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 30 transitions, 146 flow [2024-10-11 14:27:28,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 30 transitions, 145 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 14:27:28,083 INFO L231 Difference]: Finished difference. Result has 34 places, 30 transitions, 103 flow [2024-10-11 14:27:28,083 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=103, PETRI_PLACES=34, PETRI_TRANSITIONS=30} [2024-10-11 14:27:28,084 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 3 predicate places. [2024-10-11 14:27:28,085 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 30 transitions, 103 flow [2024-10-11 14:27:28,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-10-11 14:27:28,088 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:27:28,088 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:27:28,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 14:27:28,089 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 14:27:28,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:27:28,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1091596161, now seen corresponding path program 1 times [2024-10-11 14:27:28,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:27:28,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868655375] [2024-10-11 14:27:28,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:27:28,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:27:28,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:27:28,308 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 14:27:28,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:27:28,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868655375] [2024-10-11 14:27:28,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868655375] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:27:28,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:27:28,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:27:28,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163698926] [2024-10-11 14:27:28,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:27:28,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:27:28,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:27:28,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:27:28,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:27:28,313 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-10-11 14:27:28,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 30 transitions, 103 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-10-11 14:27:28,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:27:28,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-10-11 14:27:28,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:27:28,438 INFO L124 PetriNetUnfolderBase]: 38/86 cut-off events. [2024-10-11 14:27:28,439 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-11 14:27:28,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 86 events. 38/86 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 32 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 179. Up to 84 conditions per place. [2024-10-11 14:27:28,440 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 27 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2024-10-11 14:27:28,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 31 transitions, 165 flow [2024-10-11 14:27:28,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:27:28,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 14:27:28,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2024-10-11 14:27:28,442 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-10-11 14:27:28,442 INFO L175 Difference]: Start difference. First operand has 34 places, 30 transitions, 103 flow. Second operand 4 states and 44 transitions. [2024-10-11 14:27:28,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 31 transitions, 165 flow [2024-10-11 14:27:28,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 31 transitions, 161 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 14:27:28,445 INFO L231 Difference]: Finished difference. Result has 36 places, 31 transitions, 113 flow [2024-10-11 14:27:28,446 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=36, PETRI_TRANSITIONS=31} [2024-10-11 14:27:28,447 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 5 predicate places. [2024-10-11 14:27:28,448 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 31 transitions, 113 flow [2024-10-11 14:27:28,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-10-11 14:27:28,448 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:27:28,449 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] [2024-10-11 14:27:28,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 14:27:28,450 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 14:27:28,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:27:28,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1484568796, now seen corresponding path program 1 times [2024-10-11 14:27:28,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:27:28,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362046344] [2024-10-11 14:27:28,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:27:28,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:27:28,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:27:28,654 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 14:27:28,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:27:28,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362046344] [2024-10-11 14:27:28,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362046344] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:27:28,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:27:28,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:27:28,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756634588] [2024-10-11 14:27:28,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:27:28,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:27:28,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:27:28,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:27:28,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:27:28,657 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-10-11 14:27:28,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 113 flow. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-10-11 14:27:28,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:27:28,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-10-11 14:27:28,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:27:28,770 INFO L124 PetriNetUnfolderBase]: 38/87 cut-off events. [2024-10-11 14:27:28,770 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-11 14:27:28,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 87 events. 38/87 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 32 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 185. Up to 85 conditions per place. [2024-10-11 14:27:28,772 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 28 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2024-10-11 14:27:28,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 32 transitions, 177 flow [2024-10-11 14:27:28,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:27:28,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 14:27:28,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2024-10-11 14:27:28,774 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-10-11 14:27:28,774 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 113 flow. Second operand 4 states and 44 transitions. [2024-10-11 14:27:28,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 32 transitions, 177 flow [2024-10-11 14:27:28,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 32 transitions, 171 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-11 14:27:28,776 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 121 flow [2024-10-11 14:27:28,776 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=121, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2024-10-11 14:27:28,777 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2024-10-11 14:27:28,777 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 121 flow [2024-10-11 14:27:28,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-10-11 14:27:28,777 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:27:28,778 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-10-11 14:27:28,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 14:27:28,778 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 14:27:28,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:27:28,779 INFO L85 PathProgramCache]: Analyzing trace with hash 667979527, now seen corresponding path program 1 times [2024-10-11 14:27:28,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:27:28,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119849395] [2024-10-11 14:27:28,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:27:28,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:27:28,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:27:28,945 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 14:27:28,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:27:28,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119849395] [2024-10-11 14:27:28,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119849395] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:27:28,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:27:28,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:27:28,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863096091] [2024-10-11 14:27:28,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:27:28,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:27:28,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:27:28,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:27:28,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:27:28,949 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-10-11 14:27:28,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 121 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-10-11 14:27:28,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:27:28,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-10-11 14:27:28,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:27:29,049 INFO L124 PetriNetUnfolderBase]: 38/88 cut-off events. [2024-10-11 14:27:29,050 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-10-11 14:27:29,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 88 events. 38/88 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 32 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 190. Up to 86 conditions per place. [2024-10-11 14:27:29,051 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 29 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2024-10-11 14:27:29,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 33 transitions, 187 flow [2024-10-11 14:27:29,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:27:29,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 14:27:29,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2024-10-11 14:27:29,052 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-10-11 14:27:29,053 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 121 flow. Second operand 4 states and 44 transitions. [2024-10-11 14:27:29,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 33 transitions, 187 flow [2024-10-11 14:27:29,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 33 transitions, 181 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-11 14:27:29,054 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 129 flow [2024-10-11 14:27:29,055 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=129, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2024-10-11 14:27:29,055 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 9 predicate places. [2024-10-11 14:27:29,056 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 129 flow [2024-10-11 14:27:29,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-10-11 14:27:29,056 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:27:29,056 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:27:29,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 14:27:29,057 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 14:27:29,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:27:29,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1966291484, now seen corresponding path program 1 times [2024-10-11 14:27:29,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:27:29,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163699490] [2024-10-11 14:27:29,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:27:29,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:27:29,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:27:30,454 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 14:27:30,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:27:30,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163699490] [2024-10-11 14:27:30,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163699490] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:27:30,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:27:30,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:27:30,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432078943] [2024-10-11 14:27:30,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:27:30,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:27:30,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:27:30,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:27:30,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:27:30,458 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-10-11 14:27:30,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 129 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-10-11 14:27:30,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:27:30,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-10-11 14:27:30,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:27:30,728 INFO L124 PetriNetUnfolderBase]: 39/107 cut-off events. [2024-10-11 14:27:30,728 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-10-11 14:27:30,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 107 events. 39/107 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 284 event pairs, 7 based on Foata normal form. 1/107 useless extension candidates. Maximal degree in co-relation 231. Up to 41 conditions per place. [2024-10-11 14:27:30,729 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 42 selfloop transitions, 2 changer transitions 7/52 dead transitions. [2024-10-11 14:27:30,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 52 transitions, 278 flow [2024-10-11 14:27:30,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:27:30,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 14:27:30,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2024-10-11 14:27:30,731 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4258064516129032 [2024-10-11 14:27:30,731 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 129 flow. Second operand 5 states and 66 transitions. [2024-10-11 14:27:30,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 52 transitions, 278 flow [2024-10-11 14:27:30,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 52 transitions, 272 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-11 14:27:30,734 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 138 flow [2024-10-11 14:27:30,734 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=38, 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=5, PETRI_FLOW=138, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2024-10-11 14:27:30,735 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 14 predicate places. [2024-10-11 14:27:30,735 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 138 flow [2024-10-11 14:27:30,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-10-11 14:27:30,735 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:27:30,736 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:27:30,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 14:27:30,736 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 14:27:30,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:27:30,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1611634074, now seen corresponding path program 2 times [2024-10-11 14:27:30,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:27:30,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777458948] [2024-10-11 14:27:30,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:27:30,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:27:30,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:27:31,750 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 14:27:31,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:27:31,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777458948] [2024-10-11 14:27:31,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777458948] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:27:31,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:27:31,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:27:31,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777838842] [2024-10-11 14:27:31,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:27:31,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:27:31,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:27:31,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:27:31,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:27:31,753 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-10-11 14:27:31,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 138 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-10-11 14:27:31,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:27:31,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-10-11 14:27:31,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:27:31,992 INFO L124 PetriNetUnfolderBase]: 35/112 cut-off events. [2024-10-11 14:27:31,992 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2024-10-11 14:27:31,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 319 conditions, 112 events. 35/112 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 305 event pairs, 10 based on Foata normal form. 1/112 useless extension candidates. Maximal degree in co-relation 295. Up to 48 conditions per place. [2024-10-11 14:27:31,996 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 41 selfloop transitions, 3 changer transitions 5/50 dead transitions. [2024-10-11 14:27:31,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 50 transitions, 286 flow [2024-10-11 14:27:31,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:27:31,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 14:27:31,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2024-10-11 14:27:31,998 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4064516129032258 [2024-10-11 14:27:31,998 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 138 flow. Second operand 5 states and 63 transitions. [2024-10-11 14:27:31,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 50 transitions, 286 flow [2024-10-11 14:27:32,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 50 transitions, 279 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-10-11 14:27:32,004 INFO L231 Difference]: Finished difference. Result has 49 places, 35 transitions, 155 flow [2024-10-11 14:27:32,004 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=49, PETRI_TRANSITIONS=35} [2024-10-11 14:27:32,005 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 18 predicate places. [2024-10-11 14:27:32,005 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 35 transitions, 155 flow [2024-10-11 14:27:32,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-10-11 14:27:32,005 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:27:32,005 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:27:32,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 14:27:32,006 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 14:27:32,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:27:32,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1727440918, now seen corresponding path program 3 times [2024-10-11 14:27:32,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:27:32,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023467335] [2024-10-11 14:27:32,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:27:32,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:27:32,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:27:33,042 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 14:27:33,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:27:33,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023467335] [2024-10-11 14:27:33,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023467335] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:27:33,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:27:33,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:27:33,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674520302] [2024-10-11 14:27:33,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:27:33,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:27:33,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:27:33,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:27:33,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:27:33,046 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-10-11 14:27:33,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 35 transitions, 155 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-10-11 14:27:33,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:27:33,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-10-11 14:27:33,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:27:33,301 INFO L124 PetriNetUnfolderBase]: 35/115 cut-off events. [2024-10-11 14:27:33,301 INFO L125 PetriNetUnfolderBase]: For 172/172 co-relation queries the response was YES. [2024-10-11 14:27:33,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 379 conditions, 115 events. 35/115 cut-off events. For 172/172 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 356 event pairs, 8 based on Foata normal form. 1/115 useless extension candidates. Maximal degree in co-relation 353. Up to 50 conditions per place. [2024-10-11 14:27:33,303 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 40 selfloop transitions, 2 changer transitions 9/52 dead transitions. [2024-10-11 14:27:33,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 52 transitions, 318 flow [2024-10-11 14:27:33,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:27:33,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 14:27:33,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2024-10-11 14:27:33,305 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4129032258064516 [2024-10-11 14:27:33,305 INFO L175 Difference]: Start difference. First operand has 49 places, 35 transitions, 155 flow. Second operand 5 states and 64 transitions. [2024-10-11 14:27:33,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 52 transitions, 318 flow [2024-10-11 14:27:33,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 52 transitions, 307 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-10-11 14:27:33,308 INFO L231 Difference]: Finished difference. Result has 53 places, 35 transitions, 162 flow [2024-10-11 14:27:33,308 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=162, PETRI_PLACES=53, PETRI_TRANSITIONS=35} [2024-10-11 14:27:33,309 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 22 predicate places. [2024-10-11 14:27:33,309 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 35 transitions, 162 flow [2024-10-11 14:27:33,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-10-11 14:27:33,309 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:27:33,310 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:27:33,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 14:27:33,310 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 14:27:33,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:27:33,311 INFO L85 PathProgramCache]: Analyzing trace with hash 494017660, now seen corresponding path program 4 times [2024-10-11 14:27:33,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:27:33,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885496993] [2024-10-11 14:27:33,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:27:33,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:27:33,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:27:34,194 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 14:27:34,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:27:34,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885496993] [2024-10-11 14:27:34,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885496993] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:27:34,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:27:34,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:27:34,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9669625] [2024-10-11 14:27:34,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:27:34,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:27:34,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:27:34,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:27:34,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:27:34,197 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-10-11 14:27:34,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 35 transitions, 162 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-10-11 14:27:34,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:27:34,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-10-11 14:27:34,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:27:34,385 INFO L124 PetriNetUnfolderBase]: 30/98 cut-off events. [2024-10-11 14:27:34,385 INFO L125 PetriNetUnfolderBase]: For 256/256 co-relation queries the response was YES. [2024-10-11 14:27:34,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 356 conditions, 98 events. 30/98 cut-off events. For 256/256 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 227 event pairs, 15 based on Foata normal form. 1/98 useless extension candidates. Maximal degree in co-relation 332. Up to 64 conditions per place. [2024-10-11 14:27:34,387 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 40 selfloop transitions, 3 changer transitions 7/51 dead transitions. [2024-10-11 14:27:34,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 51 transitions, 330 flow [2024-10-11 14:27:34,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:27:34,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 14:27:34,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2024-10-11 14:27:34,388 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-10-11 14:27:34,388 INFO L175 Difference]: Start difference. First operand has 53 places, 35 transitions, 162 flow. Second operand 5 states and 62 transitions. [2024-10-11 14:27:34,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 51 transitions, 330 flow [2024-10-11 14:27:34,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 51 transitions, 311 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-10-11 14:27:34,390 INFO L231 Difference]: Finished difference. Result has 55 places, 35 transitions, 169 flow [2024-10-11 14:27:34,391 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=169, PETRI_PLACES=55, PETRI_TRANSITIONS=35} [2024-10-11 14:27:34,391 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 24 predicate places. [2024-10-11 14:27:34,392 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 35 transitions, 169 flow [2024-10-11 14:27:34,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-10-11 14:27:34,392 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:27:34,392 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:27:34,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 14:27:34,393 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 14:27:34,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:27:34,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1025750212, now seen corresponding path program 5 times [2024-10-11 14:27:34,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:27:34,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916796682] [2024-10-11 14:27:34,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:27:34,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:27:34,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:27:35,308 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 14:27:35,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:27:35,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916796682] [2024-10-11 14:27:35,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916796682] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:27:35,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:27:35,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:27:35,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297016798] [2024-10-11 14:27:35,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:27:35,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:27:35,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:27:35,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:27:35,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:27:35,310 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-10-11 14:27:35,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 35 transitions, 169 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-10-11 14:27:35,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:27:35,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-10-11 14:27:35,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:27:35,468 INFO L124 PetriNetUnfolderBase]: 24/77 cut-off events. [2024-10-11 14:27:35,469 INFO L125 PetriNetUnfolderBase]: For 170/170 co-relation queries the response was YES. [2024-10-11 14:27:35,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 296 conditions, 77 events. 24/77 cut-off events. For 170/170 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 144 event pairs, 7 based on Foata normal form. 1/77 useless extension candidates. Maximal degree in co-relation 276. Up to 45 conditions per place. [2024-10-11 14:27:35,470 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 33 selfloop transitions, 1 changer transitions 14/49 dead transitions. [2024-10-11 14:27:35,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 49 transitions, 307 flow [2024-10-11 14:27:35,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:27:35,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 14:27:35,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2024-10-11 14:27:35,471 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-10-11 14:27:35,471 INFO L175 Difference]: Start difference. First operand has 55 places, 35 transitions, 169 flow. Second operand 5 states and 62 transitions. [2024-10-11 14:27:35,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 49 transitions, 307 flow [2024-10-11 14:27:35,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 49 transitions, 295 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-10-11 14:27:35,478 INFO L231 Difference]: Finished difference. Result has 56 places, 33 transitions, 148 flow [2024-10-11 14:27:35,478 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=148, PETRI_PLACES=56, PETRI_TRANSITIONS=33} [2024-10-11 14:27:35,479 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 25 predicate places. [2024-10-11 14:27:35,479 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 33 transitions, 148 flow [2024-10-11 14:27:35,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-10-11 14:27:35,479 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:27:35,480 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:27:35,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 14:27:35,480 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 14:27:35,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:27:35,481 INFO L85 PathProgramCache]: Analyzing trace with hash -143211830, now seen corresponding path program 6 times [2024-10-11 14:27:35,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:27:35,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102231039] [2024-10-11 14:27:35,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:27:35,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:27:35,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:27:36,664 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 14:27:36,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:27:36,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102231039] [2024-10-11 14:27:36,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102231039] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:27:36,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:27:36,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:27:36,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998438277] [2024-10-11 14:27:36,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:27:36,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:27:36,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:27:36,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:27:36,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:27:36,666 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-10-11 14:27:36,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 33 transitions, 148 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-10-11 14:27:36,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:27:36,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-10-11 14:27:36,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:27:36,829 INFO L124 PetriNetUnfolderBase]: 15/51 cut-off events. [2024-10-11 14:27:36,830 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2024-10-11 14:27:36,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 51 events. 15/51 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 42 event pairs, 5 based on Foata normal form. 1/51 useless extension candidates. Maximal degree in co-relation 181. Up to 38 conditions per place. [2024-10-11 14:27:36,831 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 0 selfloop transitions, 0 changer transitions 37/37 dead transitions. [2024-10-11 14:27:36,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 37 transitions, 236 flow [2024-10-11 14:27:36,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:27:36,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 14:27:36,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2024-10-11 14:27:36,833 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.33548387096774196 [2024-10-11 14:27:36,833 INFO L175 Difference]: Start difference. First operand has 56 places, 33 transitions, 148 flow. Second operand 5 states and 52 transitions. [2024-10-11 14:27:36,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 37 transitions, 236 flow [2024-10-11 14:27:36,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 37 transitions, 218 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-10-11 14:27:36,834 INFO L231 Difference]: Finished difference. Result has 47 places, 0 transitions, 0 flow [2024-10-11 14:27:36,834 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=47, PETRI_TRANSITIONS=0} [2024-10-11 14:27:36,836 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 16 predicate places. [2024-10-11 14:27:36,836 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 0 transitions, 0 flow [2024-10-11 14:27:36,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-10-11 14:27:36,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2024-10-11 14:27:36,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2024-10-11 14:27:36,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-10-11 14:27:36,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-10-11 14:27:36,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 14:27:36,840 INFO L407 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1] [2024-10-11 14:27:36,847 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 14:27:36,847 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 14:27:36,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:27:36 BasicIcfg [2024-10-11 14:27:36,853 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 14:27:36,853 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 14:27:36,854 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 14:27:36,854 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 14:27:36,854 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:27:26" (3/4) ... [2024-10-11 14:27:36,856 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 14:27:36,859 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-11 14:27:36,859 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-11 14:27:36,859 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-10-11 14:27:36,875 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 330 nodes and edges [2024-10-11 14:27:36,878 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 43 nodes and edges [2024-10-11 14:27:36,879 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-10-11 14:27:36,880 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 14:27:36,995 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 14:27:36,996 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 14:27:36,996 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 14:27:36,997 INFO L158 Benchmark]: Toolchain (without parser) took 12639.52ms. Allocated memory was 186.6MB in the beginning and 601.9MB in the end (delta: 415.2MB). Free memory was 135.2MB in the beginning and 430.9MB in the end (delta: -295.7MB). Peak memory consumption was 119.7MB. Max. memory is 16.1GB. [2024-10-11 14:27:36,997 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 100.7MB. Free memory was 64.6MB in the beginning and 64.6MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 14:27:36,997 INFO L158 Benchmark]: CACSL2BoogieTranslator took 336.58ms. Allocated memory is still 186.6MB. Free memory was 135.2MB in the beginning and 120.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 14:27:36,997 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.47ms. Allocated memory is still 186.6MB. Free memory was 120.4MB in the beginning and 116.9MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 14:27:36,998 INFO L158 Benchmark]: Boogie Preprocessor took 86.93ms. Allocated memory is still 186.6MB. Free memory was 116.9MB in the beginning and 112.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 14:27:36,998 INFO L158 Benchmark]: RCFGBuilder took 1437.81ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 112.7MB in the beginning and 139.2MB in the end (delta: -26.4MB). Peak memory consumption was 67.5MB. Max. memory is 16.1GB. [2024-10-11 14:27:36,998 INFO L158 Benchmark]: TraceAbstraction took 10578.45ms. Allocated memory was 224.4MB in the beginning and 601.9MB in the end (delta: 377.5MB). Free memory was 138.1MB in the beginning and 440.3MB in the end (delta: -302.2MB). Peak memory consumption was 75.3MB. Max. memory is 16.1GB. [2024-10-11 14:27:36,999 INFO L158 Benchmark]: Witness Printer took 142.92ms. Allocated memory is still 601.9MB. Free memory was 440.3MB in the beginning and 430.9MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 14:27:37,000 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.16ms. Allocated memory is still 100.7MB. Free memory was 64.6MB in the beginning and 64.6MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 336.58ms. Allocated memory is still 186.6MB. Free memory was 135.2MB in the beginning and 120.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.47ms. Allocated memory is still 186.6MB. Free memory was 120.4MB in the beginning and 116.9MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.93ms. Allocated memory is still 186.6MB. Free memory was 116.9MB in the beginning and 112.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1437.81ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 112.7MB in the beginning and 139.2MB in the end (delta: -26.4MB). Peak memory consumption was 67.5MB. Max. memory is 16.1GB. * TraceAbstraction took 10578.45ms. Allocated memory was 224.4MB in the beginning and 601.9MB in the end (delta: 377.5MB). Free memory was 138.1MB in the beginning and 440.3MB in the end (delta: -302.2MB). Peak memory consumption was 75.3MB. Max. memory is 16.1GB. * Witness Printer took 142.92ms. Allocated memory is still 601.9MB. Free memory was 440.3MB in the beginning and 430.9MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 109]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 35 locations, 4 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: 10.4s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 193 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 193 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1061 IncrementalHoareTripleChecker+Invalid, 1063 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 0 mSDtfsCounter, 1061 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=169occurred in iteration=10, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 303 NumberOfCodeBlocks, 303 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 291 ConstructedInterpolants, 0 QuantifiedInterpolants, 1551 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 51/51 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-11 14:27:37,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE