./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-subst.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-subst.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 3b43103ca9a91605874c4d895f03c4116805b9b245b91cffe9bd63255503e5a0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 14:27:20,296 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 14:27:20,342 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:20,347 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 14:27:20,347 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 14:27:20,370 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 14:27:20,370 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 14:27:20,371 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 14:27:20,371 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 14:27:20,372 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 14:27:20,372 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 14:27:20,373 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 14:27:20,373 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 14:27:20,373 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 14:27:20,375 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 14:27:20,375 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 14:27:20,375 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 14:27:20,375 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 14:27:20,376 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 14:27:20,376 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 14:27:20,376 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 14:27:20,377 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 14:27:20,379 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 14:27:20,379 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 14:27:20,379 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 14:27:20,379 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 14:27:20,379 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 14:27:20,380 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 14:27:20,380 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 14:27:20,380 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 14:27:20,380 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 14:27:20,380 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 14:27:20,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:27:20,380 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 14:27:20,381 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 14:27:20,381 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 14:27:20,381 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 14:27:20,381 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 14:27:20,381 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 14:27:20,381 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 14:27:20,381 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 14:27:20,383 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 14:27:20,383 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 -> 3b43103ca9a91605874c4d895f03c4116805b9b245b91cffe9bd63255503e5a0 [2024-10-11 14:27:20,621 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 14:27:20,640 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 14:27:20,642 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 14:27:20,644 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 14:27:20,644 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 14:27:20,645 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-subst.wvr.c [2024-10-11 14:27:21,837 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 14:27:22,024 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 14:27:22,025 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-subst.wvr.c [2024-10-11 14:27:22,031 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1ae69d9dc/ea66af2eeb7c425a861a5bf193bd12aa/FLAG3e3d66735 [2024-10-11 14:27:22,043 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1ae69d9dc/ea66af2eeb7c425a861a5bf193bd12aa [2024-10-11 14:27:22,045 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 14:27:22,046 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 14:27:22,049 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 14:27:22,049 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 14:27:22,053 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 14:27:22,054 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:27:22" (1/1) ... [2024-10-11 14:27:22,054 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13e1b703 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:27:22, skipping insertion in model container [2024-10-11 14:27:22,055 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:27:22" (1/1) ... [2024-10-11 14:27:22,075 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 14:27:22,266 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-subst.wvr.c[4035,4048] [2024-10-11 14:27:22,281 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:27:22,288 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 14:27:22,321 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-subst.wvr.c[4035,4048] [2024-10-11 14:27:22,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:27:22,348 INFO L204 MainTranslator]: Completed translation [2024-10-11 14:27:22,348 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:27:22 WrapperNode [2024-10-11 14:27:22,349 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 14:27:22,350 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 14:27:22,350 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 14:27:22,350 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 14:27:22,356 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:22" (1/1) ... [2024-10-11 14:27:22,367 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:22" (1/1) ... [2024-10-11 14:27:22,410 INFO L138 Inliner]: procedures = 26, calls = 51, calls flagged for inlining = 22, calls inlined = 34, statements flattened = 424 [2024-10-11 14:27:22,414 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 14:27:22,415 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 14:27:22,415 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 14:27:22,415 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 14:27:22,427 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:22" (1/1) ... [2024-10-11 14:27:22,427 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:22" (1/1) ... [2024-10-11 14:27:22,431 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:22" (1/1) ... [2024-10-11 14:27:22,456 INFO L175 MemorySlicer]: Split 26 memory accesses to 3 slices as follows [2, 9, 15]. 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:22,456 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:22" (1/1) ... [2024-10-11 14:27:22,457 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:22" (1/1) ... [2024-10-11 14:27:22,470 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:22" (1/1) ... [2024-10-11 14:27:22,477 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:22" (1/1) ... [2024-10-11 14:27:22,482 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:22" (1/1) ... [2024-10-11 14:27:22,483 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:22" (1/1) ... [2024-10-11 14:27:22,492 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 14:27:22,493 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 14:27:22,493 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 14:27:22,493 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 14:27:22,494 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:27:22" (1/1) ... [2024-10-11 14:27:22,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:27:22,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:27:22,524 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:22,528 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:22,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 14:27:22,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 14:27:22,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 14:27:22,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 14:27:22,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 14:27:22,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 14:27:22,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 14:27:22,568 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-11 14:27:22,569 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-11 14:27:22,569 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-11 14:27:22,570 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-11 14:27:22,570 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-11 14:27:22,570 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-11 14:27:22,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 14:27:22,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 14:27:22,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 14:27:22,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 14:27:22,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 14:27:22,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 14:27:22,573 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:22,694 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 14:27:22,696 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 14:27:23,194 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 14:27:23,194 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 14:27:23,622 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 14:27:23,624 INFO L314 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-11 14:27:23,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:27:23 BoogieIcfgContainer [2024-10-11 14:27:23,624 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 14:27:23,625 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 14:27:23,626 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 14:27:23,628 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 14:27:23,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:27:22" (1/3) ... [2024-10-11 14:27:23,629 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1385fe97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:27:23, skipping insertion in model container [2024-10-11 14:27:23,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:27:22" (2/3) ... [2024-10-11 14:27:23,629 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1385fe97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:27:23, skipping insertion in model container [2024-10-11 14:27:23,630 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:27:23" (3/3) ... [2024-10-11 14:27:23,631 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-node-subst.wvr.c [2024-10-11 14:27:23,646 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 14:27:23,646 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 14:27:23,646 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 14:27:23,707 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-11 14:27:23,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 31 transitions, 83 flow [2024-10-11 14:27:23,777 INFO L124 PetriNetUnfolderBase]: 6/28 cut-off events. [2024-10-11 14:27:23,778 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-11 14:27:23,780 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:23,780 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 31 transitions, 83 flow [2024-10-11 14:27:23,782 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 27 transitions, 72 flow [2024-10-11 14:27:23,792 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:27:23,800 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;@30bfebfb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:27:23,800 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-11 14:27:23,840 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 14:27:23,840 INFO L124 PetriNetUnfolderBase]: 6/26 cut-off events. [2024-10-11 14:27:23,840 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-11 14:27:23,840 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:27:23,841 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:23,842 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:23,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:27:23,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1832792802, now seen corresponding path program 1 times [2024-10-11 14:27:23,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:27:23,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891252588] [2024-10-11 14:27:23,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:27:23,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:27:24,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:27:24,324 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:24,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:27:24,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891252588] [2024-10-11 14:27:24,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891252588] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:27:24,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:27:24,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 14:27:24,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71109895] [2024-10-11 14:27:24,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:27:24,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:27:24,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:27:24,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:27:24,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:27:24,357 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-10-11 14:27:24,359 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:24,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:27:24,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-10-11 14:27:24,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:27:24,458 INFO L124 PetriNetUnfolderBase]: 38/83 cut-off events. [2024-10-11 14:27:24,459 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-10-11 14:27:24,460 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:24,462 INFO L140 encePairwiseOnDemand]: 28/31 looper letters, 25 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2024-10-11 14:27:24,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 28 transitions, 128 flow [2024-10-11 14:27:24,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:27:24,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 14:27:24,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2024-10-11 14:27:24,472 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.43010752688172044 [2024-10-11 14:27:24,474 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:24,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 28 transitions, 128 flow [2024-10-11 14:27:24,477 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:24,479 INFO L231 Difference]: Finished difference. Result has 28 places, 28 transitions, 72 flow [2024-10-11 14:27:24,481 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:24,484 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, -3 predicate places. [2024-10-11 14:27:24,485 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 28 transitions, 72 flow [2024-10-11 14:27:24,486 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:24,486 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:27:24,486 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:24,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 14:27:24,487 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:24,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:27:24,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1211915053, now seen corresponding path program 1 times [2024-10-11 14:27:24,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:27:24,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214602204] [2024-10-11 14:27:24,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:27:24,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:27:24,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:27:24,676 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:24,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:27:24,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214602204] [2024-10-11 14:27:24,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214602204] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:27:24,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:27:24,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:27:24,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687444683] [2024-10-11 14:27:24,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:27:24,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:27:24,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:27:24,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:27:24,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:27:24,679 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-10-11 14:27:24,679 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:24,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:27:24,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-10-11 14:27:24,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:27:24,784 INFO L124 PetriNetUnfolderBase]: 38/84 cut-off events. [2024-10-11 14:27:24,785 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 14:27:24,785 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:24,786 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 24 selfloop transitions, 4 changer transitions 0/29 dead transitions. [2024-10-11 14:27:24,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 29 transitions, 130 flow [2024-10-11 14:27:24,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:27:24,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 14:27:24,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2024-10-11 14:27:24,788 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3629032258064516 [2024-10-11 14:27:24,788 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:24,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 29 transitions, 130 flow [2024-10-11 14:27:24,789 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:24,789 INFO L231 Difference]: Finished difference. Result has 31 places, 29 transitions, 86 flow [2024-10-11 14:27:24,790 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:24,790 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 0 predicate places. [2024-10-11 14:27:24,790 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 29 transitions, 86 flow [2024-10-11 14:27:24,790 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:24,790 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:27:24,790 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:24,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 14:27:24,791 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:24,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:27:24,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1038909340, now seen corresponding path program 1 times [2024-10-11 14:27:24,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:27:24,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917741652] [2024-10-11 14:27:24,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:27:24,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:27:24,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:27:24,955 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:24,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:27:24,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917741652] [2024-10-11 14:27:24,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917741652] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:27:24,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:27:24,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:27:24,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654467489] [2024-10-11 14:27:24,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:27:24,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:27:24,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:27:24,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:27:24,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:27:24,959 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-10-11 14:27:24,959 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:24,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:27:24,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-10-11 14:27:24,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:27:25,067 INFO L124 PetriNetUnfolderBase]: 38/85 cut-off events. [2024-10-11 14:27:25,067 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 14:27:25,071 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:25,072 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 25 selfloop transitions, 4 changer transitions 0/30 dead transitions. [2024-10-11 14:27:25,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 30 transitions, 146 flow [2024-10-11 14:27:25,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:27:25,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 14:27:25,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2024-10-11 14:27:25,073 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3629032258064516 [2024-10-11 14:27:25,073 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:25,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 30 transitions, 146 flow [2024-10-11 14:27:25,074 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:25,074 INFO L231 Difference]: Finished difference. Result has 34 places, 30 transitions, 103 flow [2024-10-11 14:27:25,075 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:25,079 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 3 predicate places. [2024-10-11 14:27:25,079 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 30 transitions, 103 flow [2024-10-11 14:27:25,079 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:25,079 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:27:25,079 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:25,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 14:27:25,080 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:25,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:27:25,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1091596161, now seen corresponding path program 1 times [2024-10-11 14:27:25,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:27:25,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001435064] [2024-10-11 14:27:25,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:27:25,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:27:25,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:27:25,196 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:25,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:27:25,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001435064] [2024-10-11 14:27:25,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001435064] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:27:25,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:27:25,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:27:25,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868255569] [2024-10-11 14:27:25,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:27:25,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:27:25,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:27:25,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:27:25,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:27:25,198 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-10-11 14:27:25,198 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:25,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:27:25,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-10-11 14:27:25,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:27:25,281 INFO L124 PetriNetUnfolderBase]: 38/86 cut-off events. [2024-10-11 14:27:25,282 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-11 14:27:25,282 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:25,284 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 27 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2024-10-11 14:27:25,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 31 transitions, 165 flow [2024-10-11 14:27:25,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:27:25,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 14:27:25,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2024-10-11 14:27:25,286 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-10-11 14:27:25,286 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:25,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 31 transitions, 165 flow [2024-10-11 14:27:25,287 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:25,288 INFO L231 Difference]: Finished difference. Result has 36 places, 31 transitions, 113 flow [2024-10-11 14:27:25,288 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:25,289 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 5 predicate places. [2024-10-11 14:27:25,289 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 31 transitions, 113 flow [2024-10-11 14:27:25,289 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:25,289 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:27:25,290 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:25,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 14:27:25,290 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:25,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:27:25,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1484568796, now seen corresponding path program 1 times [2024-10-11 14:27:25,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:27:25,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541737638] [2024-10-11 14:27:25,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:27:25,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:27:25,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:27:25,411 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:25,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:27:25,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541737638] [2024-10-11 14:27:25,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541737638] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:27:25,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:27:25,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:27:25,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805489591] [2024-10-11 14:27:25,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:27:25,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:27:25,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:27:25,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:27:25,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:27:25,413 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-10-11 14:27:25,413 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:25,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:27:25,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-10-11 14:27:25,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:27:25,495 INFO L124 PetriNetUnfolderBase]: 38/87 cut-off events. [2024-10-11 14:27:25,496 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-11 14:27:25,496 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:25,497 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 28 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2024-10-11 14:27:25,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 32 transitions, 177 flow [2024-10-11 14:27:25,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:27:25,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 14:27:25,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2024-10-11 14:27:25,498 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-10-11 14:27:25,498 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:25,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 32 transitions, 177 flow [2024-10-11 14:27:25,499 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:25,499 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 121 flow [2024-10-11 14:27:25,499 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:25,500 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2024-10-11 14:27:25,500 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 121 flow [2024-10-11 14:27:25,500 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:25,500 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:27:25,501 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:25,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 14:27:25,501 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:25,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:27:25,501 INFO L85 PathProgramCache]: Analyzing trace with hash 667979527, now seen corresponding path program 1 times [2024-10-11 14:27:25,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:27:25,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048500882] [2024-10-11 14:27:25,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:27:25,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:27:25,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:27:25,617 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:25,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:27:25,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048500882] [2024-10-11 14:27:25,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048500882] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:27:25,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:27:25,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:27:25,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661661674] [2024-10-11 14:27:25,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:27:25,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:27:25,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:27:25,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:27:25,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:27:25,621 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-10-11 14:27:25,621 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:25,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:27:25,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-10-11 14:27:25,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:27:25,728 INFO L124 PetriNetUnfolderBase]: 38/88 cut-off events. [2024-10-11 14:27:25,728 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-10-11 14:27:25,728 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:25,729 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 29 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2024-10-11 14:27:25,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 33 transitions, 187 flow [2024-10-11 14:27:25,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:27:25,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 14:27:25,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2024-10-11 14:27:25,730 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-10-11 14:27:25,731 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:25,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 33 transitions, 187 flow [2024-10-11 14:27:25,732 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:25,732 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 129 flow [2024-10-11 14:27:25,732 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:25,733 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 9 predicate places. [2024-10-11 14:27:25,733 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 129 flow [2024-10-11 14:27:25,734 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:25,734 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:27:25,734 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:25,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 14:27:25,734 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:25,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:27:25,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1966291484, now seen corresponding path program 1 times [2024-10-11 14:27:25,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:27:25,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956802181] [2024-10-11 14:27:25,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:27:25,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:27:26,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:27:28,474 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:28,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:27:28,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956802181] [2024-10-11 14:27:28,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956802181] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:27:28,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:27:28,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 14:27:28,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898485674] [2024-10-11 14:27:28,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:27:28,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:27:28,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:27:28,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:27:28,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:27:28,476 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-10-11 14:27:28,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 129 flow. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:27:28,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:27:28,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-10-11 14:27:28,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:27:28,722 INFO L124 PetriNetUnfolderBase]: 39/107 cut-off events. [2024-10-11 14:27:28,723 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-10-11 14:27:28,724 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 39 conditions per place. [2024-10-11 14:27:28,724 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 40 selfloop transitions, 4 changer transitions 7/52 dead transitions. [2024-10-11 14:27:28,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 52 transitions, 278 flow [2024-10-11 14:27:28,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:27:28,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 14:27:28,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2024-10-11 14:27:28,727 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3763440860215054 [2024-10-11 14:27:28,727 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 129 flow. Second operand 6 states and 70 transitions. [2024-10-11 14:27:28,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 52 transitions, 278 flow [2024-10-11 14:27:28,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 52 transitions, 272 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-11 14:27:28,730 INFO L231 Difference]: Finished difference. Result has 46 places, 34 transitions, 142 flow [2024-10-11 14:27:28,731 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=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=142, PETRI_PLACES=46, PETRI_TRANSITIONS=34} [2024-10-11 14:27:28,731 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 15 predicate places. [2024-10-11 14:27:28,733 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 34 transitions, 142 flow [2024-10-11 14:27:28,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:27:28,733 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:27:28,733 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:28,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 14:27:28,734 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:28,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:27:28,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1611634074, now seen corresponding path program 2 times [2024-10-11 14:27:28,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:27:28,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910914915] [2024-10-11 14:27:28,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:27:28,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:27:28,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:27:31,698 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,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:27:31,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910914915] [2024-10-11 14:27:31,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910914915] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:27:31,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:27:31,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:27:31,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449077285] [2024-10-11 14:27:31,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:27:31,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:27:31,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:27:31,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:27:31,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:27:31,700 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-10-11 14:27:31,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 34 transitions, 142 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,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:27:31,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-10-11 14:27:31,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:27:32,022 INFO L124 PetriNetUnfolderBase]: 35/112 cut-off events. [2024-10-11 14:27:32,022 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2024-10-11 14:27:32,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 321 conditions, 112 events. 35/112 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 303 event pairs, 10 based on Foata normal form. 1/112 useless extension candidates. Maximal degree in co-relation 297. Up to 48 conditions per place. [2024-10-11 14:27:32,023 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 41 selfloop transitions, 3 changer transitions 5/50 dead transitions. [2024-10-11 14:27:32,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 50 transitions, 290 flow [2024-10-11 14:27:32,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:27:32,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 14:27:32,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2024-10-11 14:27:32,025 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4064516129032258 [2024-10-11 14:27:32,025 INFO L175 Difference]: Start difference. First operand has 46 places, 34 transitions, 142 flow. Second operand 5 states and 63 transitions. [2024-10-11 14:27:32,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 50 transitions, 290 flow [2024-10-11 14:27:32,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 50 transitions, 279 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-10-11 14:27:32,027 INFO L231 Difference]: Finished difference. Result has 49 places, 35 transitions, 155 flow [2024-10-11 14:27:32,029 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,030 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 18 predicate places. [2024-10-11 14:27:32,031 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 35 transitions, 155 flow [2024-10-11 14:27:32,031 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,031 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:27:32,031 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,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 14:27:32,031 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,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:27:32,034 INFO L85 PathProgramCache]: Analyzing trace with hash -600203812, now seen corresponding path program 3 times [2024-10-11 14:27:32,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:27:32,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870966658] [2024-10-11 14:27:32,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:27:32,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:27:32,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:27:33,648 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,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:27:33,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870966658] [2024-10-11 14:27:33,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870966658] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:27:33,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:27:33,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 14:27:33,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242509077] [2024-10-11 14:27:33,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:27:33,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:27:33,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:27:33,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:27:33,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:27:33,651 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-10-11 14:27:33,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 35 transitions, 155 flow. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:27:33,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:27:33,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-10-11 14:27:33,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:27:33,852 INFO L124 PetriNetUnfolderBase]: 35/115 cut-off events. [2024-10-11 14:27:33,854 INFO L125 PetriNetUnfolderBase]: For 172/172 co-relation queries the response was YES. [2024-10-11 14:27:33,857 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 361 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,857 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 38 selfloop transitions, 4 changer transitions 9/52 dead transitions. [2024-10-11 14:27:33,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 52 transitions, 318 flow [2024-10-11 14:27:33,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:27:33,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 14:27:33,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2024-10-11 14:27:33,859 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3655913978494624 [2024-10-11 14:27:33,859 INFO L175 Difference]: Start difference. First operand has 49 places, 35 transitions, 155 flow. Second operand 6 states and 68 transitions. [2024-10-11 14:27:33,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 52 transitions, 318 flow [2024-10-11 14:27:33,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 52 transitions, 307 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-10-11 14:27:33,861 INFO L231 Difference]: Finished difference. Result has 54 places, 35 transitions, 166 flow [2024-10-11 14:27:33,862 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=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=166, PETRI_PLACES=54, PETRI_TRANSITIONS=35} [2024-10-11 14:27:33,865 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 23 predicate places. [2024-10-11 14:27:33,865 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 35 transitions, 166 flow [2024-10-11 14:27:33,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:27:33,865 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:27:33,865 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,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 14:27:33,865 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,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:27:33,866 INFO L85 PathProgramCache]: Analyzing trace with hash 494017660, now seen corresponding path program 4 times [2024-10-11 14:27:33,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:27:33,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774461097] [2024-10-11 14:27:33,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:27:33,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:27:33,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:27:35,533 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,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:27:35,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774461097] [2024-10-11 14:27:35,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774461097] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:27:35,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:27:35,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 14:27:35,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093167596] [2024-10-11 14:27:35,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:27:35,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:27:35,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:27:35,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:27:35,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:27:35,537 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-10-11 14:27:35,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 35 transitions, 166 flow. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:27:35,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:27:35,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-10-11 14:27:35,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:27:35,781 INFO L124 PetriNetUnfolderBase]: 30/98 cut-off events. [2024-10-11 14:27:35,781 INFO L125 PetriNetUnfolderBase]: For 257/257 co-relation queries the response was YES. [2024-10-11 14:27:35,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 358 conditions, 98 events. 30/98 cut-off events. For 257/257 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 334. Up to 55 conditions per place. [2024-10-11 14:27:35,783 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 38 selfloop transitions, 5 changer transitions 7/51 dead transitions. [2024-10-11 14:27:35,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 51 transitions, 334 flow [2024-10-11 14:27:35,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:27:35,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 14:27:35,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2024-10-11 14:27:35,785 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-10-11 14:27:35,785 INFO L175 Difference]: Start difference. First operand has 54 places, 35 transitions, 166 flow. Second operand 6 states and 66 transitions. [2024-10-11 14:27:35,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 51 transitions, 334 flow [2024-10-11 14:27:35,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 51 transitions, 311 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-10-11 14:27:35,788 INFO L231 Difference]: Finished difference. Result has 56 places, 35 transitions, 173 flow [2024-10-11 14:27:35,788 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=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=173, PETRI_PLACES=56, PETRI_TRANSITIONS=35} [2024-10-11 14:27:35,789 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 25 predicate places. [2024-10-11 14:27:35,790 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 35 transitions, 173 flow [2024-10-11 14:27:35,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:27:35,790 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:27:35,790 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,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 14:27:35,791 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:35,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:27:35,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1025750212, now seen corresponding path program 5 times [2024-10-11 14:27:35,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:27:35,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804129982] [2024-10-11 14:27:35,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:27:35,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:27:36,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:27:38,195 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:38,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:27:38,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804129982] [2024-10-11 14:27:38,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804129982] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:27:38,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:27:38,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 14:27:38,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157762636] [2024-10-11 14:27:38,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:27:38,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:27:38,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:27:38,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:27:38,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:27:38,198 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-10-11 14:27:38,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 35 transitions, 173 flow. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:27:38,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:27:38,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-10-11 14:27:38,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:27:38,438 INFO L124 PetriNetUnfolderBase]: 24/77 cut-off events. [2024-10-11 14:27:38,439 INFO L125 PetriNetUnfolderBase]: For 171/171 co-relation queries the response was YES. [2024-10-11 14:27:38,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 298 conditions, 77 events. 24/77 cut-off events. For 171/171 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 143 event pairs, 7 based on Foata normal form. 1/77 useless extension candidates. Maximal degree in co-relation 278. Up to 36 conditions per place. [2024-10-11 14:27:38,441 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 31 selfloop transitions, 3 changer transitions 14/49 dead transitions. [2024-10-11 14:27:38,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 49 transitions, 311 flow [2024-10-11 14:27:38,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:27:38,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 14:27:38,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2024-10-11 14:27:38,442 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-10-11 14:27:38,442 INFO L175 Difference]: Start difference. First operand has 56 places, 35 transitions, 173 flow. Second operand 6 states and 66 transitions. [2024-10-11 14:27:38,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 49 transitions, 311 flow [2024-10-11 14:27:38,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 49 transitions, 295 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-10-11 14:27:38,443 INFO L231 Difference]: Finished difference. Result has 57 places, 33 transitions, 152 flow [2024-10-11 14:27:38,444 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=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=152, PETRI_PLACES=57, PETRI_TRANSITIONS=33} [2024-10-11 14:27:38,444 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 26 predicate places. [2024-10-11 14:27:38,444 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 33 transitions, 152 flow [2024-10-11 14:27:38,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:27:38,444 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:27:38,444 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:38,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 14:27:38,445 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:38,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:27:38,445 INFO L85 PathProgramCache]: Analyzing trace with hash -143211830, now seen corresponding path program 6 times [2024-10-11 14:27:38,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:27:38,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260689333] [2024-10-11 14:27:38,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:27:38,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:27:38,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:27:39,844 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:39,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:27:39,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260689333] [2024-10-11 14:27:39,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260689333] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:27:39,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:27:39,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 14:27:39,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235348055] [2024-10-11 14:27:39,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:27:39,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:27:39,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:27:39,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:27:39,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:27:39,846 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-10-11 14:27:39,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 33 transitions, 152 flow. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:27:39,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:27:39,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-10-11 14:27:39,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:27:40,035 INFO L124 PetriNetUnfolderBase]: 15/51 cut-off events. [2024-10-11 14:27:40,036 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2024-10-11 14:27:40,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 51 events. 15/51 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 43 event pairs, 5 based on Foata normal form. 1/51 useless extension candidates. Maximal degree in co-relation 183. Up to 29 conditions per place. [2024-10-11 14:27:40,036 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 0 selfloop transitions, 0 changer transitions 37/37 dead transitions. [2024-10-11 14:27:40,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 37 transitions, 240 flow [2024-10-11 14:27:40,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:27:40,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 14:27:40,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2024-10-11 14:27:40,037 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3010752688172043 [2024-10-11 14:27:40,038 INFO L175 Difference]: Start difference. First operand has 57 places, 33 transitions, 152 flow. Second operand 6 states and 56 transitions. [2024-10-11 14:27:40,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 37 transitions, 240 flow [2024-10-11 14:27:40,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 37 transitions, 218 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-10-11 14:27:40,039 INFO L231 Difference]: Finished difference. Result has 48 places, 0 transitions, 0 flow [2024-10-11 14:27:40,039 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=6, PETRI_FLOW=0, PETRI_PLACES=48, PETRI_TRANSITIONS=0} [2024-10-11 14:27:40,040 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 17 predicate places. [2024-10-11 14:27:40,040 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 0 transitions, 0 flow [2024-10-11 14:27:40,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:27:40,043 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2024-10-11 14:27:40,043 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2024-10-11 14:27:40,043 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-10-11 14:27:40,043 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-10-11 14:27:40,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 14:27:40,044 INFO L407 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1] [2024-10-11 14:27:40,046 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 14:27:40,046 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 14:27:40,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:27:40 BasicIcfg [2024-10-11 14:27:40,051 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 14:27:40,051 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 14:27:40,051 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 14:27:40,051 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 14:27:40,052 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:23" (3/4) ... [2024-10-11 14:27:40,053 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 14:27:40,055 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-11 14:27:40,055 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-11 14:27:40,055 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-10-11 14:27:40,067 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 330 nodes and edges [2024-10-11 14:27:40,067 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 43 nodes and edges [2024-10-11 14:27:40,070 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-10-11 14:27:40,071 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 14:27:40,161 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 14:27:40,162 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 14:27:40,162 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 14:27:40,163 INFO L158 Benchmark]: Toolchain (without parser) took 18116.53ms. Allocated memory was 161.5MB in the beginning and 1.1GB in the end (delta: 903.9MB). Free memory was 126.2MB in the beginning and 818.3MB in the end (delta: -692.1MB). Peak memory consumption was 211.5MB. Max. memory is 16.1GB. [2024-10-11 14:27:40,163 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory is still 80.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 14:27:40,163 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.32ms. Allocated memory is still 161.5MB. Free memory was 126.2MB in the beginning and 111.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 14:27:40,164 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.79ms. Allocated memory is still 161.5MB. Free memory was 111.5MB in the beginning and 108.2MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 14:27:40,164 INFO L158 Benchmark]: Boogie Preprocessor took 77.47ms. Allocated memory is still 161.5MB. Free memory was 108.2MB in the beginning and 104.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 14:27:40,164 INFO L158 Benchmark]: RCFGBuilder took 1131.04ms. Allocated memory is still 161.5MB. Free memory was 104.0MB in the beginning and 68.2MB in the end (delta: 35.8MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. [2024-10-11 14:27:40,164 INFO L158 Benchmark]: TraceAbstraction took 16425.34ms. Allocated memory was 161.5MB in the beginning and 1.1GB in the end (delta: 903.9MB). Free memory was 67.1MB in the beginning and 827.7MB in the end (delta: -760.6MB). Peak memory consumption was 146.4MB. Max. memory is 16.1GB. [2024-10-11 14:27:40,164 INFO L158 Benchmark]: Witness Printer took 111.24ms. Allocated memory is still 1.1GB. Free memory was 827.7MB in the beginning and 818.3MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 14:27:40,165 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 109.1MB. Free memory is still 80.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 300.32ms. Allocated memory is still 161.5MB. Free memory was 126.2MB in the beginning and 111.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.79ms. Allocated memory is still 161.5MB. Free memory was 111.5MB in the beginning and 108.2MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.47ms. Allocated memory is still 161.5MB. Free memory was 108.2MB in the beginning and 104.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1131.04ms. Allocated memory is still 161.5MB. Free memory was 104.0MB in the beginning and 68.2MB in the end (delta: 35.8MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. * TraceAbstraction took 16425.34ms. Allocated memory was 161.5MB in the beginning and 1.1GB in the end (delta: 903.9MB). Free memory was 67.1MB in the beginning and 827.7MB in the end (delta: -760.6MB). Peak memory consumption was 146.4MB. Max. memory is 16.1GB. * Witness Printer took 111.24ms. Allocated memory is still 1.1GB. Free memory was 827.7MB in the beginning and 818.3MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 16.3s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 204 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 204 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1227 IncrementalHoareTripleChecker+Invalid, 1239 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 0 mSDtfsCounter, 1227 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=173occurred in iteration=10, InterpolantAutomatonStates: 58, 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, 1.5s SatisfiabilityAnalysisTime, 12.2s InterpolantComputationTime, 303 NumberOfCodeBlocks, 303 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 291 ConstructedInterpolants, 0 QuantifiedInterpolants, 3678 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:40,190 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