./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread/queue_longest.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de 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/pthread/queue_longest.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5fb3c623242420f3b3352ce2377df781fcc1efd56f82dd0011f9620e127821b3 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 17:22:13,150 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 17:22:13,210 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 17:22:13,215 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 17:22:13,216 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 17:22:13,241 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 17:22:13,242 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 17:22:13,242 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 17:22:13,243 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 17:22:13,246 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 17:22:13,246 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 17:22:13,246 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 17:22:13,247 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 17:22:13,248 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 17:22:13,248 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 17:22:13,248 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 17:22:13,249 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 17:22:13,249 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 17:22:13,249 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 17:22:13,249 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 17:22:13,249 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 17:22:13,250 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 17:22:13,250 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 17:22:13,250 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 17:22:13,250 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 17:22:13,251 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 17:22:13,251 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 17:22:13,251 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 17:22:13,252 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 17:22:13,252 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 17:22:13,253 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 17:22:13,254 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 17:22:13,254 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:22:13,254 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 17:22:13,254 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 17:22:13,254 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 17:22:13,254 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 17:22:13,255 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 17:22:13,255 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 17:22:13,255 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 17:22:13,255 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 17:22:13,255 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 17:22:13,256 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 17:22:13,256 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 -> 5fb3c623242420f3b3352ce2377df781fcc1efd56f82dd0011f9620e127821b3 [2024-06-27 17:22:13,459 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 17:22:13,480 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 17:22:13,482 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 17:22:13,483 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 17:22:13,496 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 17:22:13,497 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_longest.i [2024-06-27 17:22:14,689 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 17:22:14,910 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 17:22:14,911 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i [2024-06-27 17:22:14,938 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acefb90ea/8970de01b1d24b359ce38d90ea8fde30/FLAG1829b219b [2024-06-27 17:22:14,949 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acefb90ea/8970de01b1d24b359ce38d90ea8fde30 [2024-06-27 17:22:14,950 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 17:22:14,952 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 17:22:14,953 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 17:22:14,953 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 17:22:14,957 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 17:22:14,958 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:22:14" (1/1) ... [2024-06-27 17:22:14,958 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53612329 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:22:14, skipping insertion in model container [2024-06-27 17:22:14,958 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:22:14" (1/1) ... [2024-06-27 17:22:14,999 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 17:22:15,377 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43296,43309] [2024-06-27 17:22:15,386 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43503,43516] [2024-06-27 17:22:15,388 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43783,43796] [2024-06-27 17:22:15,391 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:22:15,398 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 17:22:15,468 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43296,43309] [2024-06-27 17:22:15,469 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43503,43516] [2024-06-27 17:22:15,474 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43783,43796] [2024-06-27 17:22:15,476 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:22:15,546 INFO L206 MainTranslator]: Completed translation [2024-06-27 17:22:15,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:22:15 WrapperNode [2024-06-27 17:22:15,547 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 17:22:15,548 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 17:22:15,548 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 17:22:15,548 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 17:22:15,553 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:22:15" (1/1) ... [2024-06-27 17:22:15,566 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:22:15" (1/1) ... [2024-06-27 17:22:15,586 INFO L138 Inliner]: procedures = 274, calls = 53, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 239 [2024-06-27 17:22:15,586 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 17:22:15,587 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 17:22:15,587 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 17:22:15,587 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 17:22:15,596 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:22:15" (1/1) ... [2024-06-27 17:22:15,596 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:22:15" (1/1) ... [2024-06-27 17:22:15,599 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:22:15" (1/1) ... [2024-06-27 17:22:15,612 INFO L175 MemorySlicer]: Split 43 memory accesses to 4 slices as follows [2, 5, 4, 32]. 74 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0, 0]. The 18 writes are split as follows [0, 0, 3, 15]. [2024-06-27 17:22:15,612 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:22:15" (1/1) ... [2024-06-27 17:22:15,613 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:22:15" (1/1) ... [2024-06-27 17:22:15,632 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:22:15" (1/1) ... [2024-06-27 17:22:15,635 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:22:15" (1/1) ... [2024-06-27 17:22:15,637 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:22:15" (1/1) ... [2024-06-27 17:22:15,638 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:22:15" (1/1) ... [2024-06-27 17:22:15,643 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 17:22:15,643 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 17:22:15,643 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 17:22:15,644 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 17:22:15,644 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:22:15" (1/1) ... [2024-06-27 17:22:15,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:22:15,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:22:15,670 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-06-27 17:22:15,718 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-06-27 17:22:15,741 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-06-27 17:22:15,741 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-06-27 17:22:15,741 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-06-27 17:22:15,742 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-06-27 17:22:15,742 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-06-27 17:22:15,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-27 17:22:15,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-27 17:22:15,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-06-27 17:22:15,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-06-27 17:22:15,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-27 17:22:15,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-27 17:22:15,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-06-27 17:22:15,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-06-27 17:22:15,743 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-06-27 17:22:15,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 17:22:15,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 17:22:15,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-27 17:22:15,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-06-27 17:22:15,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-06-27 17:22:15,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 17:22:15,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 17:22:15,746 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 17:22:15,889 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 17:22:15,891 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 17:22:16,144 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 17:22:16,144 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 17:22:16,451 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 17:22:16,451 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-06-27 17:22:16,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:22:16 BoogieIcfgContainer [2024-06-27 17:22:16,452 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 17:22:16,453 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 17:22:16,453 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 17:22:16,462 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 17:22:16,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 05:22:14" (1/3) ... [2024-06-27 17:22:16,463 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6856f19e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:22:16, skipping insertion in model container [2024-06-27 17:22:16,463 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:22:15" (2/3) ... [2024-06-27 17:22:16,465 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6856f19e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:22:16, skipping insertion in model container [2024-06-27 17:22:16,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:22:16" (3/3) ... [2024-06-27 17:22:16,466 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longest.i [2024-06-27 17:22:16,512 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 17:22:16,519 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 17:22:16,519 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-27 17:22:16,519 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 17:22:16,566 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-06-27 17:22:16,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 47 transitions, 108 flow [2024-06-27 17:22:16,624 INFO L124 PetriNetUnfolderBase]: 7/45 cut-off events. [2024-06-27 17:22:16,624 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-27 17:22:16,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 45 events. 7/45 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 85 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2024-06-27 17:22:16,629 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 47 transitions, 108 flow [2024-06-27 17:22:16,633 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 43 transitions, 95 flow [2024-06-27 17:22:16,644 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 17:22:16,650 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;@169ad326, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 17:22:16,650 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-06-27 17:22:16,654 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 17:22:16,654 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2024-06-27 17:22:16,654 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 17:22:16,654 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:22:16,654 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-06-27 17:22:16,655 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:22:16,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:22:16,660 INFO L85 PathProgramCache]: Analyzing trace with hash 634039, now seen corresponding path program 1 times [2024-06-27 17:22:16,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:22:16,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558638591] [2024-06-27 17:22:16,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:22:16,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:22:16,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:22:16,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:22:16,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:22:16,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558638591] [2024-06-27 17:22:16,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558638591] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:22:16,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:22:16,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 17:22:16,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670478904] [2024-06-27 17:22:16,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:22:16,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-06-27 17:22:16,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:22:16,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-06-27 17:22:16,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-06-27 17:22:16,860 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-06-27 17:22:16,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 43 transitions, 95 flow. Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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-06-27 17:22:16,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:22:16,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-06-27 17:22:16,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:22:16,993 INFO L124 PetriNetUnfolderBase]: 425/768 cut-off events. [2024-06-27 17:22:16,993 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2024-06-27 17:22:16,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1502 conditions, 768 events. 425/768 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3474 event pairs, 331 based on Foata normal form. 47/726 useless extension candidates. Maximal degree in co-relation 1440. Up to 694 conditions per place. [2024-06-27 17:22:16,999 INFO L140 encePairwiseOnDemand]: 44/47 looper letters, 31 selfloop transitions, 0 changer transitions 0/38 dead transitions. [2024-06-27 17:22:16,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 38 transitions, 147 flow [2024-06-27 17:22:17,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-06-27 17:22:17,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-06-27 17:22:17,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2024-06-27 17:22:17,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.574468085106383 [2024-06-27 17:22:17,009 INFO L175 Difference]: Start difference. First operand has 43 places, 43 transitions, 95 flow. Second operand 2 states and 54 transitions. [2024-06-27 17:22:17,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 38 transitions, 147 flow [2024-06-27 17:22:17,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 38 transitions, 142 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 17:22:17,013 INFO L231 Difference]: Finished difference. Result has 39 places, 38 transitions, 80 flow [2024-06-27 17:22:17,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=80, PETRI_PLACES=39, PETRI_TRANSITIONS=38} [2024-06-27 17:22:17,017 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -4 predicate places. [2024-06-27 17:22:17,017 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 38 transitions, 80 flow [2024-06-27 17:22:17,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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-06-27 17:22:17,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:22:17,018 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:22:17,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 17:22:17,018 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:22:17,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:22:17,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1778644364, now seen corresponding path program 1 times [2024-06-27 17:22:17,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:22:17,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131184588] [2024-06-27 17:22:17,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:22:17,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:22:17,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:22:17,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:22:17,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:22:17,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131184588] [2024-06-27 17:22:17,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131184588] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:22:17,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:22:17,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 17:22:17,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678306274] [2024-06-27 17:22:17,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:22:17,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 17:22:17,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:22:17,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 17:22:17,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 17:22:17,199 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-06-27 17:22:17,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 38 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:22:17,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:22:17,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-06-27 17:22:17,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:22:17,324 INFO L124 PetriNetUnfolderBase]: 405/748 cut-off events. [2024-06-27 17:22:17,325 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-06-27 17:22:17,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1451 conditions, 748 events. 405/748 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3491 event pairs, 304 based on Foata normal form. 0/680 useless extension candidates. Maximal degree in co-relation 1448. Up to 624 conditions per place. [2024-06-27 17:22:17,331 INFO L140 encePairwiseOnDemand]: 44/47 looper letters, 40 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2024-06-27 17:22:17,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 49 transitions, 188 flow [2024-06-27 17:22:17,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 17:22:17,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 17:22:17,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2024-06-27 17:22:17,334 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5177304964539007 [2024-06-27 17:22:17,334 INFO L175 Difference]: Start difference. First operand has 39 places, 38 transitions, 80 flow. Second operand 3 states and 73 transitions. [2024-06-27 17:22:17,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 49 transitions, 188 flow [2024-06-27 17:22:17,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 49 transitions, 188 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 17:22:17,337 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 82 flow [2024-06-27 17:22:17,338 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=41, PETRI_TRANSITIONS=37} [2024-06-27 17:22:17,339 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2024-06-27 17:22:17,341 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 82 flow [2024-06-27 17:22:17,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:22:17,342 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:22:17,342 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:22:17,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 17:22:17,343 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:22:17,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:22:17,343 INFO L85 PathProgramCache]: Analyzing trace with hash -696597918, now seen corresponding path program 1 times [2024-06-27 17:22:17,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:22:17,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18019203] [2024-06-27 17:22:17,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:22:17,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:22:17,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:22:17,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:22:17,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:22:17,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18019203] [2024-06-27 17:22:17,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18019203] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:22:17,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:22:17,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:22:17,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319222780] [2024-06-27 17:22:17,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:22:17,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:22:17,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:22:17,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:22:17,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:22:17,733 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-06-27 17:22:17,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 82 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 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-06-27 17:22:17,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:22:17,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-06-27 17:22:17,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:22:18,029 INFO L124 PetriNetUnfolderBase]: 674/1239 cut-off events. [2024-06-27 17:22:18,029 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2024-06-27 17:22:18,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2425 conditions, 1239 events. 674/1239 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6161 event pairs, 74 based on Foata normal form. 0/1178 useless extension candidates. Maximal degree in co-relation 2421. Up to 658 conditions per place. [2024-06-27 17:22:18,034 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 71 selfloop transitions, 10 changer transitions 3/91 dead transitions. [2024-06-27 17:22:18,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 91 transitions, 371 flow [2024-06-27 17:22:18,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:22:18,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:22:18,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 146 transitions. [2024-06-27 17:22:18,039 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5177304964539007 [2024-06-27 17:22:18,039 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 82 flow. Second operand 6 states and 146 transitions. [2024-06-27 17:22:18,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 91 transitions, 371 flow [2024-06-27 17:22:18,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 91 transitions, 361 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 17:22:18,043 INFO L231 Difference]: Finished difference. Result has 47 places, 47 transitions, 146 flow [2024-06-27 17:22:18,043 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=146, PETRI_PLACES=47, PETRI_TRANSITIONS=47} [2024-06-27 17:22:18,044 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 4 predicate places. [2024-06-27 17:22:18,044 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 47 transitions, 146 flow [2024-06-27 17:22:18,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 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-06-27 17:22:18,045 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:22:18,045 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:22:18,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 17:22:18,045 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:22:18,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:22:18,046 INFO L85 PathProgramCache]: Analyzing trace with hash -343635105, now seen corresponding path program 1 times [2024-06-27 17:22:18,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:22:18,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584021447] [2024-06-27 17:22:18,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:22:18,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:22:18,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:22:18,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:22:18,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:22:18,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584021447] [2024-06-27 17:22:18,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584021447] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:22:18,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:22:18,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 17:22:18,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745236349] [2024-06-27 17:22:18,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:22:18,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 17:22:18,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:22:18,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 17:22:18,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 17:22:18,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-06-27 17:22:18,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 47 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:22:18,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:22:18,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-06-27 17:22:18,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:22:18,235 INFO L124 PetriNetUnfolderBase]: 421/812 cut-off events. [2024-06-27 17:22:18,235 INFO L125 PetriNetUnfolderBase]: For 151/154 co-relation queries the response was YES. [2024-06-27 17:22:18,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1678 conditions, 812 events. 421/812 cut-off events. For 151/154 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3544 event pairs, 215 based on Foata normal form. 28/816 useless extension candidates. Maximal degree in co-relation 1671. Up to 417 conditions per place. [2024-06-27 17:22:18,238 INFO L140 encePairwiseOnDemand]: 43/47 looper letters, 37 selfloop transitions, 4 changer transitions 3/50 dead transitions. [2024-06-27 17:22:18,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 50 transitions, 217 flow [2024-06-27 17:22:18,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 17:22:18,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 17:22:18,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2024-06-27 17:22:18,239 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.524822695035461 [2024-06-27 17:22:18,239 INFO L175 Difference]: Start difference. First operand has 47 places, 47 transitions, 146 flow. Second operand 3 states and 74 transitions. [2024-06-27 17:22:18,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 50 transitions, 217 flow [2024-06-27 17:22:18,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 50 transitions, 211 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 17:22:18,242 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 108 flow [2024-06-27 17:22:18,242 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2024-06-27 17:22:18,243 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 1 predicate places. [2024-06-27 17:22:18,243 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 108 flow [2024-06-27 17:22:18,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:22:18,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:22:18,244 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, 1] [2024-06-27 17:22:18,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 17:22:18,244 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:22:18,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:22:18,245 INFO L85 PathProgramCache]: Analyzing trace with hash -932670206, now seen corresponding path program 1 times [2024-06-27 17:22:18,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:22:18,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633101734] [2024-06-27 17:22:18,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:22:18,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:22:18,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:22:18,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:22:18,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:22:18,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633101734] [2024-06-27 17:22:18,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633101734] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:22:18,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:22:18,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 17:22:18,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458925010] [2024-06-27 17:22:18,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:22:18,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 17:22:18,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:22:18,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 17:22:18,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 17:22:18,327 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-06-27 17:22:18,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-06-27 17:22:18,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:22:18,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-06-27 17:22:18,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:22:18,410 INFO L124 PetriNetUnfolderBase]: 249/544 cut-off events. [2024-06-27 17:22:18,410 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2024-06-27 17:22:18,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1131 conditions, 544 events. 249/544 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2170 event pairs, 85 based on Foata normal form. 32/566 useless extension candidates. Maximal degree in co-relation 1123. Up to 252 conditions per place. [2024-06-27 17:22:18,412 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 34 selfloop transitions, 6 changer transitions 0/46 dead transitions. [2024-06-27 17:22:18,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 46 transitions, 211 flow [2024-06-27 17:22:18,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 17:22:18,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 17:22:18,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2024-06-27 17:22:18,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5035460992907801 [2024-06-27 17:22:18,413 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 108 flow. Second operand 3 states and 71 transitions. [2024-06-27 17:22:18,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 46 transitions, 211 flow [2024-06-27 17:22:18,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 46 transitions, 201 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-27 17:22:18,415 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 110 flow [2024-06-27 17:22:18,415 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2024-06-27 17:22:18,416 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places. [2024-06-27 17:22:18,416 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 110 flow [2024-06-27 17:22:18,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-06-27 17:22:18,416 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:22:18,416 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, 1, 1] [2024-06-27 17:22:18,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 17:22:18,416 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:22:18,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:22:18,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1884471650, now seen corresponding path program 1 times [2024-06-27 17:22:18,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:22:18,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693846397] [2024-06-27 17:22:18,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:22:18,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:22:18,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:22:19,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:22:19,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:22:19,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693846397] [2024-06-27 17:22:19,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693846397] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:22:19,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:22:19,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 17:22:19,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390759558] [2024-06-27 17:22:19,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:22:19,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 17:22:19,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:22:19,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 17:22:19,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 17:22:19,434 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-06-27 17:22:19,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 110 flow. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 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-06-27 17:22:19,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:22:19,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-06-27 17:22:19,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:22:19,745 INFO L124 PetriNetUnfolderBase]: 357/779 cut-off events. [2024-06-27 17:22:19,745 INFO L125 PetriNetUnfolderBase]: For 182/182 co-relation queries the response was YES. [2024-06-27 17:22:19,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1701 conditions, 779 events. 357/779 cut-off events. For 182/182 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3719 event pairs, 69 based on Foata normal form. 0/766 useless extension candidates. Maximal degree in co-relation 1694. Up to 264 conditions per place. [2024-06-27 17:22:19,748 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 66 selfloop transitions, 16 changer transitions 8/96 dead transitions. [2024-06-27 17:22:19,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 96 transitions, 471 flow [2024-06-27 17:22:19,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 17:22:19,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 17:22:19,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions. [2024-06-27 17:22:19,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40425531914893614 [2024-06-27 17:22:19,750 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 110 flow. Second operand 10 states and 190 transitions. [2024-06-27 17:22:19,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 96 transitions, 471 flow [2024-06-27 17:22:19,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 96 transitions, 448 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 17:22:19,755 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 219 flow [2024-06-27 17:22:19,755 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=219, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2024-06-27 17:22:19,756 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 14 predicate places. [2024-06-27 17:22:19,757 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 219 flow [2024-06-27 17:22:19,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 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-06-27 17:22:19,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:22:19,757 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, 1, 1] [2024-06-27 17:22:19,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 17:22:19,757 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:22:19,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:22:19,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1427990020, now seen corresponding path program 2 times [2024-06-27 17:22:19,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:22:19,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96723332] [2024-06-27 17:22:19,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:22:19,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:22:19,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:22:20,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:22:20,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:22:20,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96723332] [2024-06-27 17:22:20,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96723332] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:22:20,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:22:20,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 17:22:20,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687046440] [2024-06-27 17:22:20,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:22:20,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 17:22:20,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:22:20,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 17:22:20,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-27 17:22:20,423 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-06-27 17:22:20,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 219 flow. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 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-06-27 17:22:20,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:22:20,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-06-27 17:22:20,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:22:20,650 INFO L124 PetriNetUnfolderBase]: 466/1039 cut-off events. [2024-06-27 17:22:20,650 INFO L125 PetriNetUnfolderBase]: For 810/812 co-relation queries the response was YES. [2024-06-27 17:22:20,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2715 conditions, 1039 events. 466/1039 cut-off events. For 810/812 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 5794 event pairs, 129 based on Foata normal form. 0/1021 useless extension candidates. Maximal degree in co-relation 2701. Up to 607 conditions per place. [2024-06-27 17:22:20,655 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 69 selfloop transitions, 16 changer transitions 4/95 dead transitions. [2024-06-27 17:22:20,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 95 transitions, 583 flow [2024-06-27 17:22:20,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 17:22:20,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 17:22:20,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions. [2024-06-27 17:22:20,656 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3947990543735225 [2024-06-27 17:22:20,656 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 219 flow. Second operand 9 states and 167 transitions. [2024-06-27 17:22:20,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 95 transitions, 583 flow [2024-06-27 17:22:20,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 95 transitions, 567 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-27 17:22:20,659 INFO L231 Difference]: Finished difference. Result has 69 places, 62 transitions, 369 flow [2024-06-27 17:22:20,659 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=369, PETRI_PLACES=69, PETRI_TRANSITIONS=62} [2024-06-27 17:22:20,660 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 26 predicate places. [2024-06-27 17:22:20,660 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 62 transitions, 369 flow [2024-06-27 17:22:20,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 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-06-27 17:22:20,660 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:22:20,660 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, 1, 1] [2024-06-27 17:22:20,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 17:22:20,660 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:22:20,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:22:20,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1522221040, now seen corresponding path program 3 times [2024-06-27 17:22:20,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:22:20,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115035667] [2024-06-27 17:22:20,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:22:20,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:22:20,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:22:21,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:22:21,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:22:21,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115035667] [2024-06-27 17:22:21,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115035667] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:22:21,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:22:21,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 17:22:21,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753361101] [2024-06-27 17:22:21,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:22:21,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 17:22:21,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:22:21,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 17:22:21,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-06-27 17:22:21,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-06-27 17:22:21,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 62 transitions, 369 flow. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 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-06-27 17:22:21,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:22:21,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-06-27 17:22:21,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:22:21,578 INFO L124 PetriNetUnfolderBase]: 596/1317 cut-off events. [2024-06-27 17:22:21,578 INFO L125 PetriNetUnfolderBase]: For 1748/1748 co-relation queries the response was YES. [2024-06-27 17:22:21,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3732 conditions, 1317 events. 596/1317 cut-off events. For 1748/1748 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 7508 event pairs, 88 based on Foata normal form. 0/1306 useless extension candidates. Maximal degree in co-relation 3712. Up to 306 conditions per place. [2024-06-27 17:22:21,584 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 82 selfloop transitions, 27 changer transitions 4/119 dead transitions. [2024-06-27 17:22:21,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 119 transitions, 840 flow [2024-06-27 17:22:21,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 17:22:21,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 17:22:21,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 179 transitions. [2024-06-27 17:22:21,585 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4231678486997636 [2024-06-27 17:22:21,585 INFO L175 Difference]: Start difference. First operand has 69 places, 62 transitions, 369 flow. Second operand 9 states and 179 transitions. [2024-06-27 17:22:21,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 119 transitions, 840 flow [2024-06-27 17:22:21,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 119 transitions, 794 flow, removed 23 selfloop flow, removed 0 redundant places. [2024-06-27 17:22:21,591 INFO L231 Difference]: Finished difference. Result has 80 places, 70 transitions, 470 flow [2024-06-27 17:22:21,592 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=470, PETRI_PLACES=80, PETRI_TRANSITIONS=70} [2024-06-27 17:22:21,592 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 37 predicate places. [2024-06-27 17:22:21,592 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 70 transitions, 470 flow [2024-06-27 17:22:21,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 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-06-27 17:22:21,593 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:22:21,593 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, 1, 1] [2024-06-27 17:22:21,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 17:22:21,593 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:22:21,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:22:21,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1595177966, now seen corresponding path program 4 times [2024-06-27 17:22:21,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:22:21,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077100890] [2024-06-27 17:22:21,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:22:21,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:22:21,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:22:22,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:22:22,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:22:22,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077100890] [2024-06-27 17:22:22,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077100890] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:22:22,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:22:22,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 17:22:22,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581423724] [2024-06-27 17:22:22,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:22:22,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 17:22:22,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:22:22,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 17:22:22,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 17:22:22,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-06-27 17:22:22,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 70 transitions, 470 flow. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 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-06-27 17:22:22,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:22:22,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-06-27 17:22:22,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:22:22,614 INFO L124 PetriNetUnfolderBase]: 682/1504 cut-off events. [2024-06-27 17:22:22,615 INFO L125 PetriNetUnfolderBase]: For 2916/2916 co-relation queries the response was YES. [2024-06-27 17:22:22,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4539 conditions, 1504 events. 682/1504 cut-off events. For 2916/2916 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 9013 event pairs, 169 based on Foata normal form. 0/1485 useless extension candidates. Maximal degree in co-relation 4515. Up to 676 conditions per place. [2024-06-27 17:22:22,622 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 89 selfloop transitions, 21 changer transitions 8/124 dead transitions. [2024-06-27 17:22:22,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 124 transitions, 951 flow [2024-06-27 17:22:22,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 17:22:22,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 17:22:22,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 180 transitions. [2024-06-27 17:22:22,624 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425531914893617 [2024-06-27 17:22:22,624 INFO L175 Difference]: Start difference. First operand has 80 places, 70 transitions, 470 flow. Second operand 9 states and 180 transitions. [2024-06-27 17:22:22,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 124 transitions, 951 flow [2024-06-27 17:22:22,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 124 transitions, 872 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-06-27 17:22:22,634 INFO L231 Difference]: Finished difference. Result has 88 places, 81 transitions, 599 flow [2024-06-27 17:22:22,634 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=599, PETRI_PLACES=88, PETRI_TRANSITIONS=81} [2024-06-27 17:22:22,635 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 45 predicate places. [2024-06-27 17:22:22,635 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 81 transitions, 599 flow [2024-06-27 17:22:22,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 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-06-27 17:22:22,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:22:22,636 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, 1, 1] [2024-06-27 17:22:22,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 17:22:22,636 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:22:22,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:22:22,636 INFO L85 PathProgramCache]: Analyzing trace with hash -161854226, now seen corresponding path program 5 times [2024-06-27 17:22:22,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:22:22,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422430712] [2024-06-27 17:22:22,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:22:22,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:22:22,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:22:23,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:22:23,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:22:23,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422430712] [2024-06-27 17:22:23,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422430712] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:22:23,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:22:23,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 17:22:23,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902319839] [2024-06-27 17:22:23,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:22:23,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 17:22:23,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:22:23,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 17:22:23,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 17:22:23,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-06-27 17:22:23,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 81 transitions, 599 flow. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 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-06-27 17:22:23,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:22:23,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-06-27 17:22:23,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:22:23,732 INFO L124 PetriNetUnfolderBase]: 733/1606 cut-off events. [2024-06-27 17:22:23,732 INFO L125 PetriNetUnfolderBase]: For 3615/3615 co-relation queries the response was YES. [2024-06-27 17:22:23,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4979 conditions, 1606 events. 733/1606 cut-off events. For 3615/3615 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 9717 event pairs, 155 based on Foata normal form. 0/1589 useless extension candidates. Maximal degree in co-relation 4950. Up to 694 conditions per place. [2024-06-27 17:22:23,741 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 91 selfloop transitions, 29 changer transitions 6/132 dead transitions. [2024-06-27 17:22:23,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 132 transitions, 1076 flow [2024-06-27 17:22:23,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 17:22:23,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 17:22:23,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions. [2024-06-27 17:22:23,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40425531914893614 [2024-06-27 17:22:23,743 INFO L175 Difference]: Start difference. First operand has 88 places, 81 transitions, 599 flow. Second operand 10 states and 190 transitions. [2024-06-27 17:22:23,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 132 transitions, 1076 flow [2024-06-27 17:22:23,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 132 transitions, 991 flow, removed 39 selfloop flow, removed 2 redundant places. [2024-06-27 17:22:23,756 INFO L231 Difference]: Finished difference. Result has 97 places, 87 transitions, 676 flow [2024-06-27 17:22:23,756 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=676, PETRI_PLACES=97, PETRI_TRANSITIONS=87} [2024-06-27 17:22:23,756 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 54 predicate places. [2024-06-27 17:22:23,757 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 87 transitions, 676 flow [2024-06-27 17:22:23,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 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-06-27 17:22:23,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:22:23,757 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] [2024-06-27 17:22:23,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 17:22:23,757 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:22:23,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:22:23,758 INFO L85 PathProgramCache]: Analyzing trace with hash 178062702, now seen corresponding path program 1 times [2024-06-27 17:22:23,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:22:23,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917353644] [2024-06-27 17:22:23,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:22:23,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:22:23,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:22:24,575 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:22:24,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:22:24,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917353644] [2024-06-27 17:22:24,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917353644] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:22:24,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598412115] [2024-06-27 17:22:24,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:22:24,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:22:24,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:22:24,578 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-06-27 17:22:24,599 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-06-27 17:22:24,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:22:24,750 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 36 conjunts are in the unsatisfiable core [2024-06-27 17:22:24,758 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:22:24,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2024-06-27 17:22:24,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 107 [2024-06-27 17:22:24,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-06-27 17:22:24,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-06-27 17:22:25,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2024-06-27 17:22:25,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 47 [2024-06-27 17:22:25,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 69 [2024-06-27 17:22:25,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 55 [2024-06-27 17:22:25,898 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:22:25,898 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:22:26,233 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:22:26,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2024-06-27 17:22:26,250 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-06-27 17:22:26,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-06-27 17:22:27,398 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-06-27 17:22:27,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-06-27 17:22:27,473 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:22:27,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2024-06-27 17:22:29,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-06-27 17:22:29,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 102 [2024-06-27 17:22:29,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-06-27 17:22:29,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 102 [2024-06-27 17:22:29,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-06-27 17:22:29,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2024-06-27 17:22:29,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-06-27 17:22:29,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2024-06-27 17:22:29,556 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-06-27 17:22:29,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-06-27 17:22:30,251 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:22:30,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598412115] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:22:30,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:22:30,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2024-06-27 17:22:30,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385565275] [2024-06-27 17:22:30,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:22:30,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-06-27 17:22:30,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:22:30,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-06-27 17:22:30,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=632, Unknown=0, NotChecked=0, Total=756 [2024-06-27 17:22:30,669 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-06-27 17:22:30,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 87 transitions, 676 flow. Second operand has 28 states, 28 states have (on average 11.535714285714286) internal successors, (323), 28 states have internal predecessors, (323), 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-06-27 17:22:30,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:22:30,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-06-27 17:22:30,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:22:33,031 INFO L124 PetriNetUnfolderBase]: 972/2029 cut-off events. [2024-06-27 17:22:33,032 INFO L125 PetriNetUnfolderBase]: For 4589/4590 co-relation queries the response was YES. [2024-06-27 17:22:33,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6309 conditions, 2029 events. 972/2029 cut-off events. For 4589/4590 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 12252 event pairs, 241 based on Foata normal form. 18/2036 useless extension candidates. Maximal degree in co-relation 6278. Up to 1284 conditions per place. [2024-06-27 17:22:33,044 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 136 selfloop transitions, 40 changer transitions 2/183 dead transitions. [2024-06-27 17:22:33,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 183 transitions, 1409 flow [2024-06-27 17:22:33,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-06-27 17:22:33,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-06-27 17:22:33,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 294 transitions. [2024-06-27 17:22:33,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36795994993742176 [2024-06-27 17:22:33,047 INFO L175 Difference]: Start difference. First operand has 97 places, 87 transitions, 676 flow. Second operand 17 states and 294 transitions. [2024-06-27 17:22:33,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 183 transitions, 1409 flow [2024-06-27 17:22:33,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 183 transitions, 1329 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-06-27 17:22:33,057 INFO L231 Difference]: Finished difference. Result has 115 places, 114 transitions, 914 flow [2024-06-27 17:22:33,058 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=914, PETRI_PLACES=115, PETRI_TRANSITIONS=114} [2024-06-27 17:22:33,058 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 72 predicate places. [2024-06-27 17:22:33,058 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 114 transitions, 914 flow [2024-06-27 17:22:33,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 11.535714285714286) internal successors, (323), 28 states have internal predecessors, (323), 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-06-27 17:22:33,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:22:33,059 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] [2024-06-27 17:22:33,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-06-27 17:22:33,271 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,SelfDestructingSolverStorable10 [2024-06-27 17:22:33,272 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:22:33,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:22:33,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1433245030, now seen corresponding path program 2 times [2024-06-27 17:22:33,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:22:33,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832455100] [2024-06-27 17:22:33,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:22:33,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:22:33,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:22:34,349 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:22:34,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:22:34,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832455100] [2024-06-27 17:22:34,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832455100] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:22:34,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205447499] [2024-06-27 17:22:34,350 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 17:22:34,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:22:34,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:22:34,369 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-06-27 17:22:34,388 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-06-27 17:22:34,593 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 17:22:34,593 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:22:34,595 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 37 conjunts are in the unsatisfiable core [2024-06-27 17:22:34,602 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:22:34,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2024-06-27 17:22:34,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 131 [2024-06-27 17:22:34,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-06-27 17:22:34,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-06-27 17:22:34,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 26 [2024-06-27 17:22:34,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 47 [2024-06-27 17:22:35,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 65 [2024-06-27 17:22:35,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 61 [2024-06-27 17:22:35,428 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:22:35,428 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:22:35,779 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:22:35,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2024-06-27 17:22:35,852 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-06-27 17:22:35,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-06-27 17:22:37,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:22:37,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2024-06-27 17:22:37,638 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-06-27 17:22:37,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-06-27 17:22:45,879 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:22:45,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205447499] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:22:45,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:22:45,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2024-06-27 17:22:45,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968661093] [2024-06-27 17:22:45,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:22:45,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-06-27 17:22:45,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:22:45,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-06-27 17:22:45,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=623, Unknown=1, NotChecked=0, Total=756 [2024-06-27 17:22:50,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:22:54,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:22:54,443 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 47 [2024-06-27 17:22:54,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 114 transitions, 914 flow. Second operand has 28 states, 28 states have (on average 9.857142857142858) internal successors, (276), 28 states have internal predecessors, (276), 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-06-27 17:22:54,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:22:54,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 47 [2024-06-27 17:22:54,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:22:59,665 INFO L124 PetriNetUnfolderBase]: 2097/3865 cut-off events. [2024-06-27 17:22:59,665 INFO L125 PetriNetUnfolderBase]: For 12958/12958 co-relation queries the response was YES. [2024-06-27 17:22:59,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13654 conditions, 3865 events. 2097/3865 cut-off events. For 12958/12958 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 22387 event pairs, 346 based on Foata normal form. 10/3857 useless extension candidates. Maximal degree in co-relation 13616. Up to 1736 conditions per place. [2024-06-27 17:22:59,706 INFO L140 encePairwiseOnDemand]: 34/47 looper letters, 199 selfloop transitions, 45 changer transitions 5/252 dead transitions. [2024-06-27 17:22:59,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 252 transitions, 2122 flow [2024-06-27 17:22:59,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-06-27 17:22:59,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-06-27 17:22:59,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 289 transitions. [2024-06-27 17:22:59,709 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38430851063829785 [2024-06-27 17:22:59,709 INFO L175 Difference]: Start difference. First operand has 115 places, 114 transitions, 914 flow. Second operand 16 states and 289 transitions. [2024-06-27 17:22:59,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 252 transitions, 2122 flow [2024-06-27 17:22:59,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 252 transitions, 2026 flow, removed 39 selfloop flow, removed 6 redundant places. [2024-06-27 17:22:59,747 INFO L231 Difference]: Finished difference. Result has 133 places, 136 transitions, 1193 flow [2024-06-27 17:22:59,747 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1193, PETRI_PLACES=133, PETRI_TRANSITIONS=136} [2024-06-27 17:22:59,748 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 90 predicate places. [2024-06-27 17:22:59,748 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 136 transitions, 1193 flow [2024-06-27 17:22:59,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 9.857142857142858) internal successors, (276), 28 states have internal predecessors, (276), 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-06-27 17:22:59,748 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:22:59,748 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] [2024-06-27 17:22:59,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-06-27 17:22:59,960 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,SelfDestructingSolverStorable11 [2024-06-27 17:22:59,960 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:22:59,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:22:59,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1442743228, now seen corresponding path program 3 times [2024-06-27 17:22:59,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:22:59,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185265183] [2024-06-27 17:22:59,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:22:59,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:23:00,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:23:00,806 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:23:00,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:23:00,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185265183] [2024-06-27 17:23:00,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185265183] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:23:00,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163612677] [2024-06-27 17:23:00,807 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-27 17:23:00,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:23:00,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:23:00,816 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-06-27 17:23:00,817 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-06-27 17:23:01,069 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-06-27 17:23:01,069 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:23:01,072 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 43 conjunts are in the unsatisfiable core [2024-06-27 17:23:01,076 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:23:01,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2024-06-27 17:23:01,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 201 treesize of output 183 [2024-06-27 17:23:01,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-06-27 17:23:01,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-06-27 17:23:01,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 43 [2024-06-27 17:23:01,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 65 [2024-06-27 17:23:01,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:23:01,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 80 [2024-06-27 17:23:01,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 76 [2024-06-27 17:23:02,021 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:23:02,022 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:23:02,432 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-06-27 17:23:02,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-06-27 17:23:02,440 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:23:02,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2024-06-27 17:23:12,871 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-06-27 17:23:12,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-06-27 17:23:12,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:23:12,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2024-06-27 17:23:19,473 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:23:19,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163612677] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:23:19,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:23:19,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2024-06-27 17:23:19,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798278719] [2024-06-27 17:23:19,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:23:19,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-06-27 17:23:19,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:23:19,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-06-27 17:23:19,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=628, Unknown=2, NotChecked=0, Total=756 [2024-06-27 17:23:23,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:23:27,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:23:27,351 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 47 [2024-06-27 17:23:27,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 136 transitions, 1193 flow. Second operand has 28 states, 28 states have (on average 10.75) internal successors, (301), 28 states have internal predecessors, (301), 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-06-27 17:23:27,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:23:27,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 47 [2024-06-27 17:23:27,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:23:38,198 INFO L124 PetriNetUnfolderBase]: 2250/4290 cut-off events. [2024-06-27 17:23:38,198 INFO L125 PetriNetUnfolderBase]: For 24671/24671 co-relation queries the response was YES. [2024-06-27 17:23:38,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17740 conditions, 4290 events. 2250/4290 cut-off events. For 24671/24671 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 27404 event pairs, 175 based on Foata normal form. 0/4259 useless extension candidates. Maximal degree in co-relation 17692. Up to 908 conditions per place. [2024-06-27 17:23:38,234 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 203 selfloop transitions, 101 changer transitions 8/316 dead transitions. [2024-06-27 17:23:38,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 316 transitions, 3011 flow [2024-06-27 17:23:38,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-06-27 17:23:38,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-06-27 17:23:38,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 388 transitions. [2024-06-27 17:23:38,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37524177949709864 [2024-06-27 17:23:38,241 INFO L175 Difference]: Start difference. First operand has 133 places, 136 transitions, 1193 flow. Second operand 22 states and 388 transitions. [2024-06-27 17:23:38,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 316 transitions, 3011 flow [2024-06-27 17:23:38,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 316 transitions, 2913 flow, removed 32 selfloop flow, removed 6 redundant places. [2024-06-27 17:23:38,299 INFO L231 Difference]: Finished difference. Result has 159 places, 175 transitions, 1901 flow [2024-06-27 17:23:38,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1107, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1901, PETRI_PLACES=159, PETRI_TRANSITIONS=175} [2024-06-27 17:23:38,300 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 116 predicate places. [2024-06-27 17:23:38,301 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 175 transitions, 1901 flow [2024-06-27 17:23:38,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 10.75) internal successors, (301), 28 states have internal predecessors, (301), 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-06-27 17:23:38,301 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:23:38,301 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] [2024-06-27 17:23:38,316 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-06-27 17:23:38,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:23:38,513 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:23:38,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:23:38,514 INFO L85 PathProgramCache]: Analyzing trace with hash -548353092, now seen corresponding path program 4 times [2024-06-27 17:23:38,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:23:38,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580681729] [2024-06-27 17:23:38,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:23:38,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:23:38,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:23:39,417 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:23:39,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:23:39,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580681729] [2024-06-27 17:23:39,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580681729] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:23:39,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980933897] [2024-06-27 17:23:39,418 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-06-27 17:23:39,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:23:39,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:23:39,419 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-06-27 17:23:39,428 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-06-27 17:23:39,594 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-06-27 17:23:39,594 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:23:39,596 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 39 conjunts are in the unsatisfiable core [2024-06-27 17:23:39,604 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:23:39,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2024-06-27 17:23:39,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 107 [2024-06-27 17:23:39,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-06-27 17:23:39,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-06-27 17:23:40,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 47 [2024-06-27 17:23:40,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 29 [2024-06-27 17:23:40,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 65 [2024-06-27 17:23:40,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 61 [2024-06-27 17:23:40,845 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:23:40,845 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:23:45,521 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-06-27 17:23:45,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-06-27 17:23:45,534 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:23:45,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2024-06-27 17:23:48,509 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:23:48,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 2783 treesize of output 1609 [2024-06-27 17:23:48,666 INFO L349 Elim1Store]: treesize reduction 5, result has 92.5 percent of original size [2024-06-27 17:23:48,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 2820 treesize of output 1641 [2024-06-27 17:23:48,743 INFO L349 Elim1Store]: treesize reduction 10, result has 67.7 percent of original size [2024-06-27 17:23:48,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 97 treesize of output 79 [2024-06-27 17:23:48,781 INFO L349 Elim1Store]: treesize reduction 15, result has 51.6 percent of original size [2024-06-27 17:23:48,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 206 treesize of output 137 [2024-06-27 17:23:48,810 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:23:48,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2024-06-27 17:23:48,886 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:23:48,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 22 [2024-06-27 17:23:48,921 INFO L349 Elim1Store]: treesize reduction 5, result has 76.2 percent of original size [2024-06-27 17:23:48,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 31 [2024-06-27 17:23:50,450 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:23:50,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980933897] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:23:50,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:23:50,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 29 [2024-06-27 17:23:50,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985511844] [2024-06-27 17:23:50,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:23:50,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-06-27 17:23:50,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:23:50,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-06-27 17:23:50,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=738, Unknown=0, NotChecked=0, Total=870 [2024-06-27 17:23:51,372 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-06-27 17:23:51,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 175 transitions, 1901 flow. Second operand has 30 states, 30 states have (on average 11.366666666666667) internal successors, (341), 30 states have internal predecessors, (341), 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-06-27 17:23:51,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:23:51,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-06-27 17:23:51,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:24:01,619 INFO L124 PetriNetUnfolderBase]: 2268/4586 cut-off events. [2024-06-27 17:24:01,620 INFO L125 PetriNetUnfolderBase]: For 48594/48594 co-relation queries the response was YES. [2024-06-27 17:24:01,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23155 conditions, 4586 events. 2268/4586 cut-off events. For 48594/48594 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 31267 event pairs, 234 based on Foata normal form. 20/4567 useless extension candidates. Maximal degree in co-relation 23095. Up to 1062 conditions per place. [2024-06-27 17:24:01,663 INFO L140 encePairwiseOnDemand]: 32/47 looper letters, 226 selfloop transitions, 127 changer transitions 4/362 dead transitions. [2024-06-27 17:24:01,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 362 transitions, 4364 flow [2024-06-27 17:24:01,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-06-27 17:24:01,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-06-27 17:24:01,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 388 transitions. [2024-06-27 17:24:01,668 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37524177949709864 [2024-06-27 17:24:01,668 INFO L175 Difference]: Start difference. First operand has 159 places, 175 transitions, 1901 flow. Second operand 22 states and 388 transitions. [2024-06-27 17:24:01,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 362 transitions, 4364 flow [2024-06-27 17:24:01,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 362 transitions, 4085 flow, removed 108 selfloop flow, removed 9 redundant places. [2024-06-27 17:24:01,826 INFO L231 Difference]: Finished difference. Result has 180 places, 212 transitions, 2638 flow [2024-06-27 17:24:01,827 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1725, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2638, PETRI_PLACES=180, PETRI_TRANSITIONS=212} [2024-06-27 17:24:01,827 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 137 predicate places. [2024-06-27 17:24:01,827 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 212 transitions, 2638 flow [2024-06-27 17:24:01,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 11.366666666666667) internal successors, (341), 30 states have internal predecessors, (341), 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-06-27 17:24:01,828 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:24:01,828 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] [2024-06-27 17:24:01,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-06-27 17:24:02,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:24:02,053 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:24:02,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:24:02,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1154804914, now seen corresponding path program 5 times [2024-06-27 17:24:02,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:24:02,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071775603] [2024-06-27 17:24:02,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:24:02,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:24:02,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:24:03,137 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:24:03,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:24:03,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071775603] [2024-06-27 17:24:03,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071775603] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:24:03,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100551033] [2024-06-27 17:24:03,138 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-06-27 17:24:03,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:24:03,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:24:03,139 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-06-27 17:24:03,140 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-06-27 17:24:03,318 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 17:24:03,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:24:03,320 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 34 conjunts are in the unsatisfiable core [2024-06-27 17:24:03,323 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:24:03,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2024-06-27 17:24:03,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 145 [2024-06-27 17:24:03,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-06-27 17:24:03,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 65 [2024-06-27 17:24:03,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-06-27 17:24:03,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 37 [2024-06-27 17:24:04,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 85 [2024-06-27 17:24:04,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 85 [2024-06-27 17:24:04,589 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:24:04,590 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:24:04,814 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-06-27 17:24:04,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-06-27 17:24:04,833 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:24:04,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2024-06-27 17:24:06,396 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-06-27 17:24:06,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-06-27 17:24:06,494 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:24:06,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2024-06-27 17:24:18,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-06-27 17:24:18,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2024-06-27 17:24:18,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-06-27 17:24:18,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2024-06-27 17:24:18,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-06-27 17:24:18,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 114 [2024-06-27 17:24:19,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-06-27 17:24:19,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 54 [2024-06-27 17:24:20,293 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:24:20,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2024-06-27 17:24:21,280 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:24:21,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100551033] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:24:21,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:24:21,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2024-06-27 17:24:21,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589478221] [2024-06-27 17:24:21,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:24:21,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-06-27 17:24:21,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:24:21,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-06-27 17:24:21,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=620, Unknown=2, NotChecked=0, Total=756 [2024-06-27 17:24:25,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:24:26,011 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 47 [2024-06-27 17:24:26,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 212 transitions, 2638 flow. Second operand has 28 states, 28 states have (on average 10.75) internal successors, (301), 28 states have internal predecessors, (301), 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-06-27 17:24:26,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:24:26,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 47 [2024-06-27 17:24:26,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:24:32,543 INFO L124 PetriNetUnfolderBase]: 3290/6316 cut-off events. [2024-06-27 17:24:32,544 INFO L125 PetriNetUnfolderBase]: For 81007/81007 co-relation queries the response was YES. [2024-06-27 17:24:32,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33109 conditions, 6316 events. 3290/6316 cut-off events. For 81007/81007 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 43963 event pairs, 875 based on Foata normal form. 0/6258 useless extension candidates. Maximal degree in co-relation 33040. Up to 4434 conditions per place. [2024-06-27 17:24:32,607 INFO L140 encePairwiseOnDemand]: 34/47 looper letters, 273 selfloop transitions, 44 changer transitions 2/323 dead transitions. [2024-06-27 17:24:32,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 323 transitions, 4277 flow [2024-06-27 17:24:32,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-06-27 17:24:32,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-06-27 17:24:32,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 267 transitions. [2024-06-27 17:24:32,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37872340425531914 [2024-06-27 17:24:32,611 INFO L175 Difference]: Start difference. First operand has 180 places, 212 transitions, 2638 flow. Second operand 15 states and 267 transitions. [2024-06-27 17:24:32,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 323 transitions, 4277 flow [2024-06-27 17:24:32,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 323 transitions, 4029 flow, removed 90 selfloop flow, removed 11 redundant places. [2024-06-27 17:24:32,970 INFO L231 Difference]: Finished difference. Result has 190 places, 231 transitions, 2901 flow [2024-06-27 17:24:32,970 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2481, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2901, PETRI_PLACES=190, PETRI_TRANSITIONS=231} [2024-06-27 17:24:32,972 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 147 predicate places. [2024-06-27 17:24:32,972 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 231 transitions, 2901 flow [2024-06-27 17:24:32,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 10.75) internal successors, (301), 28 states have internal predecessors, (301), 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-06-27 17:24:32,973 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:24:32,973 INFO L208 CegarLoopForPetriNet]: trace histogram [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, 1, 1] [2024-06-27 17:24:32,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-06-27 17:24:33,188 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,SelfDestructingSolverStorable14 [2024-06-27 17:24:33,189 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:24:33,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:24:33,190 INFO L85 PathProgramCache]: Analyzing trace with hash -817502146, now seen corresponding path program 1 times [2024-06-27 17:24:33,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:24:33,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027293489] [2024-06-27 17:24:33,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:24:33,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:24:33,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 17:24:33,214 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 17:24:33,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 17:24:33,349 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 17:24:33,349 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 17:24:33,350 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-06-27 17:24:33,351 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-06-27 17:24:33,351 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-06-27 17:24:33,351 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-06-27 17:24:33,351 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2024-06-27 17:24:33,352 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2024-06-27 17:24:33,352 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-06-27 17:24:33,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 17:24:33,352 INFO L445 BasicCegarLoop]: Path program histogram: [5, 5, 1, 1, 1, 1, 1, 1] [2024-06-27 17:24:33,358 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-27 17:24:33,358 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-27 17:24:33,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 05:24:33 BasicIcfg [2024-06-27 17:24:33,422 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-27 17:24:33,422 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-06-27 17:24:33,422 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-06-27 17:24:33,423 INFO L274 PluginConnector]: Witness Printer initialized [2024-06-27 17:24:33,423 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:22:16" (3/4) ... [2024-06-27 17:24:33,423 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2024-06-27 17:24:33,479 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-06-27 17:24:33,480 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-06-27 17:24:33,480 INFO L158 Benchmark]: Toolchain (without parser) took 138528.43ms. Allocated memory was 132.1MB in the beginning and 950.0MB in the end (delta: 817.9MB). Free memory was 58.0MB in the beginning and 801.2MB in the end (delta: -743.2MB). Peak memory consumption was 77.6MB. Max. memory is 16.1GB. [2024-06-27 17:24:33,480 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 132.1MB. Free memory is still 84.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 17:24:33,483 INFO L158 Benchmark]: CACSL2BoogieTranslator took 593.76ms. Allocated memory was 132.1MB in the beginning and 178.3MB in the end (delta: 46.1MB). Free memory was 57.9MB in the beginning and 126.5MB in the end (delta: -68.7MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. [2024-06-27 17:24:33,483 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.95ms. Allocated memory is still 178.3MB. Free memory was 126.5MB in the beginning and 123.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 17:24:33,483 INFO L158 Benchmark]: Boogie Preprocessor took 55.68ms. Allocated memory is still 178.3MB. Free memory was 123.4MB in the beginning and 120.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-27 17:24:33,483 INFO L158 Benchmark]: RCFGBuilder took 808.44ms. Allocated memory is still 178.3MB. Free memory was 120.3MB in the beginning and 141.1MB in the end (delta: -20.8MB). Peak memory consumption was 74.6MB. Max. memory is 16.1GB. [2024-06-27 17:24:33,484 INFO L158 Benchmark]: TraceAbstraction took 136969.08ms. Allocated memory was 178.3MB in the beginning and 950.0MB in the end (delta: 771.8MB). Free memory was 141.1MB in the beginning and 812.7MB in the end (delta: -671.6MB). Peak memory consumption was 184.0MB. Max. memory is 16.1GB. [2024-06-27 17:24:33,488 INFO L158 Benchmark]: Witness Printer took 57.24ms. Allocated memory is still 950.0MB. Free memory was 812.7MB in the beginning and 801.2MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-06-27 17:24:33,489 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.21ms. Allocated memory is still 132.1MB. Free memory is still 84.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 593.76ms. Allocated memory was 132.1MB in the beginning and 178.3MB in the end (delta: 46.1MB). Free memory was 57.9MB in the beginning and 126.5MB in the end (delta: -68.7MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.95ms. Allocated memory is still 178.3MB. Free memory was 126.5MB in the beginning and 123.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.68ms. Allocated memory is still 178.3MB. Free memory was 123.4MB in the beginning and 120.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 808.44ms. Allocated memory is still 178.3MB. Free memory was 120.3MB in the beginning and 141.1MB in the end (delta: -20.8MB). Peak memory consumption was 74.6MB. Max. memory is 16.1GB. * TraceAbstraction took 136969.08ms. Allocated memory was 178.3MB in the beginning and 950.0MB in the end (delta: 771.8MB). Free memory was 141.1MB in the beginning and 812.7MB in the end (delta: -671.6MB). Peak memory consumption was 184.0MB. Max. memory is 16.1GB. * Witness Printer took 57.24ms. Allocated memory is still 950.0MB. Free memory was 812.7MB in the beginning and 801.2MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1043]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L950] 0 _Bool enqueue_flag, dequeue_flag; [L951] 0 QType queue; [L951] 0 QType queue; [L1054] 0 pthread_t id1, id2; [L1055] 0 enqueue_flag=(1) [L1056] 0 dequeue_flag=(0) [L1057] CALL 0 init(&queue) [L954] 0 q->head=0 [L955] 0 q->tail=0 [L956] 0 q->amount=0 [L1057] RET 0 init(&queue) [L1058] CALL, EXPR 0 empty(&queue) [L960] EXPR 0 q->head [L960] EXPR 0 q->tail [L960] COND TRUE 0 q->head == q->tail [L963] 0 return (-1); [L1058] RET, EXPR 0 empty(&queue) [L1058] COND FALSE 0 !(!empty(&queue)==(-1)) [L1062] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, &queue) VAL [dequeue_flag=0, enqueue_flag=1, id1=-2, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1007] 1 int value, i; VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1063] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, &queue) VAL [dequeue_flag=0, enqueue_flag=1, id1=-2, id2=-1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1036] 2 int i; [L1037] 2 i=0 VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1009] 1 value = __VERIFIER_nondet_int() [L1010] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail [L980] 1 q->element[q->tail] = x [L981] EXPR 1 q->amount [L981] 1 q->amount++ [L981] 1 q->amount++ [L982] EXPR 1 q->tail [L982] COND FALSE 1 !(q->tail == (800)) [L988] EXPR 1 q->tail [L988] 1 q->tail++ [L988] 1 q->tail++ [L990] 1 return 0; [L1010] RET 1 enqueue(&queue,value) [L1010] COND FALSE 1 !(enqueue(&queue,value)) [L1013] 1 stored_elements[0]=value [L1014] CALL 1 empty(&queue) [L960] EXPR 1 q->head [L960] EXPR 1 q->tail [L960] COND FALSE 1 !(q->head == q->tail) [L966] 1 return 0; [L1014] RET 1 empty(&queue) [L1014] COND FALSE 1 !(empty(&queue)) [L1037] COND TRUE 2 i<(800) VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1040] COND FALSE 2 !(\read(dequeue_flag)) VAL [dequeue_flag=0, enqueue_flag=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1037] 2 i++ VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1018] 1 i=0 VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}, value=0] [L1018] COND TRUE 1 i<((800)-1) VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}, value=0] [L1021] COND TRUE 1 \read(enqueue_flag) [L1023] 1 value = __VERIFIER_nondet_int() [L1024] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail [L980] 1 q->element[q->tail] = x [L981] EXPR 1 q->amount [L981] 1 q->amount++ [L981] 1 q->amount++ [L982] EXPR 1 q->tail [L982] COND FALSE 1 !(q->tail == (800)) [L988] EXPR 1 q->tail [L988] 1 q->tail++ [L988] 1 q->tail++ [L990] 1 return 0; [L1024] RET 1 enqueue(&queue,value) [L1025] 1 stored_elements[i+1]=value [L1026] 1 enqueue_flag=(0) [L1027] 1 dequeue_flag=(1) VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=1, enqueue_flag=0, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}, value=1] [L1037] COND TRUE 2 i<(800) VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=1, enqueue_flag=0, i=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1040] COND TRUE 2 \read(dequeue_flag) [L1042] CALL, EXPR 2 dequeue(&queue) [L994] 2 int x; [L995] EXPR 2 q->head [L995] EXPR 2 q->element[q->head] [L995] 2 x = q->element[q->head] [L996] EXPR 2 q->amount [L996] 2 q->amount-- [L996] 2 q->amount-- [L997] EXPR 2 q->head [L997] COND FALSE 2 !(q->head == (800)) [L1002] EXPR 2 q->head [L1002] 2 q->head++ [L1002] 2 q->head++ [L1003] 2 return x; [L1042] RET, EXPR 2 dequeue(&queue) [L1042] EXPR 2 stored_elements[i] VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=1, enqueue_flag=0, i=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1042] COND TRUE 2 !dequeue(&queue)==stored_elements[i] [L1043] 2 reach_error() VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=1, enqueue_flag=0, i=1, m={3:0}, queue={5:0}, stored_elements={4:0}] - UnprovableResult [Line: 1059]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 71 locations, 7 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: 136.8s, OverallIterations: 16, TraceHistogramMax: 2, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 61.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 1856 SdHoareTripleChecker+Valid, 50.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1814 mSDsluCounter, 1374 SdHoareTripleChecker+Invalid, 48.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1335 mSDsCounter, 136 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9302 IncrementalHoareTripleChecker+Invalid, 9442 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 136 mSolverCounterUnsat, 39 mSDtfsCounter, 9302 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 455 GetRequests, 199 SyntacticMatches, 12 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2260 ImplicationChecksByTransitivity, 46.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2901occurred in iteration=15, InterpolantAutomatonStates: 156, 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.7s SatisfiabilityAnalysisTime, 72.4s InterpolantComputationTime, 498 NumberOfCodeBlocks, 498 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 588 ConstructedInterpolants, 113 QuantifiedInterpolants, 120855 SizeOfPredicates, 221 NumberOfNonLiveVariables, 1270 ConjunctsInSsa, 189 ConjunctsInUnsatCore, 25 InterpolantComputations, 10 PerfectInterpolantSequences, 0/60 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-06-27 17:24:33,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE