./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/parallel-misc-3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a340643f 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 ../../../trunk/examples/svcomp/weaver/parallel-misc-3.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 206fc494d359c55f00dca0f227d0ffa61103c97cbe34d3166496eff2224a478a --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a340643-m [2024-01-27 15:31:52,983 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 15:31:53,023 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 15:31:53,026 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 15:31:53,027 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 15:31:53,040 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 15:31:53,040 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 15:31:53,041 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 15:31:53,041 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 15:31:53,041 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 15:31:53,042 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 15:31:53,042 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 15:31:53,042 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 15:31:53,043 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 15:31:53,043 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 15:31:53,043 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 15:31:53,044 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 15:31:53,044 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 15:31:53,044 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 15:31:53,044 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 15:31:53,044 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 15:31:53,045 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 15:31:53,045 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 15:31:53,045 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 15:31:53,045 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 15:31:53,046 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 15:31:53,046 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 15:31:53,046 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 15:31:53,046 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 15:31:53,046 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 15:31:53,047 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 15:31:53,047 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 15:31:53,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 15:31:53,047 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 15:31:53,047 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 15:31:53,048 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 15:31:53,048 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 15:31:53,048 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 15:31:53,048 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 15:31:53,048 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 15:31:53,049 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 15:31:53,049 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 15:31:53,049 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 15:31:53,049 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 -> 206fc494d359c55f00dca0f227d0ffa61103c97cbe34d3166496eff2224a478a [2024-01-27 15:31:53,277 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 15:31:53,294 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 15:31:53,297 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 15:31:53,298 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 15:31:53,298 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 15:31:53,299 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-3.wvr.c [2024-01-27 15:31:54,268 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 15:31:54,429 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 15:31:54,430 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-3.wvr.c [2024-01-27 15:31:54,451 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2eadf3866/5a6ab1ccb0664cc9b6cecc584adf97a6/FLAGfd028d6f4 [2024-01-27 15:31:54,465 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2eadf3866/5a6ab1ccb0664cc9b6cecc584adf97a6 [2024-01-27 15:31:54,467 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 15:31:54,468 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-01-27 15:31:54,471 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 15:31:54,471 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 15:31:54,474 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 15:31:54,475 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 03:31:54" (1/1) ... [2024-01-27 15:31:54,477 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35d4c0d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:31:54, skipping insertion in model container [2024-01-27 15:31:54,478 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 03:31:54" (1/1) ... [2024-01-27 15:31:54,496 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 15:31:54,660 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-3.wvr.c[2436,2449] [2024-01-27 15:31:54,664 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:31:54,671 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 15:31:54,706 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-3.wvr.c[2436,2449] [2024-01-27 15:31:54,707 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:31:54,717 INFO L206 MainTranslator]: Completed translation [2024-01-27 15:31:54,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:31:54 WrapperNode [2024-01-27 15:31:54,718 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 15:31:54,719 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 15:31:54,720 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 15:31:54,720 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 15:31:54,725 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:31:54" (1/1) ... [2024-01-27 15:31:54,738 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:31:54" (1/1) ... [2024-01-27 15:31:54,755 INFO L138 Inliner]: procedures = 21, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 52 [2024-01-27 15:31:54,756 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 15:31:54,756 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 15:31:54,757 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 15:31:54,757 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 15:31:54,765 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:31:54" (1/1) ... [2024-01-27 15:31:54,766 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:31:54" (1/1) ... [2024-01-27 15:31:54,769 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:31:54" (1/1) ... [2024-01-27 15:31:54,787 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 2, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-01-27 15:31:54,787 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:31:54" (1/1) ... [2024-01-27 15:31:54,788 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:31:54" (1/1) ... [2024-01-27 15:31:54,798 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:31:54" (1/1) ... [2024-01-27 15:31:54,801 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:31:54" (1/1) ... [2024-01-27 15:31:54,805 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:31:54" (1/1) ... [2024-01-27 15:31:54,805 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:31:54" (1/1) ... [2024-01-27 15:31:54,809 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 15:31:54,810 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 15:31:54,811 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 15:31:54,811 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 15:31:54,811 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:31:54" (1/1) ... [2024-01-27 15:31:54,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 15:31:54,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:31:54,841 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-01-27 15:31:54,862 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-01-27 15:31:54,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 15:31:54,883 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-27 15:31:54,883 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-27 15:31:54,883 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-27 15:31:54,883 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-27 15:31:54,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 15:31:54,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 15:31:54,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 15:31:54,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 15:31:54,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 15:31:54,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 15:31:54,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 15:31:54,886 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-27 15:31:54,886 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-27 15:31:54,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 15:31:54,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 15:31:54,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-27 15:31:54,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-27 15:31:54,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-27 15:31:54,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 15:31:54,888 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-27 15:31:54,985 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 15:31:54,987 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 15:31:55,173 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 15:31:55,173 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 15:31:55,260 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 15:31:55,260 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-01-27 15:31:55,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:31:55 BoogieIcfgContainer [2024-01-27 15:31:55,261 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 15:31:55,262 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 15:31:55,262 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 15:31:55,264 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 15:31:55,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 03:31:54" (1/3) ... [2024-01-27 15:31:55,265 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68ec9302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 03:31:55, skipping insertion in model container [2024-01-27 15:31:55,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:31:54" (2/3) ... [2024-01-27 15:31:55,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68ec9302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 03:31:55, skipping insertion in model container [2024-01-27 15:31:55,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:31:55" (3/3) ... [2024-01-27 15:31:55,266 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-3.wvr.c [2024-01-27 15:31:55,272 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-27 15:31:55,279 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 15:31:55,279 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-27 15:31:55,279 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 15:31:55,323 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-27 15:31:55,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 29 transitions, 72 flow [2024-01-27 15:31:55,376 INFO L124 PetriNetUnfolderBase]: 4/27 cut-off events. [2024-01-27 15:31:55,377 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-27 15:31:55,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 27 events. 4/27 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 40 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2024-01-27 15:31:55,379 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 29 transitions, 72 flow [2024-01-27 15:31:55,381 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 26 transitions, 64 flow [2024-01-27 15:31:55,388 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 15:31:55,393 INFO L357 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, mHoare=true, 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;@59959bce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 15:31:55,394 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-01-27 15:31:55,400 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 15:31:55,400 INFO L124 PetriNetUnfolderBase]: 4/25 cut-off events. [2024-01-27 15:31:55,400 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-27 15:31:55,400 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:31:55,401 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:31:55,401 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:31:55,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:31:55,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1640783155, now seen corresponding path program 1 times [2024-01-27 15:31:55,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:31:55,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852531833] [2024-01-27 15:31:55,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:31:55,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:31:55,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:31:55,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:31:55,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:31:55,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852531833] [2024-01-27 15:31:55,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852531833] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:31:55,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:31:55,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 15:31:55,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824617288] [2024-01-27 15:31:55,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:31:55,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:31:55,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:31:55,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:31:55,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:31:55,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 29 [2024-01-27 15:31:55,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 26 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-01-27 15:31:55,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:31:55,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 29 [2024-01-27 15:31:55,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:31:55,805 INFO L124 PetriNetUnfolderBase]: 140/271 cut-off events. [2024-01-27 15:31:55,805 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-01-27 15:31:55,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 499 conditions, 271 events. 140/271 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1044 event pairs, 13 based on Foata normal form. 1/230 useless extension candidates. Maximal degree in co-relation 404. Up to 178 conditions per place. [2024-01-27 15:31:55,809 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 23 selfloop transitions, 5 changer transitions 1/38 dead transitions. [2024-01-27 15:31:55,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 38 transitions, 155 flow [2024-01-27 15:31:55,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:31:55,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:31:55,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2024-01-27 15:31:55,818 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7241379310344828 [2024-01-27 15:31:55,819 INFO L175 Difference]: Start difference. First operand has 29 places, 26 transitions, 64 flow. Second operand 3 states and 63 transitions. [2024-01-27 15:31:55,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 38 transitions, 155 flow [2024-01-27 15:31:55,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 38 transitions, 141 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-27 15:31:55,823 INFO L231 Difference]: Finished difference. Result has 28 places, 30 transitions, 89 flow [2024-01-27 15:31:55,825 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=28, PETRI_TRANSITIONS=30} [2024-01-27 15:31:55,827 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -1 predicate places. [2024-01-27 15:31:55,827 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 30 transitions, 89 flow [2024-01-27 15:31:55,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-01-27 15:31:55,828 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:31:55,828 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:31:55,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 15:31:55,828 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:31:55,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:31:55,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1635887699, now seen corresponding path program 1 times [2024-01-27 15:31:55,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:31:55,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103205269] [2024-01-27 15:31:55,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:31:55,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:31:55,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:31:55,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:31:55,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:31:55,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103205269] [2024-01-27 15:31:55,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103205269] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:31:55,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:31:55,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 15:31:55,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662236910] [2024-01-27 15:31:55,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:31:55,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:31:55,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:31:55,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:31:55,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:31:55,975 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 29 [2024-01-27 15:31:55,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 30 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-01-27 15:31:55,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:31:55,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 29 [2024-01-27 15:31:55,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:31:56,049 INFO L124 PetriNetUnfolderBase]: 113/240 cut-off events. [2024-01-27 15:31:56,050 INFO L125 PetriNetUnfolderBase]: For 52/76 co-relation queries the response was YES. [2024-01-27 15:31:56,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 492 conditions, 240 events. 113/240 cut-off events. For 52/76 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 927 event pairs, 12 based on Foata normal form. 11/211 useless extension candidates. Maximal degree in co-relation 217. Up to 90 conditions per place. [2024-01-27 15:31:56,056 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 23 selfloop transitions, 2 changer transitions 0/38 dead transitions. [2024-01-27 15:31:56,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 38 transitions, 160 flow [2024-01-27 15:31:56,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:31:56,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:31:56,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2024-01-27 15:31:56,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7241379310344828 [2024-01-27 15:31:56,059 INFO L175 Difference]: Start difference. First operand has 28 places, 30 transitions, 89 flow. Second operand 3 states and 63 transitions. [2024-01-27 15:31:56,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 38 transitions, 160 flow [2024-01-27 15:31:56,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 38 transitions, 153 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-01-27 15:31:56,063 INFO L231 Difference]: Finished difference. Result has 30 places, 31 transitions, 94 flow [2024-01-27 15:31:56,063 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=30, PETRI_TRANSITIONS=31} [2024-01-27 15:31:56,063 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 1 predicate places. [2024-01-27 15:31:56,063 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 31 transitions, 94 flow [2024-01-27 15:31:56,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-01-27 15:31:56,064 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:31:56,064 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:31:56,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 15:31:56,064 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:31:56,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:31:56,064 INFO L85 PathProgramCache]: Analyzing trace with hash -29248973, now seen corresponding path program 1 times [2024-01-27 15:31:56,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:31:56,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064977564] [2024-01-27 15:31:56,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:31:56,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:31:56,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:31:56,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:31:56,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:31:56,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064977564] [2024-01-27 15:31:56,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064977564] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:31:56,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:31:56,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 15:31:56,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182849623] [2024-01-27 15:31:56,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:31:56,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:31:56,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:31:56,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:31:56,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:31:56,168 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 29 [2024-01-27 15:31:56,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 31 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-01-27 15:31:56,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:31:56,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 29 [2024-01-27 15:31:56,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:31:56,210 INFO L124 PetriNetUnfolderBase]: 114/230 cut-off events. [2024-01-27 15:31:56,210 INFO L125 PetriNetUnfolderBase]: For 96/130 co-relation queries the response was YES. [2024-01-27 15:31:56,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 539 conditions, 230 events. 114/230 cut-off events. For 96/130 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 832 event pairs, 11 based on Foata normal form. 11/201 useless extension candidates. Maximal degree in co-relation 195. Up to 116 conditions per place. [2024-01-27 15:31:56,212 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 25 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2024-01-27 15:31:56,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 40 transitions, 178 flow [2024-01-27 15:31:56,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:31:56,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:31:56,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2024-01-27 15:31:56,213 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7241379310344828 [2024-01-27 15:31:56,213 INFO L175 Difference]: Start difference. First operand has 30 places, 31 transitions, 94 flow. Second operand 3 states and 63 transitions. [2024-01-27 15:31:56,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 40 transitions, 178 flow [2024-01-27 15:31:56,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 40 transitions, 175 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 15:31:56,215 INFO L231 Difference]: Finished difference. Result has 32 places, 32 transitions, 104 flow [2024-01-27 15:31:56,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=32, PETRI_TRANSITIONS=32} [2024-01-27 15:31:56,216 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 3 predicate places. [2024-01-27 15:31:56,216 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 32 transitions, 104 flow [2024-01-27 15:31:56,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-01-27 15:31:56,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:31:56,216 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:31:56,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 15:31:56,217 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:31:56,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:31:56,217 INFO L85 PathProgramCache]: Analyzing trace with hash 690344439, now seen corresponding path program 1 times [2024-01-27 15:31:56,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:31:56,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539469394] [2024-01-27 15:31:56,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:31:56,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:31:56,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:31:56,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:31:56,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:31:56,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539469394] [2024-01-27 15:31:56,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539469394] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:31:56,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:31:56,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 15:31:56,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299963638] [2024-01-27 15:31:56,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:31:56,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:31:56,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:31:56,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:31:56,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:31:56,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 29 [2024-01-27 15:31:56,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 32 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-01-27 15:31:56,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:31:56,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 29 [2024-01-27 15:31:56,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:31:56,327 INFO L124 PetriNetUnfolderBase]: 115/230 cut-off events. [2024-01-27 15:31:56,328 INFO L125 PetriNetUnfolderBase]: For 88/132 co-relation queries the response was YES. [2024-01-27 15:31:56,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 570 conditions, 230 events. 115/230 cut-off events. For 88/132 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 861 event pairs, 11 based on Foata normal form. 10/213 useless extension candidates. Maximal degree in co-relation 207. Up to 139 conditions per place. [2024-01-27 15:31:56,330 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 24 selfloop transitions, 2 changer transitions 0/38 dead transitions. [2024-01-27 15:31:56,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 38 transitions, 175 flow [2024-01-27 15:31:56,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:31:56,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:31:56,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2024-01-27 15:31:56,332 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6896551724137931 [2024-01-27 15:31:56,332 INFO L175 Difference]: Start difference. First operand has 32 places, 32 transitions, 104 flow. Second operand 3 states and 60 transitions. [2024-01-27 15:31:56,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 38 transitions, 175 flow [2024-01-27 15:31:56,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 38 transitions, 173 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 15:31:56,334 INFO L231 Difference]: Finished difference. Result has 34 places, 31 transitions, 106 flow [2024-01-27 15:31:56,334 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=34, PETRI_TRANSITIONS=31} [2024-01-27 15:31:56,336 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 5 predicate places. [2024-01-27 15:31:56,336 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 31 transitions, 106 flow [2024-01-27 15:31:56,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-01-27 15:31:56,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:31:56,336 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:31:56,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 15:31:56,337 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:31:56,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:31:56,337 INFO L85 PathProgramCache]: Analyzing trace with hash 334107095, now seen corresponding path program 1 times [2024-01-27 15:31:56,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:31:56,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906799588] [2024-01-27 15:31:56,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:31:56,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:31:56,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:31:56,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:31:56,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:31:56,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906799588] [2024-01-27 15:31:56,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906799588] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:31:56,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:31:56,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:31:56,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247340661] [2024-01-27 15:31:56,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:31:56,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:31:56,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:31:56,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:31:56,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:31:56,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 29 [2024-01-27 15:31:56,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 31 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-01-27 15:31:56,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:31:56,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 29 [2024-01-27 15:31:56,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:31:56,617 INFO L124 PetriNetUnfolderBase]: 244/469 cut-off events. [2024-01-27 15:31:56,617 INFO L125 PetriNetUnfolderBase]: For 238/238 co-relation queries the response was YES. [2024-01-27 15:31:56,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1169 conditions, 469 events. 244/469 cut-off events. For 238/238 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2070 event pairs, 44 based on Foata normal form. 12/434 useless extension candidates. Maximal degree in co-relation 331. Up to 145 conditions per place. [2024-01-27 15:31:56,620 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 36 selfloop transitions, 5 changer transitions 0/51 dead transitions. [2024-01-27 15:31:56,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 51 transitions, 258 flow [2024-01-27 15:31:56,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 15:31:56,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 15:31:56,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2024-01-27 15:31:56,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7068965517241379 [2024-01-27 15:31:56,624 INFO L175 Difference]: Start difference. First operand has 34 places, 31 transitions, 106 flow. Second operand 4 states and 82 transitions. [2024-01-27 15:31:56,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 51 transitions, 258 flow [2024-01-27 15:31:56,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 51 transitions, 250 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 15:31:56,627 INFO L231 Difference]: Finished difference. Result has 37 places, 33 transitions, 134 flow [2024-01-27 15:31:56,627 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=134, PETRI_PLACES=37, PETRI_TRANSITIONS=33} [2024-01-27 15:31:56,628 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 8 predicate places. [2024-01-27 15:31:56,628 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 33 transitions, 134 flow [2024-01-27 15:31:56,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-01-27 15:31:56,628 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:31:56,628 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:31:56,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 15:31:56,629 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:31:56,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:31:56,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1020248867, now seen corresponding path program 1 times [2024-01-27 15:31:56,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:31:56,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099202167] [2024-01-27 15:31:56,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:31:56,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:31:56,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:31:56,750 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:31:56,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:31:56,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099202167] [2024-01-27 15:31:56,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099202167] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:31:56,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025284348] [2024-01-27 15:31:56,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:31:56,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:31:56,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:31:56,753 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:31:56,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-01-27 15:31:56,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:31:56,834 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 16 conjunts are in the unsatisfiable core [2024-01-27 15:31:56,838 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:31:56,938 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:31:56,939 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 15:31:56,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025284348] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:31:56,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-01-27 15:31:56,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-01-27 15:31:56,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338305963] [2024-01-27 15:31:56,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:31:56,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:31:56,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:31:56,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:31:56,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2024-01-27 15:31:56,946 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 29 [2024-01-27 15:31:56,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 33 transitions, 134 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-01-27 15:31:56,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:31:56,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 29 [2024-01-27 15:31:56,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:31:57,007 INFO L124 PetriNetUnfolderBase]: 220/484 cut-off events. [2024-01-27 15:31:57,007 INFO L125 PetriNetUnfolderBase]: For 503/540 co-relation queries the response was YES. [2024-01-27 15:31:57,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1358 conditions, 484 events. 220/484 cut-off events. For 503/540 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2219 event pairs, 26 based on Foata normal form. 14/472 useless extension candidates. Maximal degree in co-relation 471. Up to 254 conditions per place. [2024-01-27 15:31:57,010 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 31 selfloop transitions, 7 changer transitions 0/49 dead transitions. [2024-01-27 15:31:57,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 49 transitions, 269 flow [2024-01-27 15:31:57,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 15:31:57,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 15:31:57,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2024-01-27 15:31:57,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6637931034482759 [2024-01-27 15:31:57,011 INFO L175 Difference]: Start difference. First operand has 37 places, 33 transitions, 134 flow. Second operand 4 states and 77 transitions. [2024-01-27 15:31:57,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 49 transitions, 269 flow [2024-01-27 15:31:57,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 49 transitions, 267 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-01-27 15:31:57,014 INFO L231 Difference]: Finished difference. Result has 42 places, 39 transitions, 197 flow [2024-01-27 15:31:57,014 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=197, PETRI_PLACES=42, PETRI_TRANSITIONS=39} [2024-01-27 15:31:57,014 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 13 predicate places. [2024-01-27 15:31:57,014 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 39 transitions, 197 flow [2024-01-27 15:31:57,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-01-27 15:31:57,015 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:31:57,015 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:31:57,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-01-27 15:31:57,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-01-27 15:31:57,229 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:31:57,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:31:57,230 INFO L85 PathProgramCache]: Analyzing trace with hash 625596813, now seen corresponding path program 2 times [2024-01-27 15:31:57,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:31:57,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547637540] [2024-01-27 15:31:57,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:31:57,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:31:57,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:31:57,361 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:31:57,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:31:57,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547637540] [2024-01-27 15:31:57,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547637540] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:31:57,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663325872] [2024-01-27 15:31:57,362 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 15:31:57,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:31:57,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:31:57,363 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:31:57,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-01-27 15:31:57,425 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 15:31:57,426 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:31:57,426 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 14 conjunts are in the unsatisfiable core [2024-01-27 15:31:57,428 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:31:57,518 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:31:57,518 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:31:57,713 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:31:57,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663325872] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:31:57,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:31:57,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 13 [2024-01-27 15:31:57,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100733850] [2024-01-27 15:31:57,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:31:57,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-01-27 15:31:57,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:31:57,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-01-27 15:31:57,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2024-01-27 15:31:57,730 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-01-27 15:31:57,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 39 transitions, 197 flow. Second operand has 14 states, 14 states have (on average 10.642857142857142) internal successors, (149), 14 states have internal predecessors, (149), 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-01-27 15:31:57,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:31:57,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-01-27 15:31:57,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:31:58,349 INFO L124 PetriNetUnfolderBase]: 1324/2395 cut-off events. [2024-01-27 15:31:58,350 INFO L125 PetriNetUnfolderBase]: For 2340/2348 co-relation queries the response was YES. [2024-01-27 15:31:58,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6971 conditions, 2395 events. 1324/2395 cut-off events. For 2340/2348 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 12891 event pairs, 103 based on Foata normal form. 116/2490 useless extension candidates. Maximal degree in co-relation 2468. Up to 426 conditions per place. [2024-01-27 15:31:58,365 INFO L140 encePairwiseOnDemand]: 19/29 looper letters, 168 selfloop transitions, 86 changer transitions 0/260 dead transitions. [2024-01-27 15:31:58,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 260 transitions, 1598 flow [2024-01-27 15:31:58,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-01-27 15:31:58,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-01-27 15:31:58,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 386 transitions. [2024-01-27 15:31:58,367 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6050156739811913 [2024-01-27 15:31:58,368 INFO L175 Difference]: Start difference. First operand has 42 places, 39 transitions, 197 flow. Second operand 22 states and 386 transitions. [2024-01-27 15:31:58,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 260 transitions, 1598 flow [2024-01-27 15:31:58,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 260 transitions, 1596 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-01-27 15:31:58,396 INFO L231 Difference]: Finished difference. Result has 82 places, 130 transitions, 1126 flow [2024-01-27 15:31:58,396 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1126, PETRI_PLACES=82, PETRI_TRANSITIONS=130} [2024-01-27 15:31:58,397 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 53 predicate places. [2024-01-27 15:31:58,398 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 130 transitions, 1126 flow [2024-01-27 15:31:58,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 10.642857142857142) internal successors, (149), 14 states have internal predecessors, (149), 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-01-27 15:31:58,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:31:58,398 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:31:58,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-01-27 15:31:58,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-01-27 15:31:58,608 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:31:58,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:31:58,609 INFO L85 PathProgramCache]: Analyzing trace with hash -542779721, now seen corresponding path program 1 times [2024-01-27 15:31:58,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:31:58,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693476321] [2024-01-27 15:31:58,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:31:58,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:31:58,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:31:58,712 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:31:58,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:31:58,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693476321] [2024-01-27 15:31:58,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693476321] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:31:58,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490172627] [2024-01-27 15:31:58,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:31:58,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:31:58,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:31:58,713 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:31:58,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-01-27 15:31:58,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:31:58,789 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 11 conjunts are in the unsatisfiable core [2024-01-27 15:31:58,790 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:31:58,815 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:31:58,815 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:31:58,840 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:31:58,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490172627] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:31:58,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:31:58,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2024-01-27 15:31:58,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125982540] [2024-01-27 15:31:58,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:31:58,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 15:31:58,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:31:58,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 15:31:58,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-27 15:31:58,845 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 29 [2024-01-27 15:31:58,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 130 transitions, 1126 flow. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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-01-27 15:31:58,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:31:58,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 29 [2024-01-27 15:31:58,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:31:59,486 INFO L124 PetriNetUnfolderBase]: 2830/5470 cut-off events. [2024-01-27 15:31:59,486 INFO L125 PetriNetUnfolderBase]: For 36735/37246 co-relation queries the response was YES. [2024-01-27 15:31:59,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26050 conditions, 5470 events. 2830/5470 cut-off events. For 36735/37246 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 37522 event pairs, 403 based on Foata normal form. 45/5363 useless extension candidates. Maximal degree in co-relation 18922. Up to 1833 conditions per place. [2024-01-27 15:31:59,530 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 219 selfloop transitions, 15 changer transitions 3/286 dead transitions. [2024-01-27 15:31:59,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 286 transitions, 2978 flow [2024-01-27 15:31:59,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:31:59,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:31:59,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2024-01-27 15:31:59,531 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8068965517241379 [2024-01-27 15:31:59,531 INFO L175 Difference]: Start difference. First operand has 82 places, 130 transitions, 1126 flow. Second operand 5 states and 117 transitions. [2024-01-27 15:31:59,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 286 transitions, 2978 flow [2024-01-27 15:31:59,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 286 transitions, 2651 flow, removed 150 selfloop flow, removed 3 redundant places. [2024-01-27 15:31:59,596 INFO L231 Difference]: Finished difference. Result has 84 places, 142 transitions, 1088 flow [2024-01-27 15:31:59,596 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=991, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1088, PETRI_PLACES=84, PETRI_TRANSITIONS=142} [2024-01-27 15:31:59,596 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 55 predicate places. [2024-01-27 15:31:59,596 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 142 transitions, 1088 flow [2024-01-27 15:31:59,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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-01-27 15:31:59,596 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:31:59,597 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:31:59,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-01-27 15:31:59,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:31:59,808 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:31:59,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:31:59,808 INFO L85 PathProgramCache]: Analyzing trace with hash 322943663, now seen corresponding path program 2 times [2024-01-27 15:31:59,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:31:59,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773510613] [2024-01-27 15:31:59,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:31:59,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:31:59,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:31:59,932 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:31:59,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:31:59,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773510613] [2024-01-27 15:31:59,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773510613] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:31:59,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641444680] [2024-01-27 15:31:59,932 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 15:31:59,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:31:59,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:31:59,933 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:31:59,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-01-27 15:31:59,991 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 15:31:59,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:31:59,992 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 11 conjunts are in the unsatisfiable core [2024-01-27 15:31:59,993 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:32:00,017 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:32:00,018 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:32:00,041 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:32:00,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641444680] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:32:00,041 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:32:00,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2024-01-27 15:32:00,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819079138] [2024-01-27 15:32:00,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:32:00,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 15:32:00,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:32:00,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 15:32:00,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-27 15:32:00,044 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 29 [2024-01-27 15:32:00,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 142 transitions, 1088 flow. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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-01-27 15:32:00,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:32:00,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 29 [2024-01-27 15:32:00,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:32:00,812 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([257] L72-->L75-1: Formula: (and (let ((.cse1 (= (mod v_~d2~0_29 256) 0)) (.cse0 (= v_~g2~0_41 v_~g2~0_40))) (or (and .cse0 (= |v_thread2Thread1of1ForFork0_#t~nondet4_2| |v_thread2Thread1of1ForFork0_#t~nondet4_1|) .cse1) (and (not .cse1) (let ((.cse2 (= (mod |v_thread2_#t~nondet4_32| 256) 0))) (or (and .cse2 .cse0) (and (= v_~g2~0_40 0) (not .cse2))))))) (= v_~d2~0_29 (ite (= (ite (= (mod v_~d2~0_30 256) 0) 1 0) 0) 0 1))) InVars {~g2~0=v_~g2~0_41, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_1|, ~d2~0=v_~d2~0_30} OutVars{~g2~0=v_~g2~0_40, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_2|, ~d2~0=v_~d2~0_29} AuxVars[|v_thread2_#t~nondet4_32|] AssignedVars[~g2~0, thread2Thread1of1ForFork0_#t~nondet4, ~d2~0][182], [350#true, 24#L96-4true, Black: 65#(and (= ~g2~0 1) (= ~g1~0 1)), 530#true, Black: 326#(and (or (< 0 (mod ~g1~0 256)) (= (mod ~g2~0 256) 0)) (or (= (mod ~d2~0 256) 0) (< 0 (mod ~g1~0 256)))), Black: 322#(and (or (< 0 (mod ~g1~0 256)) (= (mod ~g2~0 256) 0)) (or (< 0 (mod ~g1~0 256)) (< 0 (mod ~d2~0 256)))), Black: 314#(and (= ~g1~0 1) (not (= (mod ~d2~0 256) 0)) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), Black: 312#(and (= ~g2~0 1) (= ~g1~0 1) (= ~d2~0 0)), Black: 320#(and (or (not (= (mod ~d1~0 256) 0)) (= (mod ~g2~0 256) 0)) (= ~g1~0 1) (not (= (mod ~d2~0 256) 0))), Black: 328#(and (or (not (= (mod ~d1~0 256) 0)) (= (mod ~g2~0 256) 0)) (= ~g1~0 1) (= ~d2~0 0)), 51#true, Black: 352#(= ~pos~0 0), Black: 187#(and (= ~g1~0 1) (not (= (mod ~d2~0 256) 0))), Black: 246#(< 0 (mod ~g1~0 256)), Black: 273#(or (< 0 (mod ~g1~0 256)) (= (mod ~g2~0 256) 0)), Black: 263#(or (= (mod ~d2~0 256) 0) (< 0 (mod ~g1~0 256))), Black: 310#(and (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (= ~g1~0 1) (= ~d2~0 0)), Black: 324#(and (or (< 0 (mod ~g1~0 256)) (< 0 (mod ~d2~0 256))) (or (and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))) (= (mod ~g2~0 256) 0))), Black: 194#(and (= ~g1~0 1) (= ~d2~0 0)), Black: 141#true, Black: 280#(or (and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))) (= (mod ~g2~0 256) 0)), 22#L75-1true, Black: 318#(and (= ~g1~0 1) (= ~d2~0 0) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), Black: 330#(and (or (and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))) (= (mod ~g2~0 256) 0)) (or (= (mod ~d2~0 256) 0) (< 0 (mod ~g1~0 256)))), Black: 256#(or (< 0 (mod ~g1~0 256)) (< 0 (mod ~d2~0 256))), 316#(and (<= 1 (mod ~g1~0 256)) (or (not (= (mod ~d1~0 256) 0)) (= (mod ~g2~0 256) 0))), Black: 37#(= ~pos~0 0), Black: 41#(= ~g2~0 1), Black: 45#(and (<= (div ~g1~0 256) 0) (<= 1 ~g1~0)), 57#true, 4#L44true, Black: 49#(and (<= (div ~d1~0 256) 0) (<= 1 ~d1~0)), Black: 53#(= ~g2~0 1), Black: 54#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2024-01-27 15:32:00,813 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-01-27 15:32:00,813 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-27 15:32:00,813 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-27 15:32:00,813 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-27 15:32:00,813 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([247] L44-->L50: Formula: (= v_~pos~0_23 (+ v_~pos~0_24 1)) InVars {~pos~0=v_~pos~0_24} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_23} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][59], [350#true, 24#L96-4true, Black: 65#(and (= ~g2~0 1) (= ~g1~0 1)), 530#true, Black: 326#(and (or (< 0 (mod ~g1~0 256)) (= (mod ~g2~0 256) 0)) (or (= (mod ~d2~0 256) 0) (< 0 (mod ~g1~0 256)))), Black: 322#(and (or (< 0 (mod ~g1~0 256)) (= (mod ~g2~0 256) 0)) (or (< 0 (mod ~g1~0 256)) (< 0 (mod ~d2~0 256)))), Black: 314#(and (= ~g1~0 1) (not (= (mod ~d2~0 256) 0)) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), Black: 312#(and (= ~g2~0 1) (= ~g1~0 1) (= ~d2~0 0)), Black: 320#(and (or (not (= (mod ~d1~0 256) 0)) (= (mod ~g2~0 256) 0)) (= ~g1~0 1) (not (= (mod ~d2~0 256) 0))), Black: 328#(and (or (not (= (mod ~d1~0 256) 0)) (= (mod ~g2~0 256) 0)) (= ~g1~0 1) (= ~d2~0 0)), Black: 352#(= ~pos~0 0), 51#true, Black: 187#(and (= ~g1~0 1) (not (= (mod ~d2~0 256) 0))), Black: 246#(< 0 (mod ~g1~0 256)), Black: 273#(or (< 0 (mod ~g1~0 256)) (= (mod ~g2~0 256) 0)), Black: 263#(or (= (mod ~d2~0 256) 0) (< 0 (mod ~g1~0 256))), Black: 310#(and (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (= ~g1~0 1) (= ~d2~0 0)), Black: 324#(and (or (< 0 (mod ~g1~0 256)) (< 0 (mod ~d2~0 256))) (or (and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))) (= (mod ~g2~0 256) 0))), Black: 194#(and (= ~g1~0 1) (= ~d2~0 0)), Black: 141#true, Black: 280#(or (and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))) (= (mod ~g2~0 256) 0)), Black: 318#(and (= ~g1~0 1) (= ~d2~0 0) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), Black: 330#(and (or (and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))) (= (mod ~g2~0 256) 0)) (or (= (mod ~d2~0 256) 0) (< 0 (mod ~g1~0 256)))), Black: 256#(or (< 0 (mod ~g1~0 256)) (< 0 (mod ~d2~0 256))), Black: 37#(= ~pos~0 0), 316#(and (<= 1 (mod ~g1~0 256)) (or (not (= (mod ~d1~0 256) 0)) (= (mod ~g2~0 256) 0))), Black: 41#(= ~g2~0 1), Black: 45#(and (<= (div ~g1~0 256) 0) (<= 1 ~g1~0)), 10#L50true, 5#L72true, 57#true, Black: 49#(and (<= (div ~d1~0 256) 0) (<= 1 ~d1~0)), Black: 53#(= ~g2~0 1), Black: 54#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2024-01-27 15:32:00,813 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-01-27 15:32:00,813 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-27 15:32:00,814 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-27 15:32:00,814 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-27 15:32:00,826 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([257] L72-->L75-1: Formula: (and (let ((.cse1 (= (mod v_~d2~0_29 256) 0)) (.cse0 (= v_~g2~0_41 v_~g2~0_40))) (or (and .cse0 (= |v_thread2Thread1of1ForFork0_#t~nondet4_2| |v_thread2Thread1of1ForFork0_#t~nondet4_1|) .cse1) (and (not .cse1) (let ((.cse2 (= (mod |v_thread2_#t~nondet4_32| 256) 0))) (or (and .cse2 .cse0) (and (= v_~g2~0_40 0) (not .cse2))))))) (= v_~d2~0_29 (ite (= (ite (= (mod v_~d2~0_30 256) 0) 1 0) 0) 0 1))) InVars {~g2~0=v_~g2~0_41, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_1|, ~d2~0=v_~d2~0_30} OutVars{~g2~0=v_~g2~0_40, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_2|, ~d2~0=v_~d2~0_29} AuxVars[|v_thread2_#t~nondet4_32|] AssignedVars[~g2~0, thread2Thread1of1ForFork0_#t~nondet4, ~d2~0][182], [350#true, 530#true, Black: 326#(and (or (< 0 (mod ~g1~0 256)) (= (mod ~g2~0 256) 0)) (or (= (mod ~d2~0 256) 0) (< 0 (mod ~g1~0 256)))), Black: 65#(and (= ~g2~0 1) (= ~g1~0 1)), Black: 322#(and (or (< 0 (mod ~g1~0 256)) (= (mod ~g2~0 256) 0)) (or (< 0 (mod ~g1~0 256)) (< 0 (mod ~d2~0 256)))), Black: 314#(and (= ~g1~0 1) (not (= (mod ~d2~0 256) 0)) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), Black: 312#(and (= ~g2~0 1) (= ~g1~0 1) (= ~d2~0 0)), Black: 320#(and (or (not (= (mod ~d1~0 256) 0)) (= (mod ~g2~0 256) 0)) (= ~g1~0 1) (not (= (mod ~d2~0 256) 0))), Black: 328#(and (or (not (= (mod ~d1~0 256) 0)) (= (mod ~g2~0 256) 0)) (= ~g1~0 1) (= ~d2~0 0)), 51#true, Black: 352#(= ~pos~0 0), Black: 187#(and (= ~g1~0 1) (not (= (mod ~d2~0 256) 0))), Black: 246#(< 0 (mod ~g1~0 256)), Black: 273#(or (< 0 (mod ~g1~0 256)) (= (mod ~g2~0 256) 0)), Black: 263#(or (= (mod ~d2~0 256) 0) (< 0 (mod ~g1~0 256))), Black: 310#(and (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (= ~g1~0 1) (= ~d2~0 0)), Black: 324#(and (or (< 0 (mod ~g1~0 256)) (< 0 (mod ~d2~0 256))) (or (and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))) (= (mod ~g2~0 256) 0))), Black: 194#(and (= ~g1~0 1) (= ~d2~0 0)), Black: 141#true, 22#L75-1true, Black: 280#(or (and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))) (= (mod ~g2~0 256) 0)), Black: 318#(and (= ~g1~0 1) (= ~d2~0 0) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), Black: 330#(and (or (and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))) (= (mod ~g2~0 256) 0)) (or (= (mod ~d2~0 256) 0) (< 0 (mod ~g1~0 256)))), Black: 256#(or (< 0 (mod ~g1~0 256)) (< 0 (mod ~d2~0 256))), 316#(and (<= 1 (mod ~g1~0 256)) (or (not (= (mod ~d1~0 256) 0)) (= (mod ~g2~0 256) 0))), Black: 37#(= ~pos~0 0), 16#L97-1true, Black: 41#(= ~g2~0 1), Black: 45#(and (<= (div ~g1~0 256) 0) (<= 1 ~g1~0)), 57#true, Black: 49#(and (<= (div ~d1~0 256) 0) (<= 1 ~d1~0)), 4#L44true, Black: 53#(= ~g2~0 1), Black: 54#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2024-01-27 15:32:00,827 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-01-27 15:32:00,827 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-01-27 15:32:00,827 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-27 15:32:00,827 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-01-27 15:32:00,827 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([247] L44-->L50: Formula: (= v_~pos~0_23 (+ v_~pos~0_24 1)) InVars {~pos~0=v_~pos~0_24} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_23} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][59], [350#true, 530#true, Black: 326#(and (or (< 0 (mod ~g1~0 256)) (= (mod ~g2~0 256) 0)) (or (= (mod ~d2~0 256) 0) (< 0 (mod ~g1~0 256)))), Black: 65#(and (= ~g2~0 1) (= ~g1~0 1)), Black: 322#(and (or (< 0 (mod ~g1~0 256)) (= (mod ~g2~0 256) 0)) (or (< 0 (mod ~g1~0 256)) (< 0 (mod ~d2~0 256)))), Black: 314#(and (= ~g1~0 1) (not (= (mod ~d2~0 256) 0)) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), Black: 312#(and (= ~g2~0 1) (= ~g1~0 1) (= ~d2~0 0)), Black: 320#(and (or (not (= (mod ~d1~0 256) 0)) (= (mod ~g2~0 256) 0)) (= ~g1~0 1) (not (= (mod ~d2~0 256) 0))), 51#true, Black: 328#(and (or (not (= (mod ~d1~0 256) 0)) (= (mod ~g2~0 256) 0)) (= ~g1~0 1) (= ~d2~0 0)), Black: 352#(= ~pos~0 0), Black: 187#(and (= ~g1~0 1) (not (= (mod ~d2~0 256) 0))), Black: 246#(< 0 (mod ~g1~0 256)), Black: 273#(or (< 0 (mod ~g1~0 256)) (= (mod ~g2~0 256) 0)), Black: 263#(or (= (mod ~d2~0 256) 0) (< 0 (mod ~g1~0 256))), Black: 310#(and (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (= ~g1~0 1) (= ~d2~0 0)), Black: 324#(and (or (< 0 (mod ~g1~0 256)) (< 0 (mod ~d2~0 256))) (or (and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))) (= (mod ~g2~0 256) 0))), Black: 194#(and (= ~g1~0 1) (= ~d2~0 0)), Black: 141#true, Black: 280#(or (and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))) (= (mod ~g2~0 256) 0)), Black: 318#(and (= ~g1~0 1) (= ~d2~0 0) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), Black: 330#(and (or (and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))) (= (mod ~g2~0 256) 0)) (or (= (mod ~d2~0 256) 0) (< 0 (mod ~g1~0 256)))), Black: 256#(or (< 0 (mod ~g1~0 256)) (< 0 (mod ~d2~0 256))), 316#(and (<= 1 (mod ~g1~0 256)) (or (not (= (mod ~d1~0 256) 0)) (= (mod ~g2~0 256) 0))), Black: 37#(= ~pos~0 0), 16#L97-1true, Black: 41#(= ~g2~0 1), Black: 45#(and (<= (div ~g1~0 256) 0) (<= 1 ~g1~0)), 10#L50true, 5#L72true, 57#true, Black: 49#(and (<= (div ~d1~0 256) 0) (<= 1 ~d1~0)), Black: 53#(= ~g2~0 1), Black: 54#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2024-01-27 15:32:00,827 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-01-27 15:32:00,827 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-01-27 15:32:00,828 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-27 15:32:00,828 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-01-27 15:32:00,866 INFO L124 PetriNetUnfolderBase]: 3679/7139 cut-off events. [2024-01-27 15:32:00,866 INFO L125 PetriNetUnfolderBase]: For 47011/47708 co-relation queries the response was YES. [2024-01-27 15:32:00,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33919 conditions, 7139 events. 3679/7139 cut-off events. For 47011/47708 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 51910 event pairs, 529 based on Foata normal form. 55/7012 useless extension candidates. Maximal degree in co-relation 25534. Up to 3985 conditions per place. [2024-01-27 15:32:00,930 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 188 selfloop transitions, 21 changer transitions 3/261 dead transitions. [2024-01-27 15:32:00,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 261 transitions, 2412 flow [2024-01-27 15:32:00,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:32:00,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:32:00,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 115 transitions. [2024-01-27 15:32:00,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7931034482758621 [2024-01-27 15:32:00,932 INFO L175 Difference]: Start difference. First operand has 84 places, 142 transitions, 1088 flow. Second operand 5 states and 115 transitions. [2024-01-27 15:32:00,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 261 transitions, 2412 flow [2024-01-27 15:32:00,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 261 transitions, 2358 flow, removed 27 selfloop flow, removed 0 redundant places. [2024-01-27 15:32:00,994 INFO L231 Difference]: Finished difference. Result has 90 places, 160 transitions, 1233 flow [2024-01-27 15:32:00,995 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1064, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1233, PETRI_PLACES=90, PETRI_TRANSITIONS=160} [2024-01-27 15:32:00,995 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 61 predicate places. [2024-01-27 15:32:00,996 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 160 transitions, 1233 flow [2024-01-27 15:32:00,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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-01-27 15:32:00,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:32:00,996 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:32:01,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-01-27 15:32:01,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:32:01,209 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:32:01,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:32:01,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1408520521, now seen corresponding path program 3 times [2024-01-27 15:32:01,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:32:01,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787399373] [2024-01-27 15:32:01,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:32:01,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:32:01,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:32:01,368 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:32:01,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:32:01,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787399373] [2024-01-27 15:32:01,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787399373] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:32:01,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971262950] [2024-01-27 15:32:01,369 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-27 15:32:01,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:32:01,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:32:01,370 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:32:01,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-01-27 15:32:01,429 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-01-27 15:32:01,429 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:32:01,430 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 11 conjunts are in the unsatisfiable core [2024-01-27 15:32:01,432 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:32:01,463 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:32:01,463 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:32:01,487 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:32:01,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971262950] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:32:01,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:32:01,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2024-01-27 15:32:01,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109253712] [2024-01-27 15:32:01,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:32:01,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 15:32:01,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:32:01,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 15:32:01,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-01-27 15:32:01,491 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 29 [2024-01-27 15:32:01,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 160 transitions, 1233 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 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-01-27 15:32:01,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:32:01,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 29 [2024-01-27 15:32:01,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:32:02,770 INFO L124 PetriNetUnfolderBase]: 6258/12096 cut-off events. [2024-01-27 15:32:02,770 INFO L125 PetriNetUnfolderBase]: For 80320/81408 co-relation queries the response was YES. [2024-01-27 15:32:02,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57315 conditions, 12096 events. 6258/12096 cut-off events. For 80320/81408 co-relation queries the response was YES. Maximal size of possible extension queue 502. Compared 97849 event pairs, 808 based on Foata normal form. 158/11937 useless extension candidates. Maximal degree in co-relation 41863. Up to 2497 conditions per place. [2024-01-27 15:32:02,862 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 288 selfloop transitions, 49 changer transitions 3/389 dead transitions. [2024-01-27 15:32:02,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 389 transitions, 3725 flow [2024-01-27 15:32:02,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 15:32:02,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 15:32:02,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 143 transitions. [2024-01-27 15:32:02,864 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8218390804597702 [2024-01-27 15:32:02,864 INFO L175 Difference]: Start difference. First operand has 90 places, 160 transitions, 1233 flow. Second operand 6 states and 143 transitions. [2024-01-27 15:32:02,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 389 transitions, 3725 flow [2024-01-27 15:32:02,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 389 transitions, 3717 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-01-27 15:32:02,991 INFO L231 Difference]: Finished difference. Result has 96 places, 176 transitions, 1453 flow [2024-01-27 15:32:02,992 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1225, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1453, PETRI_PLACES=96, PETRI_TRANSITIONS=176} [2024-01-27 15:32:02,993 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 67 predicate places. [2024-01-27 15:32:02,993 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 176 transitions, 1453 flow [2024-01-27 15:32:02,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 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-01-27 15:32:02,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:32:02,993 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:32:03,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-01-27 15:32:03,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-01-27 15:32:03,204 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:32:03,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:32:03,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1143330725, now seen corresponding path program 4 times [2024-01-27 15:32:03,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:32:03,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989461996] [2024-01-27 15:32:03,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:32:03,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:32:03,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:32:03,308 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-01-27 15:32:03,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:32:03,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989461996] [2024-01-27 15:32:03,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989461996] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:32:03,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:32:03,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 15:32:03,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052965362] [2024-01-27 15:32:03,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:32:03,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:32:03,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:32:03,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:32:03,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:32:03,315 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 29 [2024-01-27 15:32:03,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 176 transitions, 1453 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:32:03,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:32:03,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 29 [2024-01-27 15:32:03,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:32:03,908 INFO L124 PetriNetUnfolderBase]: 2426/5168 cut-off events. [2024-01-27 15:32:03,908 INFO L125 PetriNetUnfolderBase]: For 39629/40081 co-relation queries the response was YES. [2024-01-27 15:32:03,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26227 conditions, 5168 events. 2426/5168 cut-off events. For 39629/40081 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 39097 event pairs, 730 based on Foata normal form. 309/5300 useless extension candidates. Maximal degree in co-relation 19514. Up to 1673 conditions per place. [2024-01-27 15:32:03,945 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 97 selfloop transitions, 14 changer transitions 1/173 dead transitions. [2024-01-27 15:32:03,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 173 transitions, 1659 flow [2024-01-27 15:32:03,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 15:32:03,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 15:32:03,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2024-01-27 15:32:03,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6379310344827587 [2024-01-27 15:32:03,947 INFO L175 Difference]: Start difference. First operand has 96 places, 176 transitions, 1453 flow. Second operand 4 states and 74 transitions. [2024-01-27 15:32:03,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 173 transitions, 1659 flow [2024-01-27 15:32:03,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 173 transitions, 1607 flow, removed 18 selfloop flow, removed 2 redundant places. [2024-01-27 15:32:03,997 INFO L231 Difference]: Finished difference. Result has 99 places, 155 transitions, 1302 flow [2024-01-27 15:32:03,997 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1233, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1302, PETRI_PLACES=99, PETRI_TRANSITIONS=155} [2024-01-27 15:32:03,998 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 70 predicate places. [2024-01-27 15:32:03,998 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 155 transitions, 1302 flow [2024-01-27 15:32:03,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:32:03,998 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:32:03,998 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:32:03,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-27 15:32:03,998 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:32:03,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:32:03,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1520308125, now seen corresponding path program 5 times [2024-01-27 15:32:03,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:32:03,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174176189] [2024-01-27 15:32:03,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:32:03,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:32:04,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:32:04,174 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-01-27 15:32:04,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:32:04,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174176189] [2024-01-27 15:32:04,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174176189] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:32:04,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649419107] [2024-01-27 15:32:04,175 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-01-27 15:32:04,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:32:04,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:32:04,176 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:32:04,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-01-27 15:32:04,265 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-01-27 15:32:04,266 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:32:04,266 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 10 conjunts are in the unsatisfiable core [2024-01-27 15:32:04,268 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:32:04,308 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-01-27 15:32:04,309 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:32:04,360 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-01-27 15:32:04,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649419107] provided 1 perfect and 1 imperfect interpolant sequences [2024-01-27 15:32:04,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-01-27 15:32:04,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 6] total 11 [2024-01-27 15:32:04,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832394584] [2024-01-27 15:32:04,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:32:04,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:32:04,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:32:04,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:32:04,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-01-27 15:32:04,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 29 [2024-01-27 15:32:04,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 155 transitions, 1302 flow. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-01-27 15:32:04,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:32:04,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 29 [2024-01-27 15:32:04,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:32:04,861 INFO L124 PetriNetUnfolderBase]: 2981/5743 cut-off events. [2024-01-27 15:32:04,862 INFO L125 PetriNetUnfolderBase]: For 43838/44036 co-relation queries the response was YES. [2024-01-27 15:32:04,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29768 conditions, 5743 events. 2981/5743 cut-off events. For 43838/44036 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 40142 event pairs, 502 based on Foata normal form. 194/5888 useless extension candidates. Maximal degree in co-relation 22389. Up to 2335 conditions per place. [2024-01-27 15:32:04,907 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 105 selfloop transitions, 53 changer transitions 0/202 dead transitions. [2024-01-27 15:32:04,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 202 transitions, 2038 flow [2024-01-27 15:32:04,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 15:32:04,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 15:32:04,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2024-01-27 15:32:04,908 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6637931034482759 [2024-01-27 15:32:04,908 INFO L175 Difference]: Start difference. First operand has 99 places, 155 transitions, 1302 flow. Second operand 4 states and 77 transitions. [2024-01-27 15:32:04,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 202 transitions, 2038 flow [2024-01-27 15:32:04,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 202 transitions, 2022 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-01-27 15:32:04,965 INFO L231 Difference]: Finished difference. Result has 100 places, 160 transitions, 1554 flow [2024-01-27 15:32:04,965 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1244, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1554, PETRI_PLACES=100, PETRI_TRANSITIONS=160} [2024-01-27 15:32:04,966 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2024-01-27 15:32:04,966 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 160 transitions, 1554 flow [2024-01-27 15:32:04,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-01-27 15:32:04,966 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:32:04,966 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:32:04,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-01-27 15:32:05,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:32:05,175 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:32:05,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:32:05,175 INFO L85 PathProgramCache]: Analyzing trace with hash 2144587519, now seen corresponding path program 6 times [2024-01-27 15:32:05,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:32:05,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412624468] [2024-01-27 15:32:05,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:32:05,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:32:05,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:32:05,292 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-01-27 15:32:05,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:32:05,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412624468] [2024-01-27 15:32:05,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412624468] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:32:05,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:32:05,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 15:32:05,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831075869] [2024-01-27 15:32:05,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:32:05,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:32:05,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:32:05,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:32:05,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:32:05,297 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 29 [2024-01-27 15:32:05,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 160 transitions, 1554 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-01-27 15:32:05,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:32:05,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 29 [2024-01-27 15:32:05,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:32:05,668 INFO L124 PetriNetUnfolderBase]: 1592/3380 cut-off events. [2024-01-27 15:32:05,668 INFO L125 PetriNetUnfolderBase]: For 37823/38026 co-relation queries the response was YES. [2024-01-27 15:32:05,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19298 conditions, 3380 events. 1592/3380 cut-off events. For 37823/38026 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 23375 event pairs, 481 based on Foata normal form. 276/3606 useless extension candidates. Maximal degree in co-relation 14830. Up to 1469 conditions per place. [2024-01-27 15:32:05,687 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 75 selfloop transitions, 33 changer transitions 1/151 dead transitions. [2024-01-27 15:32:05,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 151 transitions, 1671 flow [2024-01-27 15:32:05,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 15:32:05,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 15:32:05,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2024-01-27 15:32:05,688 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6120689655172413 [2024-01-27 15:32:05,688 INFO L175 Difference]: Start difference. First operand has 100 places, 160 transitions, 1554 flow. Second operand 4 states and 71 transitions. [2024-01-27 15:32:05,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 151 transitions, 1671 flow [2024-01-27 15:32:05,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 151 transitions, 1645 flow, removed 9 selfloop flow, removed 2 redundant places. [2024-01-27 15:32:05,721 INFO L231 Difference]: Finished difference. Result has 103 places, 134 transitions, 1431 flow [2024-01-27 15:32:05,721 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1284, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1431, PETRI_PLACES=103, PETRI_TRANSITIONS=134} [2024-01-27 15:32:05,721 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 74 predicate places. [2024-01-27 15:32:05,721 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 134 transitions, 1431 flow [2024-01-27 15:32:05,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-01-27 15:32:05,722 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:32:05,722 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:32:05,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-27 15:32:05,722 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:32:05,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:32:05,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1539832077, now seen corresponding path program 7 times [2024-01-27 15:32:05,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:32:05,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23093395] [2024-01-27 15:32:05,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:32:05,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:32:05,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:32:05,899 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:32:05,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:32:05,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23093395] [2024-01-27 15:32:05,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23093395] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:32:05,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204898785] [2024-01-27 15:32:05,899 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-01-27 15:32:05,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:32:05,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:32:05,909 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:32:05,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-01-27 15:32:05,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:32:05,968 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 6 conjunts are in the unsatisfiable core [2024-01-27 15:32:05,970 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:32:06,015 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-01-27 15:32:06,015 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:32:06,069 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-01-27 15:32:06,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204898785] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:32:06,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:32:06,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 10 [2024-01-27 15:32:06,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068202533] [2024-01-27 15:32:06,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:32:06,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-01-27 15:32:06,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:32:06,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-01-27 15:32:06,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-01-27 15:32:06,073 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 29 [2024-01-27 15:32:06,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 134 transitions, 1431 flow. Second operand has 10 states, 10 states have (on average 14.2) internal successors, (142), 10 states have internal predecessors, (142), 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-01-27 15:32:06,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:32:06,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 29 [2024-01-27 15:32:06,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:32:06,345 INFO L124 PetriNetUnfolderBase]: 1311/2724 cut-off events. [2024-01-27 15:32:06,345 INFO L125 PetriNetUnfolderBase]: For 36775/37190 co-relation queries the response was YES. [2024-01-27 15:32:06,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17389 conditions, 2724 events. 1311/2724 cut-off events. For 36775/37190 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 17602 event pairs, 349 based on Foata normal form. 229/2852 useless extension candidates. Maximal degree in co-relation 13239. Up to 1105 conditions per place. [2024-01-27 15:32:06,357 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 0 selfloop transitions, 0 changer transitions 131/131 dead transitions. [2024-01-27 15:32:06,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 131 transitions, 1589 flow [2024-01-27 15:32:06,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:32:06,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:32:06,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2024-01-27 15:32:06,358 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5655172413793104 [2024-01-27 15:32:06,358 INFO L175 Difference]: Start difference. First operand has 103 places, 134 transitions, 1431 flow. Second operand 5 states and 82 transitions. [2024-01-27 15:32:06,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 131 transitions, 1589 flow [2024-01-27 15:32:06,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 131 transitions, 1501 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-01-27 15:32:06,386 INFO L231 Difference]: Finished difference. Result has 97 places, 0 transitions, 0 flow [2024-01-27 15:32:06,387 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1163, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=97, PETRI_TRANSITIONS=0} [2024-01-27 15:32:06,387 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 68 predicate places. [2024-01-27 15:32:06,387 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 0 transitions, 0 flow [2024-01-27 15:32:06,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.2) internal successors, (142), 10 states have internal predecessors, (142), 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-01-27 15:32:06,389 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-01-27 15:32:06,390 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-01-27 15:32:06,390 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-01-27 15:32:06,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-01-27 15:32:06,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:32:06,601 INFO L445 BasicCegarLoop]: Path program histogram: [7, 2, 1, 1, 1, 1, 1] [2024-01-27 15:32:06,603 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-27 15:32:06,603 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-27 15:32:06,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 03:32:06 BasicIcfg [2024-01-27 15:32:06,607 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-27 15:32:06,607 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-01-27 15:32:06,607 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-01-27 15:32:06,607 INFO L274 PluginConnector]: Witness Printer initialized [2024-01-27 15:32:06,608 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:31:55" (3/4) ... [2024-01-27 15:32:06,609 INFO L137 WitnessPrinter]: Generating witness for correct program [2024-01-27 15:32:06,612 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-01-27 15:32:06,612 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-01-27 15:32:06,616 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 43 nodes and edges [2024-01-27 15:32:06,616 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-01-27 15:32:06,616 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-01-27 15:32:06,616 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-01-27 15:32:06,669 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-01-27 15:32:06,669 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-01-27 15:32:06,669 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-01-27 15:32:06,670 INFO L158 Benchmark]: Toolchain (without parser) took 12201.43ms. Allocated memory was 167.8MB in the beginning and 1.0GB in the end (delta: 868.2MB). Free memory was 131.4MB in the beginning and 337.6MB in the end (delta: -206.2MB). Peak memory consumption was 663.0MB. Max. memory is 16.1GB. [2024-01-27 15:32:06,670 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 117.4MB. Free memory was 90.1MB in the beginning and 90.0MB in the end (delta: 82.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 15:32:06,670 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.21ms. Allocated memory is still 167.8MB. Free memory was 130.7MB in the beginning and 119.4MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-01-27 15:32:06,671 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.56ms. Allocated memory is still 167.8MB. Free memory was 119.4MB in the beginning and 118.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 15:32:06,671 INFO L158 Benchmark]: Boogie Preprocessor took 52.68ms. Allocated memory is still 167.8MB. Free memory was 118.1MB in the beginning and 116.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 15:32:06,671 INFO L158 Benchmark]: RCFGBuilder took 450.41ms. Allocated memory is still 167.8MB. Free memory was 116.0MB in the beginning and 125.1MB in the end (delta: -9.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-01-27 15:32:06,671 INFO L158 Benchmark]: TraceAbstraction took 11344.96ms. Allocated memory was 167.8MB in the beginning and 1.0GB in the end (delta: 868.2MB). Free memory was 124.4MB in the beginning and 341.8MB in the end (delta: -217.5MB). Peak memory consumption was 652.5MB. Max. memory is 16.1GB. [2024-01-27 15:32:06,671 INFO L158 Benchmark]: Witness Printer took 62.35ms. Allocated memory is still 1.0GB. Free memory was 341.8MB in the beginning and 337.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-27 15:32:06,672 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.13ms. Allocated memory is still 117.4MB. Free memory was 90.1MB in the beginning and 90.0MB in the end (delta: 82.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 248.21ms. Allocated memory is still 167.8MB. Free memory was 130.7MB in the beginning and 119.4MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.56ms. Allocated memory is still 167.8MB. Free memory was 119.4MB in the beginning and 118.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.68ms. Allocated memory is still 167.8MB. Free memory was 118.1MB in the beginning and 116.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 450.41ms. Allocated memory is still 167.8MB. Free memory was 116.0MB in the beginning and 125.1MB in the end (delta: -9.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 11344.96ms. Allocated memory was 167.8MB in the beginning and 1.0GB in the end (delta: 868.2MB). Free memory was 124.4MB in the beginning and 341.8MB in the end (delta: -217.5MB). Peak memory consumption was 652.5MB. Max. memory is 16.1GB. * Witness Printer took 62.35ms. Allocated memory is still 1.0GB. Free memory was 341.8MB in the beginning and 337.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 101]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 42 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.3s, OverallIterations: 14, TraceHistogramMax: 3, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 414 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 395 mSDsluCounter, 44 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38 mSDsCounter, 73 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1477 IncrementalHoareTripleChecker+Invalid, 1550 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 73 mSolverCounterUnsat, 6 mSDtfsCounter, 1477 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 461 GetRequests, 389 SyntacticMatches, 4 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1554occurred in iteration=12, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 582 NumberOfCodeBlocks, 582 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 739 ConstructedInterpolants, 0 QuantifiedInterpolants, 2881 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1041 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 27 InterpolantComputations, 9 PerfectInterpolantSequences, 165/270 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-01-27 15:32:06,705 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 Result: TRUE