./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-buffer-series3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-buffer-series3.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c031a4ce44fce05276ee0c322906dbff86776176e55e116d257d2b83e85a253c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 13:50:56,781 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 13:50:56,866 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 13:50:56,873 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 13:50:56,874 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 13:50:56,900 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 13:50:56,901 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 13:50:56,901 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 13:50:56,902 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 13:50:56,904 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 13:50:56,904 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 13:50:56,904 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 13:50:56,905 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 13:50:56,905 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 13:50:56,906 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 13:50:56,906 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 13:50:56,908 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 13:50:56,908 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 13:50:56,908 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 13:50:56,908 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 13:50:56,909 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 13:50:56,910 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 13:50:56,911 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 13:50:56,911 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 13:50:56,911 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 13:50:56,912 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 13:50:56,912 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 13:50:56,912 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 13:50:56,913 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 13:50:56,913 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 13:50:56,913 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 13:50:56,913 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 13:50:56,913 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 13:50:56,914 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 13:50:56,914 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 13:50:56,914 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 13:50:56,915 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 13:50:56,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 13:50:56,916 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 13:50:56,916 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 13:50:56,916 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 13:50:56,917 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 13:50:56,917 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c031a4ce44fce05276ee0c322906dbff86776176e55e116d257d2b83e85a253c [2024-11-22 13:50:57,148 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 13:50:57,171 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 13:50:57,174 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 13:50:57,175 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 13:50:57,175 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 13:50:57,176 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-buffer-series3.wvr.c [2024-11-22 13:50:58,514 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 13:50:58,707 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 13:50:58,708 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-series3.wvr.c [2024-11-22 13:50:58,719 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a0353cc0/a4cf5226666c42c8a1644935e5a0aa1c/FLAGe69ace3d9 [2024-11-22 13:50:58,733 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a0353cc0/a4cf5226666c42c8a1644935e5a0aa1c [2024-11-22 13:50:58,735 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 13:50:58,736 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 13:50:58,739 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 13:50:58,739 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 13:50:58,745 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 13:50:58,745 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:50:58" (1/1) ... [2024-11-22 13:50:58,746 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3da46ef2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:50:58, skipping insertion in model container [2024-11-22 13:50:58,746 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:50:58" (1/1) ... [2024-11-22 13:50:58,774 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 13:50:58,963 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-series3.wvr.c[4403,4416] [2024-11-22 13:50:58,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 13:50:58,983 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 13:50:59,010 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-series3.wvr.c[4403,4416] [2024-11-22 13:50:59,015 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 13:50:59,029 INFO L204 MainTranslator]: Completed translation [2024-11-22 13:50:59,030 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:50:59 WrapperNode [2024-11-22 13:50:59,030 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 13:50:59,031 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 13:50:59,031 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 13:50:59,031 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 13:50:59,037 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:50:59" (1/1) ... [2024-11-22 13:50:59,046 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:50:59" (1/1) ... [2024-11-22 13:50:59,076 INFO L138 Inliner]: procedures = 26, calls = 67, calls flagged for inlining = 22, calls inlined = 28, statements flattened = 340 [2024-11-22 13:50:59,076 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 13:50:59,077 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 13:50:59,077 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 13:50:59,077 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 13:50:59,092 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:50:59" (1/1) ... [2024-11-22 13:50:59,092 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:50:59" (1/1) ... [2024-11-22 13:50:59,096 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:50:59" (1/1) ... [2024-11-22 13:50:59,116 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2024-11-22 13:50:59,117 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:50:59" (1/1) ... [2024-11-22 13:50:59,117 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:50:59" (1/1) ... [2024-11-22 13:50:59,134 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:50:59" (1/1) ... [2024-11-22 13:50:59,142 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:50:59" (1/1) ... [2024-11-22 13:50:59,144 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:50:59" (1/1) ... [2024-11-22 13:50:59,148 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:50:59" (1/1) ... [2024-11-22 13:50:59,151 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 13:50:59,152 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 13:50:59,152 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 13:50:59,153 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 13:50:59,153 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:50:59" (1/1) ... [2024-11-22 13:50:59,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 13:50:59,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:50:59,201 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 13:50:59,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 13:50:59,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 13:50:59,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-22 13:50:59,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-22 13:50:59,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-22 13:50:59,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-22 13:50:59,255 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-22 13:50:59,255 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-22 13:50:59,255 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-22 13:50:59,255 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-22 13:50:59,256 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-22 13:50:59,256 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-22 13:50:59,256 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-22 13:50:59,256 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-22 13:50:59,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 13:50:59,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-22 13:50:59,256 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-22 13:50:59,256 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-22 13:50:59,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-22 13:50:59,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 13:50:59,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 13:50:59,260 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-22 13:50:59,417 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 13:50:59,419 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 13:50:59,942 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-22 13:50:59,943 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 13:51:00,329 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 13:51:00,329 INFO L316 CfgBuilder]: Removed 7 assume(true) statements. [2024-11-22 13:51:00,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:51:00 BoogieIcfgContainer [2024-11-22 13:51:00,330 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 13:51:00,333 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 13:51:00,333 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 13:51:00,336 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 13:51:00,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:50:58" (1/3) ... [2024-11-22 13:51:00,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cdf34f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:51:00, skipping insertion in model container [2024-11-22 13:51:00,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:50:59" (2/3) ... [2024-11-22 13:51:00,338 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cdf34f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:51:00, skipping insertion in model container [2024-11-22 13:51:00,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:51:00" (3/3) ... [2024-11-22 13:51:00,339 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series3.wvr.c [2024-11-22 13:51:00,355 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 13:51:00,355 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 13:51:00,355 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-22 13:51:00,424 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-22 13:51:00,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 52 transitions, 132 flow [2024-11-22 13:51:00,505 INFO L124 PetriNetUnfolderBase]: 7/48 cut-off events. [2024-11-22 13:51:00,505 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-22 13:51:00,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 48 events. 7/48 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 86 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2024-11-22 13:51:00,509 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 52 transitions, 132 flow [2024-11-22 13:51:00,512 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 47 transitions, 118 flow [2024-11-22 13:51:00,523 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 13:51:00,531 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;@4afa3821, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 13:51:00,531 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-22 13:51:00,550 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-22 13:51:00,551 INFO L124 PetriNetUnfolderBase]: 7/46 cut-off events. [2024-11-22 13:51:00,551 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-22 13:51:00,551 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:51:00,552 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, 1, 1, 1] [2024-11-22 13:51:00,552 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 2 more)] === [2024-11-22 13:51:00,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:51:00,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1756639892, now seen corresponding path program 1 times [2024-11-22 13:51:00,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:51:00,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141019729] [2024-11-22 13:51:00,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:51:00,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:51:00,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:51:01,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:51:01,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:51:01,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141019729] [2024-11-22 13:51:01,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141019729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:51:01,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:51:01,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 13:51:01,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429712996] [2024-11-22 13:51:01,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:51:01,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 13:51:01,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:51:01,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 13:51:01,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 13:51:01,055 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 52 [2024-11-22 13:51:01,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:51:01,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:51:01,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 52 [2024-11-22 13:51:01,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:51:01,587 INFO L124 PetriNetUnfolderBase]: 2408/3712 cut-off events. [2024-11-22 13:51:01,587 INFO L125 PetriNetUnfolderBase]: For 205/205 co-relation queries the response was YES. [2024-11-22 13:51:01,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6983 conditions, 3712 events. 2408/3712 cut-off events. For 205/205 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 21371 event pairs, 472 based on Foata normal form. 1/3493 useless extension candidates. Maximal degree in co-relation 6291. Up to 2067 conditions per place. [2024-11-22 13:51:01,621 INFO L140 encePairwiseOnDemand]: 48/52 looper letters, 43 selfloop transitions, 3 changer transitions 1/64 dead transitions. [2024-11-22 13:51:01,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 64 transitions, 261 flow [2024-11-22 13:51:01,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 13:51:01,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 13:51:01,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2024-11-22 13:51:01,676 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7115384615384616 [2024-11-22 13:51:01,678 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 118 flow. Second operand 3 states and 111 transitions. [2024-11-22 13:51:01,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 64 transitions, 261 flow [2024-11-22 13:51:01,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 64 transitions, 235 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-22 13:51:01,690 INFO L231 Difference]: Finished difference. Result has 48 places, 49 transitions, 121 flow [2024-11-22 13:51:01,692 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=121, PETRI_PLACES=48, PETRI_TRANSITIONS=49} [2024-11-22 13:51:01,697 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2024-11-22 13:51:01,697 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 49 transitions, 121 flow [2024-11-22 13:51:01,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:51:01,698 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:51:01,698 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, 1, 1, 1, 1, 1, 1] [2024-11-22 13:51:01,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 13:51:01,699 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 2 more)] === [2024-11-22 13:51:01,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:51:01,700 INFO L85 PathProgramCache]: Analyzing trace with hash -891124569, now seen corresponding path program 1 times [2024-11-22 13:51:01,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:51:01,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661186469] [2024-11-22 13:51:01,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:51:01,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:51:01,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:51:01,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:51:01,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:51:01,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661186469] [2024-11-22 13:51:01,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661186469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:51:01,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:51:01,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 13:51:01,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172531220] [2024-11-22 13:51:01,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:51:01,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 13:51:01,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:51:01,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 13:51:01,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 13:51:01,913 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 52 [2024-11-22 13:51:01,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 49 transitions, 121 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:51:01,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:51:01,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 52 [2024-11-22 13:51:01,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:51:02,395 INFO L124 PetriNetUnfolderBase]: 2669/4087 cut-off events. [2024-11-22 13:51:02,396 INFO L125 PetriNetUnfolderBase]: For 683/683 co-relation queries the response was YES. [2024-11-22 13:51:02,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8441 conditions, 4087 events. 2669/4087 cut-off events. For 683/683 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 24523 event pairs, 761 based on Foata normal form. 104/3940 useless extension candidates. Maximal degree in co-relation 3135. Up to 2321 conditions per place. [2024-11-22 13:51:02,422 INFO L140 encePairwiseOnDemand]: 49/52 looper letters, 52 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2024-11-22 13:51:02,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 71 transitions, 287 flow [2024-11-22 13:51:02,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 13:51:02,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 13:51:02,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2024-11-22 13:51:02,424 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7371794871794872 [2024-11-22 13:51:02,424 INFO L175 Difference]: Start difference. First operand has 48 places, 49 transitions, 121 flow. Second operand 3 states and 115 transitions. [2024-11-22 13:51:02,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 71 transitions, 287 flow [2024-11-22 13:51:02,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 71 transitions, 283 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 13:51:02,427 INFO L231 Difference]: Finished difference. Result has 50 places, 50 transitions, 132 flow [2024-11-22 13:51:02,427 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=50, PETRI_TRANSITIONS=50} [2024-11-22 13:51:02,428 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2024-11-22 13:51:02,428 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 50 transitions, 132 flow [2024-11-22 13:51:02,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:51:02,428 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:51:02,428 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, 1, 1, 1, 1, 1, 1] [2024-11-22 13:51:02,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 13:51:02,429 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 2 more)] === [2024-11-22 13:51:02,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:51:02,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1628986663, now seen corresponding path program 1 times [2024-11-22 13:51:02,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:51:02,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940903362] [2024-11-22 13:51:02,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:51:02,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:51:02,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:51:02,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:51:02,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:51:02,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940903362] [2024-11-22 13:51:02,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940903362] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:51:02,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:51:02,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 13:51:02,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342390414] [2024-11-22 13:51:02,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:51:02,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 13:51:02,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:51:02,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 13:51:02,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 13:51:02,570 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 52 [2024-11-22 13:51:02,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 50 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:51:02,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:51:02,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 52 [2024-11-22 13:51:02,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:51:03,046 INFO L124 PetriNetUnfolderBase]: 2977/4712 cut-off events. [2024-11-22 13:51:03,046 INFO L125 PetriNetUnfolderBase]: For 1586/1601 co-relation queries the response was YES. [2024-11-22 13:51:03,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10160 conditions, 4712 events. 2977/4712 cut-off events. For 1586/1601 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 30139 event pairs, 955 based on Foata normal form. 63/4562 useless extension candidates. Maximal degree in co-relation 4634. Up to 2600 conditions per place. [2024-11-22 13:51:03,075 INFO L140 encePairwiseOnDemand]: 49/52 looper letters, 52 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2024-11-22 13:51:03,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 71 transitions, 303 flow [2024-11-22 13:51:03,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 13:51:03,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 13:51:03,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2024-11-22 13:51:03,078 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7243589743589743 [2024-11-22 13:51:03,078 INFO L175 Difference]: Start difference. First operand has 50 places, 50 transitions, 132 flow. Second operand 3 states and 113 transitions. [2024-11-22 13:51:03,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 71 transitions, 303 flow [2024-11-22 13:51:03,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 71 transitions, 300 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 13:51:03,082 INFO L231 Difference]: Finished difference. Result has 52 places, 51 transitions, 144 flow [2024-11-22 13:51:03,083 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=52, PETRI_TRANSITIONS=51} [2024-11-22 13:51:03,084 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, -1 predicate places. [2024-11-22 13:51:03,084 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 51 transitions, 144 flow [2024-11-22 13:51:03,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:51:03,085 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:51:03,085 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:51:03,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 13:51:03,085 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 2 more)] === [2024-11-22 13:51:03,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:51:03,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1455035214, now seen corresponding path program 1 times [2024-11-22 13:51:03,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:51:03,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503795019] [2024-11-22 13:51:03,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:51:03,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:51:03,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:51:03,224 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 13:51:03,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:51:03,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503795019] [2024-11-22 13:51:03,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503795019] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:51:03,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:51:03,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 13:51:03,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803160848] [2024-11-22 13:51:03,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:51:03,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 13:51:03,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:51:03,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 13:51:03,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:51:03,231 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 52 [2024-11-22 13:51:03,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 51 transitions, 144 flow. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:51:03,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:51:03,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 52 [2024-11-22 13:51:03,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:51:03,863 INFO L124 PetriNetUnfolderBase]: 3555/5588 cut-off events. [2024-11-22 13:51:03,864 INFO L125 PetriNetUnfolderBase]: For 2361/2444 co-relation queries the response was YES. [2024-11-22 13:51:03,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12775 conditions, 5588 events. 3555/5588 cut-off events. For 2361/2444 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 37105 event pairs, 2675 based on Foata normal form. 108/5336 useless extension candidates. Maximal degree in co-relation 6216. Up to 4011 conditions per place. [2024-11-22 13:51:03,894 INFO L140 encePairwiseOnDemand]: 47/52 looper letters, 58 selfloop transitions, 4 changer transitions 0/79 dead transitions. [2024-11-22 13:51:03,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 79 transitions, 347 flow [2024-11-22 13:51:03,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 13:51:03,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 13:51:03,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 162 transitions. [2024-11-22 13:51:03,896 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6230769230769231 [2024-11-22 13:51:03,897 INFO L175 Difference]: Start difference. First operand has 52 places, 51 transitions, 144 flow. Second operand 5 states and 162 transitions. [2024-11-22 13:51:03,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 79 transitions, 347 flow [2024-11-22 13:51:03,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 79 transitions, 344 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 13:51:03,900 INFO L231 Difference]: Finished difference. Result has 58 places, 54 transitions, 170 flow [2024-11-22 13:51:03,900 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=170, PETRI_PLACES=58, PETRI_TRANSITIONS=54} [2024-11-22 13:51:03,901 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 5 predicate places. [2024-11-22 13:51:03,901 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 54 transitions, 170 flow [2024-11-22 13:51:03,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:51:03,902 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:51:03,902 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:51:03,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 13:51:03,902 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 2 more)] === [2024-11-22 13:51:03,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:51:03,903 INFO L85 PathProgramCache]: Analyzing trace with hash 162065578, now seen corresponding path program 1 times [2024-11-22 13:51:03,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:51:03,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777109479] [2024-11-22 13:51:03,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:51:03,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:51:03,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:51:04,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 13:51:04,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:51:04,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777109479] [2024-11-22 13:51:04,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777109479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:51:04,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:51:04,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 13:51:04,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303012558] [2024-11-22 13:51:04,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:51:04,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 13:51:04,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:51:04,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 13:51:04,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:51:04,055 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 52 [2024-11-22 13:51:04,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 54 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:51:04,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:51:04,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 52 [2024-11-22 13:51:04,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:51:04,765 INFO L124 PetriNetUnfolderBase]: 4275/6985 cut-off events. [2024-11-22 13:51:04,766 INFO L125 PetriNetUnfolderBase]: For 3058/3156 co-relation queries the response was YES. [2024-11-22 13:51:04,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15827 conditions, 6985 events. 4275/6985 cut-off events. For 3058/3156 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 49747 event pairs, 3295 based on Foata normal form. 145/6691 useless extension candidates. Maximal degree in co-relation 13272. Up to 4871 conditions per place. [2024-11-22 13:51:04,809 INFO L140 encePairwiseOnDemand]: 46/52 looper letters, 59 selfloop transitions, 6 changer transitions 2/84 dead transitions. [2024-11-22 13:51:04,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 84 transitions, 400 flow [2024-11-22 13:51:04,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 13:51:04,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 13:51:04,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 162 transitions. [2024-11-22 13:51:04,812 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6230769230769231 [2024-11-22 13:51:04,813 INFO L175 Difference]: Start difference. First operand has 58 places, 54 transitions, 170 flow. Second operand 5 states and 162 transitions. [2024-11-22 13:51:04,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 84 transitions, 400 flow [2024-11-22 13:51:04,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 84 transitions, 396 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-22 13:51:04,818 INFO L231 Difference]: Finished difference. Result has 64 places, 58 transitions, 209 flow [2024-11-22 13:51:04,818 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=209, PETRI_PLACES=64, PETRI_TRANSITIONS=58} [2024-11-22 13:51:04,819 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 11 predicate places. [2024-11-22 13:51:04,819 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 58 transitions, 209 flow [2024-11-22 13:51:04,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:51:04,819 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:51:04,819 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:51:04,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 13:51:04,820 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 2 more)] === [2024-11-22 13:51:04,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:51:04,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1701691961, now seen corresponding path program 1 times [2024-11-22 13:51:04,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:51:04,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357689625] [2024-11-22 13:51:04,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:51:04,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:51:04,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:51:05,117 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-22 13:51:05,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:51:05,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357689625] [2024-11-22 13:51:05,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357689625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:51:05,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:51:05,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 13:51:05,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068095986] [2024-11-22 13:51:05,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:51:05,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 13:51:05,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:51:05,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 13:51:05,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:51:05,175 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 52 [2024-11-22 13:51:05,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 58 transitions, 209 flow. Second operand has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:51:05,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:51:05,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 52 [2024-11-22 13:51:05,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:51:06,804 INFO L124 PetriNetUnfolderBase]: 8981/14318 cut-off events. [2024-11-22 13:51:06,804 INFO L125 PetriNetUnfolderBase]: For 5650/5922 co-relation queries the response was YES. [2024-11-22 13:51:06,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32734 conditions, 14318 events. 8981/14318 cut-off events. For 5650/5922 co-relation queries the response was YES. Maximal size of possible extension queue 727. Compared 106316 event pairs, 3970 based on Foata normal form. 5/13367 useless extension candidates. Maximal degree in co-relation 24429. Up to 5797 conditions per place. [2024-11-22 13:51:06,880 INFO L140 encePairwiseOnDemand]: 45/52 looper letters, 98 selfloop transitions, 9 changer transitions 1/122 dead transitions. [2024-11-22 13:51:06,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 122 transitions, 631 flow [2024-11-22 13:51:06,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 13:51:06,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 13:51:06,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 199 transitions. [2024-11-22 13:51:06,882 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6378205128205128 [2024-11-22 13:51:06,882 INFO L175 Difference]: Start difference. First operand has 64 places, 58 transitions, 209 flow. Second operand 6 states and 199 transitions. [2024-11-22 13:51:06,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 122 transitions, 631 flow [2024-11-22 13:51:06,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 122 transitions, 624 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-11-22 13:51:06,891 INFO L231 Difference]: Finished difference. Result has 72 places, 62 transitions, 264 flow [2024-11-22 13:51:06,891 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=264, PETRI_PLACES=72, PETRI_TRANSITIONS=62} [2024-11-22 13:51:06,892 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 19 predicate places. [2024-11-22 13:51:06,893 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 62 transitions, 264 flow [2024-11-22 13:51:06,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:51:06,894 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:51:06,894 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:51:06,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 13:51:06,895 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 2 more)] === [2024-11-22 13:51:06,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:51:06,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1408659551, now seen corresponding path program 1 times [2024-11-22 13:51:06,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:51:06,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123222900] [2024-11-22 13:51:06,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:51:06,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:51:07,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:51:07,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-22 13:51:07,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:51:07,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123222900] [2024-11-22 13:51:07,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123222900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:51:07,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:51:07,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 13:51:07,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627976597] [2024-11-22 13:51:07,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:51:07,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 13:51:07,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:51:07,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 13:51:07,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:51:07,325 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 52 [2024-11-22 13:51:07,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 62 transitions, 264 flow. Second operand has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:51:07,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:51:07,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 52 [2024-11-22 13:51:07,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:51:08,742 INFO L124 PetriNetUnfolderBase]: 9500/14367 cut-off events. [2024-11-22 13:51:08,743 INFO L125 PetriNetUnfolderBase]: For 6715/6763 co-relation queries the response was YES. [2024-11-22 13:51:08,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34228 conditions, 14367 events. 9500/14367 cut-off events. For 6715/6763 co-relation queries the response was YES. Maximal size of possible extension queue 787. Compared 102203 event pairs, 3077 based on Foata normal form. 0/13373 useless extension candidates. Maximal degree in co-relation 26263. Up to 8818 conditions per place. [2024-11-22 13:51:08,842 INFO L140 encePairwiseOnDemand]: 44/52 looper letters, 81 selfloop transitions, 12 changer transitions 9/117 dead transitions. [2024-11-22 13:51:08,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 117 transitions, 627 flow [2024-11-22 13:51:08,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 13:51:08,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-22 13:51:08,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 215 transitions. [2024-11-22 13:51:08,844 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5906593406593407 [2024-11-22 13:51:08,844 INFO L175 Difference]: Start difference. First operand has 72 places, 62 transitions, 264 flow. Second operand 7 states and 215 transitions. [2024-11-22 13:51:08,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 117 transitions, 627 flow [2024-11-22 13:51:08,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 117 transitions, 616 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-11-22 13:51:08,851 INFO L231 Difference]: Finished difference. Result has 80 places, 67 transitions, 314 flow [2024-11-22 13:51:08,851 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=314, PETRI_PLACES=80, PETRI_TRANSITIONS=67} [2024-11-22 13:51:08,852 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 27 predicate places. [2024-11-22 13:51:08,852 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 67 transitions, 314 flow [2024-11-22 13:51:08,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:51:08,852 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:51:08,853 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:51:08,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 13:51:08,853 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 2 more)] === [2024-11-22 13:51:08,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:51:08,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1541253761, now seen corresponding path program 2 times [2024-11-22 13:51:08,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:51:08,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514678893] [2024-11-22 13:51:08,854 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 13:51:08,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:51:08,895 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 13:51:08,895 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:51:09,274 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-22 13:51:09,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:51:09,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514678893] [2024-11-22 13:51:09,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514678893] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:51:09,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:51:09,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 13:51:09,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618319950] [2024-11-22 13:51:09,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:51:09,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 13:51:09,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:51:09,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 13:51:09,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:51:09,331 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 52 [2024-11-22 13:51:09,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 67 transitions, 314 flow. Second operand has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:51:09,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:51:09,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 52 [2024-11-22 13:51:09,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:51:10,316 INFO L124 PetriNetUnfolderBase]: 8397/12874 cut-off events. [2024-11-22 13:51:10,317 INFO L125 PetriNetUnfolderBase]: For 8391/8777 co-relation queries the response was YES. [2024-11-22 13:51:10,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32300 conditions, 12874 events. 8397/12874 cut-off events. For 8391/8777 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 90634 event pairs, 3317 based on Foata normal form. 17/11684 useless extension candidates. Maximal degree in co-relation 26751. Up to 6563 conditions per place. [2024-11-22 13:51:10,419 INFO L140 encePairwiseOnDemand]: 45/52 looper letters, 61 selfloop transitions, 6 changer transitions 30/111 dead transitions. [2024-11-22 13:51:10,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 111 transitions, 615 flow [2024-11-22 13:51:10,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 13:51:10,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 13:51:10,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 189 transitions. [2024-11-22 13:51:10,421 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6057692307692307 [2024-11-22 13:51:10,422 INFO L175 Difference]: Start difference. First operand has 80 places, 67 transitions, 314 flow. Second operand 6 states and 189 transitions. [2024-11-22 13:51:10,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 111 transitions, 615 flow [2024-11-22 13:51:10,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 111 transitions, 607 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-22 13:51:10,445 INFO L231 Difference]: Finished difference. Result has 85 places, 60 transitions, 262 flow [2024-11-22 13:51:10,445 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=262, PETRI_PLACES=85, PETRI_TRANSITIONS=60} [2024-11-22 13:51:10,446 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 32 predicate places. [2024-11-22 13:51:10,446 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 60 transitions, 262 flow [2024-11-22 13:51:10,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:51:10,447 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:51:10,447 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:51:10,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 13:51:10,449 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 2 more)] === [2024-11-22 13:51:10,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:51:10,450 INFO L85 PathProgramCache]: Analyzing trace with hash -766894544, now seen corresponding path program 1 times [2024-11-22 13:51:10,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:51:10,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767689711] [2024-11-22 13:51:10,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:51:10,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:51:10,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:51:10,786 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 13:51:10,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:51:10,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767689711] [2024-11-22 13:51:10,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767689711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:51:10,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:51:10,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 13:51:10,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935665607] [2024-11-22 13:51:10,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:51:10,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 13:51:10,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:51:10,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 13:51:10,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:51:10,839 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 52 [2024-11-22 13:51:10,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 60 transitions, 262 flow. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:51:10,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:51:10,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 52 [2024-11-22 13:51:10,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:51:11,648 INFO L124 PetriNetUnfolderBase]: 6365/9964 cut-off events. [2024-11-22 13:51:11,648 INFO L125 PetriNetUnfolderBase]: For 8585/8633 co-relation queries the response was YES. [2024-11-22 13:51:11,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26562 conditions, 9964 events. 6365/9964 cut-off events. For 8585/8633 co-relation queries the response was YES. Maximal size of possible extension queue 530. Compared 69167 event pairs, 1500 based on Foata normal form. 452/10147 useless extension candidates. Maximal degree in co-relation 22049. Up to 5157 conditions per place. [2024-11-22 13:51:11,747 INFO L140 encePairwiseOnDemand]: 45/52 looper letters, 81 selfloop transitions, 7 changer transitions 8/111 dead transitions. [2024-11-22 13:51:11,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 111 transitions, 651 flow [2024-11-22 13:51:11,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 13:51:11,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-22 13:51:11,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 209 transitions. [2024-11-22 13:51:11,749 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5741758241758241 [2024-11-22 13:51:11,749 INFO L175 Difference]: Start difference. First operand has 85 places, 60 transitions, 262 flow. Second operand 7 states and 209 transitions. [2024-11-22 13:51:11,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 111 transitions, 651 flow [2024-11-22 13:51:11,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 111 transitions, 615 flow, removed 11 selfloop flow, removed 9 redundant places. [2024-11-22 13:51:11,803 INFO L231 Difference]: Finished difference. Result has 79 places, 61 transitions, 255 flow [2024-11-22 13:51:11,803 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=255, PETRI_PLACES=79, PETRI_TRANSITIONS=61} [2024-11-22 13:51:11,804 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 26 predicate places. [2024-11-22 13:51:11,804 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 61 transitions, 255 flow [2024-11-22 13:51:11,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:51:11,805 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:51:11,805 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:51:11,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 13:51:11,805 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 2 more)] === [2024-11-22 13:51:11,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:51:11,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1830491244, now seen corresponding path program 1 times [2024-11-22 13:51:11,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:51:11,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325542709] [2024-11-22 13:51:11,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:51:11,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:51:11,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:51:12,135 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 13:51:12,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:51:12,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325542709] [2024-11-22 13:51:12,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325542709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:51:12,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:51:12,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 13:51:12,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646432893] [2024-11-22 13:51:12,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:51:12,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 13:51:12,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:51:12,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 13:51:12,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:51:12,178 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 52 [2024-11-22 13:51:12,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 61 transitions, 255 flow. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:51:12,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:51:12,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 52 [2024-11-22 13:51:12,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:51:12,973 INFO L124 PetriNetUnfolderBase]: 5658/8712 cut-off events. [2024-11-22 13:51:12,973 INFO L125 PetriNetUnfolderBase]: For 8480/8718 co-relation queries the response was YES. [2024-11-22 13:51:12,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23324 conditions, 8712 events. 5658/8712 cut-off events. For 8480/8718 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 57718 event pairs, 782 based on Foata normal form. 402/8902 useless extension candidates. Maximal degree in co-relation 20403. Up to 5679 conditions per place. [2024-11-22 13:51:13,022 INFO L140 encePairwiseOnDemand]: 46/52 looper letters, 71 selfloop transitions, 5 changer transitions 2/95 dead transitions. [2024-11-22 13:51:13,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 95 transitions, 555 flow [2024-11-22 13:51:13,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 13:51:13,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 13:51:13,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 175 transitions. [2024-11-22 13:51:13,024 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5608974358974359 [2024-11-22 13:51:13,024 INFO L175 Difference]: Start difference. First operand has 79 places, 61 transitions, 255 flow. Second operand 6 states and 175 transitions. [2024-11-22 13:51:13,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 95 transitions, 555 flow [2024-11-22 13:51:13,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 95 transitions, 523 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-11-22 13:51:13,034 INFO L231 Difference]: Finished difference. Result has 77 places, 59 transitions, 235 flow [2024-11-22 13:51:13,034 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=235, PETRI_PLACES=77, PETRI_TRANSITIONS=59} [2024-11-22 13:51:13,036 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 24 predicate places. [2024-11-22 13:51:13,037 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 59 transitions, 235 flow [2024-11-22 13:51:13,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:51:13,039 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:51:13,039 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:51:13,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 13:51:13,039 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 2 more)] === [2024-11-22 13:51:13,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:51:13,040 INFO L85 PathProgramCache]: Analyzing trace with hash -619798630, now seen corresponding path program 1 times [2024-11-22 13:51:13,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:51:13,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520577343] [2024-11-22 13:51:13,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:51:13,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:51:13,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 13:51:13,112 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 13:51:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 13:51:13,186 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 13:51:13,186 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 13:51:13,188 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-11-22 13:51:13,190 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2024-11-22 13:51:13,190 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-11-22 13:51:13,190 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-11-22 13:51:13,190 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-11-22 13:51:13,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 13:51:13,191 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:51:13,324 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-22 13:51:13,325 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 13:51:13,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 01:51:13 BasicIcfg [2024-11-22 13:51:13,329 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 13:51:13,330 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 13:51:13,330 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 13:51:13,330 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 13:51:13,331 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:51:00" (3/4) ... [2024-11-22 13:51:13,331 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-22 13:51:13,421 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-22 13:51:13,421 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 13:51:13,421 INFO L158 Benchmark]: Toolchain (without parser) took 14685.03ms. Allocated memory was 159.4MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 101.5MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 515.4MB. Max. memory is 16.1GB. [2024-11-22 13:51:13,422 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 159.4MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 13:51:13,422 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.44ms. Allocated memory is still 159.4MB. Free memory was 101.1MB in the beginning and 86.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-22 13:51:13,422 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.56ms. Allocated memory is still 159.4MB. Free memory was 86.4MB in the beginning and 83.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 13:51:13,422 INFO L158 Benchmark]: Boogie Preprocessor took 74.65ms. Allocated memory is still 159.4MB. Free memory was 83.5MB in the beginning and 80.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 13:51:13,423 INFO L158 Benchmark]: RCFGBuilder took 1177.94ms. Allocated memory was 159.4MB in the beginning and 218.1MB in the end (delta: 58.7MB). Free memory was 79.7MB in the beginning and 105.6MB in the end (delta: -25.9MB). Peak memory consumption was 42.8MB. Max. memory is 16.1GB. [2024-11-22 13:51:13,423 INFO L158 Benchmark]: TraceAbstraction took 12996.34ms. Allocated memory was 218.1MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 104.5MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 434.8MB. Max. memory is 16.1GB. [2024-11-22 13:51:13,423 INFO L158 Benchmark]: Witness Printer took 91.12ms. Allocated memory is still 1.8GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-22 13:51:13,430 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 159.4MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 291.44ms. Allocated memory is still 159.4MB. Free memory was 101.1MB in the beginning and 86.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.56ms. Allocated memory is still 159.4MB. Free memory was 86.4MB in the beginning and 83.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.65ms. Allocated memory is still 159.4MB. Free memory was 83.5MB in the beginning and 80.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1177.94ms. Allocated memory was 159.4MB in the beginning and 218.1MB in the end (delta: 58.7MB). Free memory was 79.7MB in the beginning and 105.6MB in the end (delta: -25.9MB). Peak memory consumption was 42.8MB. Max. memory is 16.1GB. * TraceAbstraction took 12996.34ms. Allocated memory was 218.1MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 104.5MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 434.8MB. Max. memory is 16.1GB. * Witness Printer took 91.12ms. Allocated memory is still 1.8GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 155]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L41] 0 int *q1, *q2, *f; [L42] 0 int q1_front, q1_back, q2_front, q2_back, i, j, n1, n2, N, total; [L129] 0 pthread_t t1, t2, t3, t4; [L131] 0 N = __VERIFIER_nondet_int() [L132] 0 n1 = __VERIFIER_nondet_int() [L133] 0 n2 = __VERIFIER_nondet_int() [L134] 0 q1_front = __VERIFIER_nondet_int() [L135] 0 q1_back = q1_front [L136] 0 q2_front = __VERIFIER_nondet_int() [L137] 0 q2_back = q2_front [L138] CALL, EXPR 0 create_fresh_int_array(n1) [L161] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) [L161] RET 0 assume_abort_if_not(size >= 0) [L162] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) [L162] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L164] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L165] 0 int i = 0; VAL [N=1, \old(size)=1, arr={-4:0}, f={0:0}, i=0, i=0, j=0, n1=1, n2=1, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L165] COND TRUE 0 i < size [L166] 0 arr[i] = __VERIFIER_nondet_int() [L165] 0 i++ VAL [N=1, \old(size)=1, arr={-4:0}, f={0:0}, i=0, i=1, j=0, n1=1, n2=1, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L165] COND FALSE 0 !(i < size) [L168] 0 return arr; [L138] RET, EXPR 0 create_fresh_int_array(n1) [L138] 0 q1 = create_fresh_int_array(n1) [L139] CALL, EXPR 0 create_fresh_int_array(n2) [L161] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) [L161] RET 0 assume_abort_if_not(size >= 0) [L162] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) [L162] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L164] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L165] 0 int i = 0; VAL [N=1, \old(size)=1, arr={-5:0}, f={0:0}, i=0, i=0, j=0, n1=1, n2=1, q1={-4:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L165] COND TRUE 0 i < size [L166] 0 arr[i] = __VERIFIER_nondet_int() [L165] 0 i++ VAL [N=1, \old(size)=1, arr={-5:0}, f={0:0}, i=0, i=1, j=0, n1=1, n2=1, q1={-4:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L165] COND FALSE 0 !(i < size) [L168] 0 return arr; [L139] RET, EXPR 0 create_fresh_int_array(n2) [L139] 0 q2 = create_fresh_int_array(n2) [L140] CALL, EXPR 0 create_fresh_int_array(N) [L161] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) [L161] RET 0 assume_abort_if_not(size >= 0) [L162] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) [L162] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L164] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L165] 0 int i = 0; VAL [N=1, \old(size)=1, arr={-6:0}, f={0:0}, i=0, i=0, j=0, n1=1, n2=1, q1={-4:0}, q1_back=0, q1_front=0, q2={-5:0}, q2_back=0, q2_front=0, size=1, total=0] [L165] COND TRUE 0 i < size [L166] 0 arr[i] = __VERIFIER_nondet_int() [L165] 0 i++ VAL [N=1, \old(size)=1, arr={-6:0}, f={0:0}, i=0, i=1, j=0, n1=1, n2=1, q1={-4:0}, q1_back=0, q1_front=0, q2={-5:0}, q2_back=0, q2_front=0, size=1, total=0] [L165] COND FALSE 0 !(i < size) [L168] 0 return arr; [L140] RET, EXPR 0 create_fresh_int_array(N) [L140] 0 f = create_fresh_int_array(N) [L142] CALL 0 assume_abort_if_not(N >= 0) [L38] COND FALSE 0 !(!cond) [L142] RET 0 assume_abort_if_not(N >= 0) [L145] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [N=1, f={-6:0}, i=0, j=0, n1=1, n2=1, q1={-4:0}, q1_back=0, q1_front=0, q2={-5:0}, q2_back=0, q2_front=0, t1=-3, total=0] [L146] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [N=1, f={-6:0}, i=0, j=0, n1=1, n2=1, q1={-4:0}, q1_back=0, q1_front=0, q2={-5:0}, q2_back=0, q2_front=0, t1=-3, t2=-2, total=0] [L71] 2 _Bool cond = j < N; VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-6:0}, i=0, j=0, n1=1, n2=1, q1={-4:0}, q1_back=0, q1_front=0, q2={-5:0}, q2_back=0, q2_front=0, total=0] [L73] COND TRUE 2 \read(cond) VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-6:0}, i=0, j=0, n1=1, n2=1, q1={-4:0}, q1_back=0, q1_front=0, q2={-5:0}, q2_back=0, q2_front=0, total=0] [L75] CALL 2 assume_abort_if_not(q2_back >= 0 && q2_back < n2) [L38] COND FALSE 2 !(!cond) [L75] RET 2 assume_abort_if_not(q2_back >= 0 && q2_back < n2) [L76] EXPR 2 f[j] [L76] CALL 2 assume_abort_if_not(f[j] > -2147483648) [L38] COND FALSE 2 !(!cond) [L76] RET 2 assume_abort_if_not(f[j] > -2147483648) [L77] EXPR 2 q2[q2_back] [L77] EXPR 2 f[j] [L77] CALL 2 assume_abort_if_not(q2[q2_back] == -f[j]) [L38] COND FALSE 2 !(!cond) [L77] RET 2 assume_abort_if_not(q2[q2_back] == -f[j]) [L78] CALL 2 assume_abort_if_not(q2_back < 2147483647) [L38] COND FALSE 2 !(!cond) [L78] RET 2 assume_abort_if_not(q2_back < 2147483647) [L79] 2 j++ VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-6:0}, i=0, j=1, n1=1, n2=1, q1={-4:0}, q1_back=0, q1_front=0, q2={-5:0}, q2_back=0, q2_front=0, total=0] [L147] FCALL, FORK 0 pthread_create(&t3, 0, thread3, 0) VAL [N=1, f={-6:0}, i=0, j=1, n1=1, n2=1, q1={-4:0}, q1_back=0, q1_front=0, q2={-5:0}, q2_back=0, q2_front=0, t1=-3, t2=-2, t3=-1, total=0] [L148] FCALL, FORK 0 pthread_create(&t4, 0, thread4, 0) VAL [N=1, f={-6:0}, i=0, j=1, n1=1, n2=1, q1={-4:0}, q1_back=0, q1_front=0, q2={-5:0}, q2_back=0, q2_front=0, t1=-3, t2=-2, t3=-1, t4=0, total=0] [L112] 4 _Bool cond = j < N || q2_front < q2_back; VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, f={-6:0}, i=0, j=1, n1=1, n2=1, q1={-4:0}, q1_back=0, q1_front=0, q2={-5:0}, q2_back=0, q2_front=0, total=0] [L114] COND FALSE 4 !(\read(cond)) [L125] 4 return 0; [L82] 2 q2_back++ VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-6:0}, i=0, j=1, n1=1, n2=1, q1={-4:0}, q1_back=0, q1_front=0, q2={-5:0}, q2_back=1, q2_front=0, total=0] [L85] 2 cond = j < N VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, f={-6:0}, i=0, j=1, n1=1, n2=1, q1={-4:0}, q1_back=0, q1_front=0, q2={-5:0}, q2_back=1, q2_front=0, total=0] [L73] COND FALSE 2 !(\read(cond)) [L89] 2 return 0; [L49] 1 _Bool cond = i < N; VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-6:0}, i=0, j=1, n1=1, n2=1, q1={-4:0}, q1_back=0, q1_front=0, q2={-5:0}, q2_back=1, q2_front=0, total=0] [L51] COND TRUE 1 \read(cond) VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-6:0}, i=0, j=1, n1=1, n2=1, q1={-4:0}, q1_back=0, q1_front=0, q2={-5:0}, q2_back=1, q2_front=0, total=0] [L53] CALL 1 assume_abort_if_not(q1_back >= 0 && q1_back < n1) [L38] COND FALSE 1 !(!cond) [L53] RET 1 assume_abort_if_not(q1_back >= 0 && q1_back < n1) [L54] EXPR 1 q1[q1_back] [L54] EXPR 1 f[i] [L54] CALL 1 assume_abort_if_not(q1[q1_back] == f[i]) [L38] COND FALSE 1 !(!cond) [L54] RET 1 assume_abort_if_not(q1[q1_back] == f[i]) [L55] CALL 1 assume_abort_if_not(q1_back < 2147483647) [L38] COND FALSE 1 !(!cond) [L55] RET 1 assume_abort_if_not(q1_back < 2147483647) [L56] 1 i++ VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-6:0}, i=1, j=1, n1=1, n2=1, q1={-4:0}, q1_back=0, q1_front=0, q2={-5:0}, q2_back=1, q2_front=0, total=0] [L59] 1 q1_back++ VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-6:0}, i=1, j=1, n1=1, n2=1, q1={-4:0}, q1_back=1, q1_front=0, q2={-5:0}, q2_back=1, q2_front=0, total=0] [L62] 1 cond = i < N VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, f={-6:0}, i=1, j=1, n1=1, n2=1, q1={-4:0}, q1_back=1, q1_front=0, q2={-5:0}, q2_back=1, q2_front=0, total=0] [L51] COND FALSE 1 !(\read(cond)) [L66] 1 return 0; [L94] 3 _Bool cond = i < N || q1_front < q1_back; VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-6:0}, i=1, j=1, n1=1, n2=1, q1={-4:0}, q1_back=1, q1_front=0, q2={-5:0}, q2_back=1, q2_front=0, total=0] [L96] COND TRUE 3 \read(cond) VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-6:0}, i=1, j=1, n1=1, n2=1, q1={-4:0}, q1_back=1, q1_front=0, q2={-5:0}, q2_back=1, q2_front=0, total=0] [L98] CALL 3 assume_abort_if_not(q1_front < q1_back && q1_front >= 0 && q1_front < n1) [L38] COND FALSE 3 !(!cond) [L98] RET 3 assume_abort_if_not(q1_front < q1_back && q1_front >= 0 && q1_front < n1) [L99] EXPR 3 q1[q1_front] [L99] CALL, EXPR 3 plus(total, q1[q1_front]) [L172] CALL 3 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L38] COND FALSE 3 !(!cond) [L172] RET 3 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L173] CALL 3 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 3 !(!cond) [L173] RET 3 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L174] 3 return a + b; [L99] RET, EXPR 3 plus(total, q1[q1_front]) [L99] 3 total = plus(total, q1[q1_front]) [L100] 3 q1_front++ VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-6:0}, i=1, j=1, n1=1, n2=1, q1={-4:0}, q1_back=1, q1_front=1, q2={-5:0}, q2_back=1, q2_front=0, total=-7] [L103] 3 cond = i < N || q1_front < q1_back VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, f={-6:0}, i=1, j=1, n1=1, n2=1, q1={-4:0}, q1_back=1, q1_front=1, q2={-5:0}, q2_back=1, q2_front=0, total=-7] [L96] COND FALSE 3 !(\read(cond)) [L107] 3 return 0; [L149] FCALL, JOIN 1 pthread_join(t1, 0) VAL [N=1, f={-6:0}, i=1, j=1, n1=1, n2=1, q1={-4:0}, q1_back=1, q1_front=1, q2={-5:0}, q2_back=1, q2_front=0, t1=-3, t2=-2, t3=-1, t4=0, total=-7] [L150] FCALL, JOIN 2 pthread_join(t2, 0) VAL [N=1, f={-6:0}, i=1, j=1, n1=1, n2=1, q1={-4:0}, q1_back=1, q1_front=1, q2={-5:0}, q2_back=1, q2_front=0, t1=-3, t2=-2, t3=-1, t4=0, total=-7] [L151] FCALL, JOIN 3 pthread_join(t3, 0) VAL [N=1, f={-6:0}, i=1, j=1, n1=1, n2=1, q1={-4:0}, q1_back=1, q1_front=1, q2={-5:0}, q2_back=1, q2_front=0, t1=-3, t2=-2, t3=-1, t4=0, total=-7] [L152] FCALL, JOIN 4 pthread_join(t4, 0) VAL [N=1, f={-6:0}, i=1, j=1, n1=1, n2=1, q1={-4:0}, q1_back=1, q1_front=1, q2={-5:0}, q2_back=1, q2_front=0, t1=-3, t2=-2, t3=-1, t4=0, total=-7] [L154] CALL 0 assume_abort_if_not(total != 0) [L38] COND FALSE 0 !(!cond) [L154] RET 0 assume_abort_if_not(total != 0) [L155] 0 reach_error() VAL [N=1, f={-6:0}, i=1, j=1, n1=1, n2=1, q1={-4:0}, q1_back=1, q1_front=1, q2={-5:0}, q2_back=1, q2_front=0, t1=-3, t2=-2, t3=-1, t4=0, total=-7] - UnprovableResult [Line: 145]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 148]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 146]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 147]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 76 locations, 5 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: 12.7s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 9.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 524 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 459 mSDsluCounter, 47 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 34 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1544 IncrementalHoareTripleChecker+Invalid, 1557 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 13 mSDtfsCounter, 1544 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=314occurred in iteration=7, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 406 NumberOfCodeBlocks, 406 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 352 ConstructedInterpolants, 0 QuantifiedInterpolants, 1052 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 23/23 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-22 13:51:13,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE