./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/mult-comm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a340643f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/mult-comm.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash de93f11842753a9f5cde98724d1851736862f745073786263bfd177abe6c2376 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a340643-m [2024-01-27 15:29:17,007 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 15:29:17,059 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 15:29:17,062 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 15:29:17,062 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 15:29:17,076 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 15:29:17,076 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 15:29:17,077 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 15:29:17,077 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 15:29:17,077 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 15:29:17,078 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 15:29:17,078 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 15:29:17,078 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 15:29:17,079 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 15:29:17,079 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 15:29:17,079 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 15:29:17,080 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 15:29:17,080 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 15:29:17,096 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 15:29:17,096 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 15:29:17,097 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 15:29:17,097 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 15:29:17,097 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 15:29:17,097 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 15:29:17,098 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 15:29:17,098 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 15:29:17,098 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 15:29:17,098 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 15:29:17,098 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 15:29:17,098 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 15:29:17,099 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 15:29:17,099 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 15:29:17,099 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 15:29:17,099 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 15:29:17,099 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 15:29:17,099 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 15:29:17,100 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 15:29:17,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 15:29:17,100 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 15:29:17,100 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 15:29:17,100 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 15:29:17,101 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 15:29:17,101 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 15:29:17,101 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 -> de93f11842753a9f5cde98724d1851736862f745073786263bfd177abe6c2376 [2024-01-27 15:29:17,284 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 15:29:17,301 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 15:29:17,304 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 15:29:17,305 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 15:29:17,305 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 15:29:17,306 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/mult-comm.wvr.c [2024-01-27 15:29:18,373 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 15:29:18,557 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 15:29:18,558 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/mult-comm.wvr.c [2024-01-27 15:29:18,565 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d12f9e897/4d5a31c457a34143a9a01929b0d01493/FLAG47a13e788 [2024-01-27 15:29:18,579 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d12f9e897/4d5a31c457a34143a9a01929b0d01493 [2024-01-27 15:29:18,581 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 15:29:18,582 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-01-27 15:29:18,583 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 15:29:18,584 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 15:29:18,587 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 15:29:18,587 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 03:29:18" (1/1) ... [2024-01-27 15:29:18,589 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f77fc8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:29:18, skipping insertion in model container [2024-01-27 15:29:18,590 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 03:29:18" (1/1) ... [2024-01-27 15:29:18,606 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 15:29:18,747 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/mult-comm.wvr.c[1936,1949] [2024-01-27 15:29:18,750 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:29:18,756 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 15:29:18,770 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/mult-comm.wvr.c[1936,1949] [2024-01-27 15:29:18,771 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:29:18,782 INFO L206 MainTranslator]: Completed translation [2024-01-27 15:29:18,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:29:18 WrapperNode [2024-01-27 15:29:18,783 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 15:29:18,784 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 15:29:18,784 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 15:29:18,784 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 15:29:18,788 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:29:18" (1/1) ... [2024-01-27 15:29:18,794 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:29:18" (1/1) ... [2024-01-27 15:29:18,807 INFO L138 Inliner]: procedures = 21, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 53 [2024-01-27 15:29:18,807 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 15:29:18,808 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 15:29:18,808 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 15:29:18,808 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 15:29:18,815 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:29:18" (1/1) ... [2024-01-27 15:29:18,816 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:29:18" (1/1) ... [2024-01-27 15:29:18,817 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:29:18" (1/1) ... [2024-01-27 15:29:18,826 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 2, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-01-27 15:29:18,826 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:29:18" (1/1) ... [2024-01-27 15:29:18,826 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:29:18" (1/1) ... [2024-01-27 15:29:18,829 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:29:18" (1/1) ... [2024-01-27 15:29:18,831 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:29:18" (1/1) ... [2024-01-27 15:29:18,832 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:29:18" (1/1) ... [2024-01-27 15:29:18,833 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:29:18" (1/1) ... [2024-01-27 15:29:18,834 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 15:29:18,835 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 15:29:18,835 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 15:29:18,835 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 15:29:18,835 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:29:18" (1/1) ... [2024-01-27 15:29:18,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 15:29:18,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:29:18,861 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-27 15:29:18,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-27 15:29:18,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 15:29:18,898 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-27 15:29:18,898 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-27 15:29:18,898 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-27 15:29:18,899 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-27 15:29:18,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 15:29:18,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 15:29:18,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 15:29:18,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 15:29:18,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 15:29:18,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 15:29:18,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 15:29:18,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 15:29:18,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 15:29:18,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-27 15:29:18,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-27 15:29:18,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-27 15:29:18,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 15:29:18,902 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-27 15:29:18,973 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 15:29:18,975 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 15:29:19,165 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 15:29:19,165 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 15:29:19,265 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 15:29:19,265 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-01-27 15:29:19,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:29:19 BoogieIcfgContainer [2024-01-27 15:29:19,266 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 15:29:19,267 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 15:29:19,268 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 15:29:19,270 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 15:29:19,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 03:29:18" (1/3) ... [2024-01-27 15:29:19,270 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@245d5a01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 03:29:19, skipping insertion in model container [2024-01-27 15:29:19,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:29:18" (2/3) ... [2024-01-27 15:29:19,271 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@245d5a01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 03:29:19, skipping insertion in model container [2024-01-27 15:29:19,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:29:19" (3/3) ... [2024-01-27 15:29:19,272 INFO L112 eAbstractionObserver]: Analyzing ICFG mult-comm.wvr.c [2024-01-27 15:29:19,277 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-27 15:29:19,284 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 15:29:19,284 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-27 15:29:19,284 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 15:29:19,327 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-27 15:29:19,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 19 transitions, 52 flow [2024-01-27 15:29:19,398 INFO L124 PetriNetUnfolderBase]: 2/17 cut-off events. [2024-01-27 15:29:19,401 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-27 15:29:19,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 17 events. 2/17 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 9 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2024-01-27 15:29:19,404 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 19 transitions, 52 flow [2024-01-27 15:29:19,408 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 21 places, 16 transitions, 44 flow [2024-01-27 15:29:19,417 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 15:29:19,422 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;@229c2c1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 15:29:19,422 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-01-27 15:29:19,427 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 15:29:19,430 INFO L124 PetriNetUnfolderBase]: 2/15 cut-off events. [2024-01-27 15:29:19,430 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-27 15:29:19,430 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:29:19,431 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:29:19,431 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:29:19,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:29:19,435 INFO L85 PathProgramCache]: Analyzing trace with hash -416623653, now seen corresponding path program 1 times [2024-01-27 15:29:19,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:29:19,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761438691] [2024-01-27 15:29:19,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:29:19,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:29:19,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:29:19,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:29:19,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:29:19,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761438691] [2024-01-27 15:29:19,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761438691] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:29:19,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:29:19,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 15:29:19,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57900981] [2024-01-27 15:29:19,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:29:19,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:29:19,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:29:19,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:29:19,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:29:19,936 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2024-01-27 15:29:19,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 16 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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-01-27 15:29:19,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:29:19,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2024-01-27 15:29:19,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:29:20,016 INFO L124 PetriNetUnfolderBase]: 74/135 cut-off events. [2024-01-27 15:29:20,016 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-01-27 15:29:20,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 293 conditions, 135 events. 74/135 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 358 event pairs, 24 based on Foata normal form. 1/104 useless extension candidates. Maximal degree in co-relation 220. Up to 79 conditions per place. [2024-01-27 15:29:20,021 INFO L140 encePairwiseOnDemand]: 15/19 looper letters, 23 selfloop transitions, 3 changer transitions 1/28 dead transitions. [2024-01-27 15:29:20,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 28 transitions, 131 flow [2024-01-27 15:29:20,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:29:20,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:29:20,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2024-01-27 15:29:20,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6491228070175439 [2024-01-27 15:29:20,032 INFO L175 Difference]: Start difference. First operand has 21 places, 16 transitions, 44 flow. Second operand 3 states and 37 transitions. [2024-01-27 15:29:20,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 28 transitions, 131 flow [2024-01-27 15:29:20,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 28 transitions, 117 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-27 15:29:20,037 INFO L231 Difference]: Finished difference. Result has 20 places, 18 transitions, 55 flow [2024-01-27 15:29:20,038 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=55, PETRI_PLACES=20, PETRI_TRANSITIONS=18} [2024-01-27 15:29:20,041 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2024-01-27 15:29:20,041 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 18 transitions, 55 flow [2024-01-27 15:29:20,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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-01-27 15:29:20,041 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:29:20,041 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:29:20,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 15:29:20,042 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:29:20,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:29:20,043 INFO L85 PathProgramCache]: Analyzing trace with hash 287926024, now seen corresponding path program 1 times [2024-01-27 15:29:20,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:29:20,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701750671] [2024-01-27 15:29:20,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:29:20,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:29:20,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:29:20,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:29:20,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:29:20,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701750671] [2024-01-27 15:29:20,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701750671] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:29:20,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162314758] [2024-01-27 15:29:20,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:29:20,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:29:20,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:29:20,270 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:29:20,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-01-27 15:29:20,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:29:20,337 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 10 conjunts are in the unsatisfiable core [2024-01-27 15:29:20,342 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:29:20,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:29:20,463 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:29:20,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:29:20,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162314758] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:29:20,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:29:20,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 8 [2024-01-27 15:29:20,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173756067] [2024-01-27 15:29:20,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:29:20,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-01-27 15:29:20,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:29:20,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-01-27 15:29:20,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-01-27 15:29:20,645 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2024-01-27 15:29:20,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 18 transitions, 55 flow. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:29:20,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:29:20,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2024-01-27 15:29:20,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:29:20,778 INFO L124 PetriNetUnfolderBase]: 76/144 cut-off events. [2024-01-27 15:29:20,778 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-01-27 15:29:20,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 349 conditions, 144 events. 76/144 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 405 event pairs, 6 based on Foata normal form. 1/145 useless extension candidates. Maximal degree in co-relation 114. Up to 77 conditions per place. [2024-01-27 15:29:20,781 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 26 selfloop transitions, 5 changer transitions 14/46 dead transitions. [2024-01-27 15:29:20,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 46 transitions, 216 flow [2024-01-27 15:29:20,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 15:29:20,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 15:29:20,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2024-01-27 15:29:20,784 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5614035087719298 [2024-01-27 15:29:20,786 INFO L175 Difference]: Start difference. First operand has 20 places, 18 transitions, 55 flow. Second operand 6 states and 64 transitions. [2024-01-27 15:29:20,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 46 transitions, 216 flow [2024-01-27 15:29:20,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 46 transitions, 211 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 15:29:20,789 INFO L231 Difference]: Finished difference. Result has 27 places, 20 transitions, 80 flow [2024-01-27 15:29:20,789 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=80, PETRI_PLACES=27, PETRI_TRANSITIONS=20} [2024-01-27 15:29:20,790 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 6 predicate places. [2024-01-27 15:29:20,790 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 20 transitions, 80 flow [2024-01-27 15:29:20,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:29:20,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:29:20,794 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:29:20,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-01-27 15:29:21,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:29:21,006 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:29:21,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:29:21,007 INFO L85 PathProgramCache]: Analyzing trace with hash 297668209, now seen corresponding path program 1 times [2024-01-27 15:29:21,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:29:21,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124475648] [2024-01-27 15:29:21,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:29:21,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:29:21,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:29:21,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:29:21,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:29:21,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124475648] [2024-01-27 15:29:21,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124475648] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:29:21,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323316173] [2024-01-27 15:29:21,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:29:21,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:29:21,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:29:21,134 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:29:21,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-01-27 15:29:21,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:29:21,192 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 10 conjunts are in the unsatisfiable core [2024-01-27 15:29:21,193 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:29:21,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:29:21,256 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:29:21,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:29:21,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323316173] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:29:21,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:29:21,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 8 [2024-01-27 15:29:21,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192033227] [2024-01-27 15:29:21,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:29:21,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-01-27 15:29:21,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:29:21,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-01-27 15:29:21,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-01-27 15:29:21,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2024-01-27 15:29:21,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 20 transitions, 80 flow. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:29:21,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:29:21,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2024-01-27 15:29:21,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:29:21,448 INFO L124 PetriNetUnfolderBase]: 69/130 cut-off events. [2024-01-27 15:29:21,448 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2024-01-27 15:29:21,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 372 conditions, 130 events. 69/130 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 354 event pairs, 9 based on Foata normal form. 1/131 useless extension candidates. Maximal degree in co-relation 360. Up to 73 conditions per place. [2024-01-27 15:29:21,449 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 22 selfloop transitions, 6 changer transitions 14/43 dead transitions. [2024-01-27 15:29:21,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 43 transitions, 238 flow [2024-01-27 15:29:21,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 15:29:21,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 15:29:21,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2024-01-27 15:29:21,450 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2024-01-27 15:29:21,450 INFO L175 Difference]: Start difference. First operand has 27 places, 20 transitions, 80 flow. Second operand 6 states and 60 transitions. [2024-01-27 15:29:21,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 43 transitions, 238 flow [2024-01-27 15:29:21,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 43 transitions, 216 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-01-27 15:29:21,452 INFO L231 Difference]: Finished difference. Result has 30 places, 22 transitions, 96 flow [2024-01-27 15:29:21,452 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=96, PETRI_PLACES=30, PETRI_TRANSITIONS=22} [2024-01-27 15:29:21,452 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 9 predicate places. [2024-01-27 15:29:21,453 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 22 transitions, 96 flow [2024-01-27 15:29:21,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:29:21,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:29:21,453 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:29:21,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-01-27 15:29:21,667 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,SelfDestructingSolverStorable2 [2024-01-27 15:29:21,667 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:29:21,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:29:21,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1170675074, now seen corresponding path program 2 times [2024-01-27 15:29:21,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:29:21,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091194177] [2024-01-27 15:29:21,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:29:21,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:29:21,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:29:21,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:29:21,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:29:21,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091194177] [2024-01-27 15:29:21,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091194177] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:29:21,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866795472] [2024-01-27 15:29:21,810 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 15:29:21,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:29:21,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:29:21,825 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:29:21,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-01-27 15:29:21,882 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 15:29:21,882 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:29:21,883 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 10 conjunts are in the unsatisfiable core [2024-01-27 15:29:21,884 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:29:21,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:29:21,937 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:29:21,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:29:21,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866795472] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:29:21,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:29:21,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 10 [2024-01-27 15:29:21,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191244388] [2024-01-27 15:29:21,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:29:22,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-01-27 15:29:22,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:29:22,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-01-27 15:29:22,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-01-27 15:29:22,001 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2024-01-27 15:29:22,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 22 transitions, 96 flow. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:29:22,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:29:22,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2024-01-27 15:29:22,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:29:22,135 INFO L124 PetriNetUnfolderBase]: 113/213 cut-off events. [2024-01-27 15:29:22,135 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2024-01-27 15:29:22,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 620 conditions, 213 events. 113/213 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 671 event pairs, 15 based on Foata normal form. 3/216 useless extension candidates. Maximal degree in co-relation 603. Up to 92 conditions per place. [2024-01-27 15:29:22,137 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 38 selfloop transitions, 18 changer transitions 12/69 dead transitions. [2024-01-27 15:29:22,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 69 transitions, 378 flow [2024-01-27 15:29:22,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-01-27 15:29:22,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-01-27 15:29:22,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 99 transitions. [2024-01-27 15:29:22,139 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5210526315789473 [2024-01-27 15:29:22,139 INFO L175 Difference]: Start difference. First operand has 30 places, 22 transitions, 96 flow. Second operand 10 states and 99 transitions. [2024-01-27 15:29:22,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 69 transitions, 378 flow [2024-01-27 15:29:22,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 69 transitions, 365 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-01-27 15:29:22,141 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 198 flow [2024-01-27 15:29:22,141 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=198, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2024-01-27 15:29:22,141 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 19 predicate places. [2024-01-27 15:29:22,142 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 198 flow [2024-01-27 15:29:22,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:29:22,142 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:29:22,142 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:29:22,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-01-27 15:29:22,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:29:22,354 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:29:22,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:29:22,354 INFO L85 PathProgramCache]: Analyzing trace with hash -217609744, now seen corresponding path program 3 times [2024-01-27 15:29:22,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:29:22,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386605135] [2024-01-27 15:29:22,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:29:22,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:29:22,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:29:22,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:29:22,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:29:22,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386605135] [2024-01-27 15:29:22,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386605135] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:29:22,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388618643] [2024-01-27 15:29:22,470 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-27 15:29:22,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:29:22,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:29:22,472 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:29:22,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-01-27 15:29:22,551 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-01-27 15:29:22,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:29:22,552 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 10 conjunts are in the unsatisfiable core [2024-01-27 15:29:22,554 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:29:22,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:29:22,609 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:29:22,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:29:22,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388618643] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:29:22,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:29:22,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 9 [2024-01-27 15:29:22,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499567795] [2024-01-27 15:29:22,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:29:22,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-01-27 15:29:22,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:29:22,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-01-27 15:29:22,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-01-27 15:29:22,742 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2024-01-27 15:29:22,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 198 flow. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:29:22,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:29:22,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2024-01-27 15:29:22,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:29:22,849 INFO L124 PetriNetUnfolderBase]: 129/240 cut-off events. [2024-01-27 15:29:22,849 INFO L125 PetriNetUnfolderBase]: For 340/340 co-relation queries the response was YES. [2024-01-27 15:29:22,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 855 conditions, 240 events. 129/240 cut-off events. For 340/340 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 789 event pairs, 23 based on Foata normal form. 2/240 useless extension candidates. Maximal degree in co-relation 800. Up to 178 conditions per place. [2024-01-27 15:29:22,851 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 41 selfloop transitions, 14 changer transitions 8/64 dead transitions. [2024-01-27 15:29:22,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 64 transitions, 435 flow [2024-01-27 15:29:22,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-27 15:29:22,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-27 15:29:22,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 77 transitions. [2024-01-27 15:29:22,853 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.506578947368421 [2024-01-27 15:29:22,853 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 198 flow. Second operand 8 states and 77 transitions. [2024-01-27 15:29:22,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 64 transitions, 435 flow [2024-01-27 15:29:22,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 64 transitions, 377 flow, removed 22 selfloop flow, removed 4 redundant places. [2024-01-27 15:29:22,858 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 234 flow [2024-01-27 15:29:22,858 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=234, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2024-01-27 15:29:22,860 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 25 predicate places. [2024-01-27 15:29:22,860 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 234 flow [2024-01-27 15:29:22,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:29:22,861 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:29:22,861 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:29:22,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-01-27 15:29:23,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:29:23,072 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:29:23,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:29:23,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1438194123, now seen corresponding path program 2 times [2024-01-27 15:29:23,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:29:23,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119655433] [2024-01-27 15:29:23,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:29:23,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:29:23,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:29:23,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:29:23,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:29:23,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119655433] [2024-01-27 15:29:23,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119655433] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:29:23,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413606186] [2024-01-27 15:29:23,228 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 15:29:23,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:29:23,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:29:23,237 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:29:23,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-01-27 15:29:23,298 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 15:29:23,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:29:23,299 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 14 conjunts are in the unsatisfiable core [2024-01-27 15:29:23,300 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:29:23,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:29:23,388 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:29:23,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:29:23,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413606186] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:29:23,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:29:23,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 5] total 12 [2024-01-27 15:29:23,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987072138] [2024-01-27 15:29:23,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:29:23,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-01-27 15:29:23,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:29:23,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-01-27 15:29:23,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-01-27 15:29:23,532 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2024-01-27 15:29:23,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 234 flow. Second operand has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:29:23,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:29:23,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2024-01-27 15:29:23,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:29:23,689 INFO L124 PetriNetUnfolderBase]: 164/303 cut-off events. [2024-01-27 15:29:23,690 INFO L125 PetriNetUnfolderBase]: For 551/551 co-relation queries the response was YES. [2024-01-27 15:29:23,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1068 conditions, 303 events. 164/303 cut-off events. For 551/551 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1099 event pairs, 31 based on Foata normal form. 2/301 useless extension candidates. Maximal degree in co-relation 1014. Up to 238 conditions per place. [2024-01-27 15:29:23,691 INFO L140 encePairwiseOnDemand]: 12/19 looper letters, 51 selfloop transitions, 17 changer transitions 4/73 dead transitions. [2024-01-27 15:29:23,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 73 transitions, 523 flow [2024-01-27 15:29:23,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-27 15:29:23,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-01-27 15:29:23,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 81 transitions. [2024-01-27 15:29:23,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2024-01-27 15:29:23,693 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 234 flow. Second operand 9 states and 81 transitions. [2024-01-27 15:29:23,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 73 transitions, 523 flow [2024-01-27 15:29:23,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 73 transitions, 473 flow, removed 16 selfloop flow, removed 3 redundant places. [2024-01-27 15:29:23,695 INFO L231 Difference]: Finished difference. Result has 54 places, 52 transitions, 312 flow [2024-01-27 15:29:23,696 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=312, PETRI_PLACES=54, PETRI_TRANSITIONS=52} [2024-01-27 15:29:23,696 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 33 predicate places. [2024-01-27 15:29:23,696 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 52 transitions, 312 flow [2024-01-27 15:29:23,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:29:23,696 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:29:23,697 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:29:23,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-01-27 15:29:23,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:29:23,908 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:29:23,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:29:23,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1726562699, now seen corresponding path program 3 times [2024-01-27 15:29:23,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:29:23,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869121140] [2024-01-27 15:29:23,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:29:23,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:29:23,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:29:24,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:29:24,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:29:24,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869121140] [2024-01-27 15:29:24,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869121140] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:29:24,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51002231] [2024-01-27 15:29:24,055 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-27 15:29:24,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:29:24,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:29:24,070 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:29:24,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-01-27 15:29:24,131 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-01-27 15:29:24,132 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:29:24,132 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 14 conjunts are in the unsatisfiable core [2024-01-27 15:29:24,133 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:29:24,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:29:24,217 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:29:24,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:29:24,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51002231] provided 1 perfect and 1 imperfect interpolant sequences [2024-01-27 15:29:24,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-01-27 15:29:24,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 7] total 13 [2024-01-27 15:29:24,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557259294] [2024-01-27 15:29:24,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:29:24,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 15:29:24,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:29:24,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 15:29:24,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2024-01-27 15:29:24,296 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2024-01-27 15:29:24,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 52 transitions, 312 flow. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:29:24,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:29:24,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2024-01-27 15:29:24,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:29:24,354 INFO L124 PetriNetUnfolderBase]: 180/332 cut-off events. [2024-01-27 15:29:24,354 INFO L125 PetriNetUnfolderBase]: For 558/558 co-relation queries the response was YES. [2024-01-27 15:29:24,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1211 conditions, 332 events. 180/332 cut-off events. For 558/558 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1233 event pairs, 48 based on Foata normal form. 1/329 useless extension candidates. Maximal degree in co-relation 1150. Up to 287 conditions per place. [2024-01-27 15:29:24,356 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 50 selfloop transitions, 12 changer transitions 2/65 dead transitions. [2024-01-27 15:29:24,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 65 transitions, 503 flow [2024-01-27 15:29:24,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:29:24,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:29:24,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2024-01-27 15:29:24,357 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49473684210526314 [2024-01-27 15:29:24,357 INFO L175 Difference]: Start difference. First operand has 54 places, 52 transitions, 312 flow. Second operand 5 states and 47 transitions. [2024-01-27 15:29:24,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 65 transitions, 503 flow [2024-01-27 15:29:24,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 65 transitions, 456 flow, removed 16 selfloop flow, removed 3 redundant places. [2024-01-27 15:29:24,360 INFO L231 Difference]: Finished difference. Result has 57 places, 56 transitions, 340 flow [2024-01-27 15:29:24,360 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=340, PETRI_PLACES=57, PETRI_TRANSITIONS=56} [2024-01-27 15:29:24,361 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 36 predicate places. [2024-01-27 15:29:24,361 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 56 transitions, 340 flow [2024-01-27 15:29:24,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:29:24,361 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:29:24,361 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:29:24,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-01-27 15:29:24,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:29:24,572 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:29:24,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:29:24,573 INFO L85 PathProgramCache]: Analyzing trace with hash 347374822, now seen corresponding path program 1 times [2024-01-27 15:29:24,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:29:24,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098071834] [2024-01-27 15:29:24,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:29:24,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:29:24,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:29:24,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:29:24,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:29:24,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098071834] [2024-01-27 15:29:24,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098071834] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:29:24,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460324169] [2024-01-27 15:29:24,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:29:24,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:29:24,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:29:24,867 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:29:24,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-01-27 15:29:24,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:29:24,946 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 21 conjunts are in the unsatisfiable core [2024-01-27 15:29:24,947 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:29:25,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:29:25,287 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:29:25,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:29:25,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460324169] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:29:25,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:29:25,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 17 [2024-01-27 15:29:25,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742916255] [2024-01-27 15:29:25,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:29:25,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-01-27 15:29:25,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:29:25,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-01-27 15:29:25,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2024-01-27 15:29:25,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2024-01-27 15:29:25,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 56 transitions, 340 flow. Second operand has 18 states, 18 states have (on average 4.944444444444445) internal successors, (89), 18 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:29:25,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:29:25,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2024-01-27 15:29:25,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:29:30,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:29:34,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:29:35,029 INFO L124 PetriNetUnfolderBase]: 267/512 cut-off events. [2024-01-27 15:29:35,029 INFO L125 PetriNetUnfolderBase]: For 861/861 co-relation queries the response was YES. [2024-01-27 15:29:35,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1854 conditions, 512 events. 267/512 cut-off events. For 861/861 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2328 event pairs, 23 based on Foata normal form. 3/511 useless extension candidates. Maximal degree in co-relation 1752. Up to 220 conditions per place. [2024-01-27 15:29:35,032 INFO L140 encePairwiseOnDemand]: 11/19 looper letters, 86 selfloop transitions, 51 changer transitions 35/173 dead transitions. [2024-01-27 15:29:35,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 173 transitions, 1160 flow [2024-01-27 15:29:35,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-01-27 15:29:35,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2024-01-27 15:29:35,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 214 transitions. [2024-01-27 15:29:35,033 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4692982456140351 [2024-01-27 15:29:35,034 INFO L175 Difference]: Start difference. First operand has 57 places, 56 transitions, 340 flow. Second operand 24 states and 214 transitions. [2024-01-27 15:29:35,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 173 transitions, 1160 flow [2024-01-27 15:29:35,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 173 transitions, 1138 flow, removed 9 selfloop flow, removed 2 redundant places. [2024-01-27 15:29:35,051 INFO L231 Difference]: Finished difference. Result has 88 places, 83 transitions, 635 flow [2024-01-27 15:29:35,051 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=635, PETRI_PLACES=88, PETRI_TRANSITIONS=83} [2024-01-27 15:29:35,052 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 67 predicate places. [2024-01-27 15:29:35,052 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 83 transitions, 635 flow [2024-01-27 15:29:35,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.944444444444445) internal successors, (89), 18 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:29:35,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:29:35,068 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:29:35,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-01-27 15:29:35,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:29:35,269 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:29:35,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:29:35,269 INFO L85 PathProgramCache]: Analyzing trace with hash -919466126, now seen corresponding path program 2 times [2024-01-27 15:29:35,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:29:35,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381278059] [2024-01-27 15:29:35,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:29:35,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:29:35,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:29:35,656 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:29:35,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:29:35,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381278059] [2024-01-27 15:29:35,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381278059] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:29:35,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306885634] [2024-01-27 15:29:35,658 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 15:29:35,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:29:35,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:29:35,659 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:29:35,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-01-27 15:29:35,752 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 15:29:35,752 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:29:35,753 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 21 conjunts are in the unsatisfiable core [2024-01-27 15:29:35,754 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:29:35,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:29:35,960 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:29:36,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:29:36,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306885634] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:29:36,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:29:36,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 18 [2024-01-27 15:29:36,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567941121] [2024-01-27 15:29:36,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:29:36,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-01-27 15:29:36,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:29:36,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-01-27 15:29:36,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2024-01-27 15:29:36,286 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2024-01-27 15:29:36,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 83 transitions, 635 flow. Second operand has 19 states, 19 states have (on average 4.842105263157895) internal successors, (92), 19 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:29:36,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:29:36,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2024-01-27 15:29:36,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:29:37,447 INFO L124 PetriNetUnfolderBase]: 304/617 cut-off events. [2024-01-27 15:29:37,447 INFO L125 PetriNetUnfolderBase]: For 3130/3130 co-relation queries the response was YES. [2024-01-27 15:29:37,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2899 conditions, 617 events. 304/617 cut-off events. For 3130/3130 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3116 event pairs, 19 based on Foata normal form. 3/616 useless extension candidates. Maximal degree in co-relation 2759. Up to 224 conditions per place. [2024-01-27 15:29:37,454 INFO L140 encePairwiseOnDemand]: 11/19 looper letters, 99 selfloop transitions, 80 changer transitions 22/202 dead transitions. [2024-01-27 15:29:37,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 202 transitions, 1811 flow [2024-01-27 15:29:37,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-01-27 15:29:37,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2024-01-27 15:29:37,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 256 transitions. [2024-01-27 15:29:37,457 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44912280701754387 [2024-01-27 15:29:37,457 INFO L175 Difference]: Start difference. First operand has 88 places, 83 transitions, 635 flow. Second operand 30 states and 256 transitions. [2024-01-27 15:29:37,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 202 transitions, 1811 flow [2024-01-27 15:29:37,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 202 transitions, 1590 flow, removed 91 selfloop flow, removed 12 redundant places. [2024-01-27 15:29:37,474 INFO L231 Difference]: Finished difference. Result has 107 places, 114 transitions, 1051 flow [2024-01-27 15:29:37,474 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1051, PETRI_PLACES=107, PETRI_TRANSITIONS=114} [2024-01-27 15:29:37,475 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 86 predicate places. [2024-01-27 15:29:37,475 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 114 transitions, 1051 flow [2024-01-27 15:29:37,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.842105263157895) internal successors, (92), 19 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:29:37,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:29:37,476 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:29:37,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-01-27 15:29:37,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-01-27 15:29:37,693 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:29:37,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:29:37,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1657157464, now seen corresponding path program 3 times [2024-01-27 15:29:37,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:29:37,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703917310] [2024-01-27 15:29:37,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:29:37,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:29:37,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:29:38,089 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:29:38,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:29:38,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703917310] [2024-01-27 15:29:38,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703917310] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:29:38,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165405918] [2024-01-27 15:29:38,090 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-27 15:29:38,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:29:38,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:29:38,091 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:29:38,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-01-27 15:29:38,194 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-01-27 15:29:38,194 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:29:38,195 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 21 conjunts are in the unsatisfiable core [2024-01-27 15:29:38,196 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:29:38,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:29:38,417 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:29:38,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:29:38,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165405918] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:29:38,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:29:38,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 18 [2024-01-27 15:29:38,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357316829] [2024-01-27 15:29:38,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:29:38,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-01-27 15:29:38,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:29:38,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-01-27 15:29:38,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2024-01-27 15:29:38,798 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2024-01-27 15:29:38,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 114 transitions, 1051 flow. Second operand has 19 states, 19 states have (on average 4.842105263157895) internal successors, (92), 19 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:29:38,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:29:38,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2024-01-27 15:29:38,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:29:39,890 INFO L124 PetriNetUnfolderBase]: 291/577 cut-off events. [2024-01-27 15:29:39,890 INFO L125 PetriNetUnfolderBase]: For 2415/2415 co-relation queries the response was YES. [2024-01-27 15:29:39,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2781 conditions, 577 events. 291/577 cut-off events. For 2415/2415 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2800 event pairs, 19 based on Foata normal form. 3/570 useless extension candidates. Maximal degree in co-relation 2675. Up to 228 conditions per place. [2024-01-27 15:29:39,893 INFO L140 encePairwiseOnDemand]: 11/19 looper letters, 85 selfloop transitions, 81 changer transitions 17/184 dead transitions. [2024-01-27 15:29:39,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 184 transitions, 1687 flow [2024-01-27 15:29:39,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-01-27 15:29:39,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2024-01-27 15:29:39,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 214 transitions. [2024-01-27 15:29:39,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45052631578947366 [2024-01-27 15:29:39,895 INFO L175 Difference]: Start difference. First operand has 107 places, 114 transitions, 1051 flow. Second operand 25 states and 214 transitions. [2024-01-27 15:29:39,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 184 transitions, 1687 flow [2024-01-27 15:29:39,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 184 transitions, 1313 flow, removed 162 selfloop flow, removed 14 redundant places. [2024-01-27 15:29:39,905 INFO L231 Difference]: Finished difference. Result has 117 places, 117 transitions, 941 flow [2024-01-27 15:29:39,905 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=706, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=941, PETRI_PLACES=117, PETRI_TRANSITIONS=117} [2024-01-27 15:29:39,905 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 96 predicate places. [2024-01-27 15:29:39,905 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 117 transitions, 941 flow [2024-01-27 15:29:39,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.842105263157895) internal successors, (92), 19 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:29:39,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:29:39,906 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:29:39,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-01-27 15:29:40,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-01-27 15:29:40,106 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:29:40,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:29:40,107 INFO L85 PathProgramCache]: Analyzing trace with hash 489756656, now seen corresponding path program 4 times [2024-01-27 15:29:40,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:29:40,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793730427] [2024-01-27 15:29:40,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:29:40,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:29:40,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:29:40,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:29:40,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:29:40,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793730427] [2024-01-27 15:29:40,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793730427] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:29:40,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014759661] [2024-01-27 15:29:40,346 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-01-27 15:29:40,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:29:40,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:29:40,347 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:29:40,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-01-27 15:29:40,467 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-01-27 15:29:40,468 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:29:40,469 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 21 conjunts are in the unsatisfiable core [2024-01-27 15:29:40,469 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:29:40,594 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:29:40,595 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:29:41,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:29:41,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014759661] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:29:41,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:29:41,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 17 [2024-01-27 15:29:41,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201040327] [2024-01-27 15:29:41,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:29:41,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-01-27 15:29:41,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:29:41,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-01-27 15:29:41,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2024-01-27 15:29:41,349 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2024-01-27 15:29:41,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 117 transitions, 941 flow. Second operand has 18 states, 18 states have (on average 5.0) internal successors, (90), 18 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:29:41,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:29:41,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2024-01-27 15:29:41,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:29:41,996 INFO L124 PetriNetUnfolderBase]: 366/708 cut-off events. [2024-01-27 15:29:41,996 INFO L125 PetriNetUnfolderBase]: For 1797/1797 co-relation queries the response was YES. [2024-01-27 15:29:41,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3156 conditions, 708 events. 366/708 cut-off events. For 1797/1797 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3531 event pairs, 50 based on Foata normal form. 3/689 useless extension candidates. Maximal degree in co-relation 3075. Up to 537 conditions per place. [2024-01-27 15:29:42,000 INFO L140 encePairwiseOnDemand]: 10/19 looper letters, 135 selfloop transitions, 46 changer transitions 18/200 dead transitions. [2024-01-27 15:29:42,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 200 transitions, 1818 flow [2024-01-27 15:29:42,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-01-27 15:29:42,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-01-27 15:29:42,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 156 transitions. [2024-01-27 15:29:42,003 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45614035087719296 [2024-01-27 15:29:42,003 INFO L175 Difference]: Start difference. First operand has 117 places, 117 transitions, 941 flow. Second operand 18 states and 156 transitions. [2024-01-27 15:29:42,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 200 transitions, 1818 flow [2024-01-27 15:29:42,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 200 transitions, 1585 flow, removed 36 selfloop flow, removed 20 redundant places. [2024-01-27 15:29:42,013 INFO L231 Difference]: Finished difference. Result has 118 places, 148 transitions, 1191 flow [2024-01-27 15:29:42,013 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=765, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1191, PETRI_PLACES=118, PETRI_TRANSITIONS=148} [2024-01-27 15:29:42,014 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 97 predicate places. [2024-01-27 15:29:42,014 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 148 transitions, 1191 flow [2024-01-27 15:29:42,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.0) internal successors, (90), 18 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:29:42,015 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:29:42,015 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:29:42,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-01-27 15:29:42,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-01-27 15:29:42,226 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:29:42,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:29:42,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1223132305, now seen corresponding path program 4 times [2024-01-27 15:29:42,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:29:42,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229247502] [2024-01-27 15:29:42,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:29:42,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:29:42,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:29:42,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:29:42,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:29:42,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229247502] [2024-01-27 15:29:42,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229247502] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:29:42,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747882607] [2024-01-27 15:29:42,354 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-01-27 15:29:42,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:29:42,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:29:42,368 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:29:42,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-01-27 15:29:42,475 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-01-27 15:29:42,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:29:42,476 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 15 conjunts are in the unsatisfiable core [2024-01-27 15:29:42,477 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:29:42,590 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:29:42,590 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:29:42,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:29:42,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747882607] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:29:42,726 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:29:42,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 15 [2024-01-27 15:29:42,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343728225] [2024-01-27 15:29:42,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:29:42,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-01-27 15:29:42,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:29:42,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-01-27 15:29:42,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2024-01-27 15:29:42,727 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2024-01-27 15:29:42,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 148 transitions, 1191 flow. Second operand has 16 states, 16 states have (on average 5.5) internal successors, (88), 16 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:29:42,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:29:42,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2024-01-27 15:29:42,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:29:42,974 INFO L124 PetriNetUnfolderBase]: 353/690 cut-off events. [2024-01-27 15:29:42,974 INFO L125 PetriNetUnfolderBase]: For 1843/1843 co-relation queries the response was YES. [2024-01-27 15:29:42,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3122 conditions, 690 events. 353/690 cut-off events. For 1843/1843 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3474 event pairs, 48 based on Foata normal form. 4/672 useless extension candidates. Maximal degree in co-relation 3066. Up to 545 conditions per place. [2024-01-27 15:29:42,979 INFO L140 encePairwiseOnDemand]: 12/19 looper letters, 130 selfloop transitions, 30 changer transitions 30/191 dead transitions. [2024-01-27 15:29:42,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 191 transitions, 1764 flow [2024-01-27 15:29:42,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-01-27 15:29:42,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-01-27 15:29:42,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 117 transitions. [2024-01-27 15:29:42,980 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2024-01-27 15:29:42,980 INFO L175 Difference]: Start difference. First operand has 118 places, 148 transitions, 1191 flow. Second operand 13 states and 117 transitions. [2024-01-27 15:29:42,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 191 transitions, 1764 flow [2024-01-27 15:29:42,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 191 transitions, 1674 flow, removed 33 selfloop flow, removed 4 redundant places. [2024-01-27 15:29:42,993 INFO L231 Difference]: Finished difference. Result has 128 places, 144 transitions, 1144 flow [2024-01-27 15:29:42,995 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=1101, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1144, PETRI_PLACES=128, PETRI_TRANSITIONS=144} [2024-01-27 15:29:42,996 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 107 predicate places. [2024-01-27 15:29:42,996 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 144 transitions, 1144 flow [2024-01-27 15:29:42,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.5) internal successors, (88), 16 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:29:42,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:29:42,997 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:29:43,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-01-27 15:29:43,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-01-27 15:29:43,208 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:29:43,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:29:43,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1476787718, now seen corresponding path program 5 times [2024-01-27 15:29:43,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:29:43,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995270383] [2024-01-27 15:29:43,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:29:43,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:29:43,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:29:43,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:29:43,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:29:43,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995270383] [2024-01-27 15:29:43,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995270383] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:29:43,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570930712] [2024-01-27 15:29:43,527 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-01-27 15:29:43,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:29:43,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:29:43,529 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:29:43,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-01-27 15:29:43,623 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 15:29:43,623 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:29:43,624 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 21 conjunts are in the unsatisfiable core [2024-01-27 15:29:43,625 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:29:43,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:29:43,736 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:29:44,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:29:44,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570930712] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:29:44,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:29:44,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 17 [2024-01-27 15:29:44,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331204899] [2024-01-27 15:29:44,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:29:44,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-01-27 15:29:44,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:29:44,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-01-27 15:29:44,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2024-01-27 15:29:44,393 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2024-01-27 15:29:44,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 144 transitions, 1144 flow. Second operand has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 18 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:29:44,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:29:44,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2024-01-27 15:29:44,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:29:45,176 INFO L124 PetriNetUnfolderBase]: 388/758 cut-off events. [2024-01-27 15:29:45,176 INFO L125 PetriNetUnfolderBase]: For 2384/2384 co-relation queries the response was YES. [2024-01-27 15:29:45,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3527 conditions, 758 events. 388/758 cut-off events. For 2384/2384 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3869 event pairs, 48 based on Foata normal form. 2/734 useless extension candidates. Maximal degree in co-relation 3425. Up to 580 conditions per place. [2024-01-27 15:29:45,181 INFO L140 encePairwiseOnDemand]: 11/19 looper letters, 156 selfloop transitions, 56 changer transitions 9/222 dead transitions. [2024-01-27 15:29:45,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 222 transitions, 2111 flow [2024-01-27 15:29:45,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-01-27 15:29:45,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2024-01-27 15:29:45,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 183 transitions. [2024-01-27 15:29:45,183 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41876430205949655 [2024-01-27 15:29:45,183 INFO L175 Difference]: Start difference. First operand has 128 places, 144 transitions, 1144 flow. Second operand 23 states and 183 transitions. [2024-01-27 15:29:45,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 222 transitions, 2111 flow [2024-01-27 15:29:45,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 222 transitions, 1994 flow, removed 22 selfloop flow, removed 12 redundant places. [2024-01-27 15:29:45,196 INFO L231 Difference]: Finished difference. Result has 142 places, 168 transitions, 1525 flow [2024-01-27 15:29:45,196 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=1051, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=1525, PETRI_PLACES=142, PETRI_TRANSITIONS=168} [2024-01-27 15:29:45,197 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 121 predicate places. [2024-01-27 15:29:45,197 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 168 transitions, 1525 flow [2024-01-27 15:29:45,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 18 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:29:45,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:29:45,197 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:29:45,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-01-27 15:29:45,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-01-27 15:29:45,409 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:29:45,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:29:45,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1944438898, now seen corresponding path program 6 times [2024-01-27 15:29:45,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:29:45,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711952372] [2024-01-27 15:29:45,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:29:45,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:29:45,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:29:45,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:29:45,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:29:45,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711952372] [2024-01-27 15:29:45,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711952372] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:29:45,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73716873] [2024-01-27 15:29:45,683 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-01-27 15:29:45,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:29:45,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:29:45,684 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:29:45,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-01-27 15:29:45,751 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-01-27 15:29:45,751 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:29:45,752 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 21 conjunts are in the unsatisfiable core [2024-01-27 15:29:45,753 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:29:45,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:29:45,864 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:29:46,458 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:29:46,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73716873] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:29:46,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:29:46,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 17 [2024-01-27 15:29:46,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287302004] [2024-01-27 15:29:46,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:29:46,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-01-27 15:29:46,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:29:46,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-01-27 15:29:46,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2024-01-27 15:29:46,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2024-01-27 15:29:46,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 168 transitions, 1525 flow. Second operand has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 18 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:29:46,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:29:46,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2024-01-27 15:29:46,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:29:46,996 INFO L124 PetriNetUnfolderBase]: 388/766 cut-off events. [2024-01-27 15:29:46,997 INFO L125 PetriNetUnfolderBase]: For 3110/3110 co-relation queries the response was YES. [2024-01-27 15:29:46,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3843 conditions, 766 events. 388/766 cut-off events. For 3110/3110 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3954 event pairs, 52 based on Foata normal form. 3/747 useless extension candidates. Maximal degree in co-relation 3753. Up to 648 conditions per place. [2024-01-27 15:29:47,002 INFO L140 encePairwiseOnDemand]: 11/19 looper letters, 155 selfloop transitions, 42 changer transitions 7/205 dead transitions. [2024-01-27 15:29:47,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 205 transitions, 2125 flow [2024-01-27 15:29:47,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-01-27 15:29:47,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-01-27 15:29:47,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 139 transitions. [2024-01-27 15:29:47,004 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4064327485380117 [2024-01-27 15:29:47,004 INFO L175 Difference]: Start difference. First operand has 142 places, 168 transitions, 1525 flow. Second operand 18 states and 139 transitions. [2024-01-27 15:29:47,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 205 transitions, 2125 flow [2024-01-27 15:29:47,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 205 transitions, 1888 flow, removed 103 selfloop flow, removed 10 redundant places. [2024-01-27 15:29:47,051 INFO L231 Difference]: Finished difference. Result has 153 places, 172 transitions, 1471 flow [2024-01-27 15:29:47,051 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=1292, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1471, PETRI_PLACES=153, PETRI_TRANSITIONS=172} [2024-01-27 15:29:47,052 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 132 predicate places. [2024-01-27 15:29:47,052 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 172 transitions, 1471 flow [2024-01-27 15:29:47,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 18 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:29:47,052 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:29:47,052 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:29:47,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-01-27 15:29:47,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-01-27 15:29:47,264 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:29:47,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:29:47,264 INFO L85 PathProgramCache]: Analyzing trace with hash 364890728, now seen corresponding path program 7 times [2024-01-27 15:29:47,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:29:47,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823792712] [2024-01-27 15:29:47,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:29:47,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:29:47,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:29:47,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:29:47,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:29:47,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823792712] [2024-01-27 15:29:47,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823792712] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:29:47,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479387] [2024-01-27 15:29:47,581 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-01-27 15:29:47,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:29:47,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:29:47,582 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:29:47,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-01-27 15:29:47,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:29:47,651 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 21 conjunts are in the unsatisfiable core [2024-01-27 15:29:47,652 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:29:47,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:29:47,800 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:29:48,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:29:48,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479387] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:29:48,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:29:48,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 17 [2024-01-27 15:29:48,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670827264] [2024-01-27 15:29:48,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:29:48,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-01-27 15:29:48,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:29:48,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-01-27 15:29:48,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2024-01-27 15:29:48,746 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2024-01-27 15:29:48,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 172 transitions, 1471 flow. Second operand has 18 states, 18 states have (on average 5.0) internal successors, (90), 18 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:29:48,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:29:48,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2024-01-27 15:29:48,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:29:49,335 INFO L124 PetriNetUnfolderBase]: 385/744 cut-off events. [2024-01-27 15:29:49,335 INFO L125 PetriNetUnfolderBase]: For 2933/2933 co-relation queries the response was YES. [2024-01-27 15:29:49,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3628 conditions, 744 events. 385/744 cut-off events. For 2933/2933 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3751 event pairs, 48 based on Foata normal form. 2/720 useless extension candidates. Maximal degree in co-relation 3548. Up to 587 conditions per place. [2024-01-27 15:29:49,341 INFO L140 encePairwiseOnDemand]: 11/19 looper letters, 143 selfloop transitions, 57 changer transitions 11/212 dead transitions. [2024-01-27 15:29:49,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 212 transitions, 2056 flow [2024-01-27 15:29:49,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-01-27 15:29:49,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-01-27 15:29:49,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 153 transitions. [2024-01-27 15:29:49,342 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4026315789473684 [2024-01-27 15:29:49,342 INFO L175 Difference]: Start difference. First operand has 153 places, 172 transitions, 1471 flow. Second operand 20 states and 153 transitions. [2024-01-27 15:29:49,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 212 transitions, 2056 flow [2024-01-27 15:29:49,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 212 transitions, 1934 flow, removed 34 selfloop flow, removed 12 redundant places. [2024-01-27 15:29:49,358 INFO L231 Difference]: Finished difference. Result has 162 places, 174 transitions, 1553 flow [2024-01-27 15:29:49,359 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=1348, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1553, PETRI_PLACES=162, PETRI_TRANSITIONS=174} [2024-01-27 15:29:49,359 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 141 predicate places. [2024-01-27 15:29:49,359 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 174 transitions, 1553 flow [2024-01-27 15:29:49,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.0) internal successors, (90), 18 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:29:49,359 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:29:49,359 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:29:49,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-01-27 15:29:49,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:29:49,571 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:29:49,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:29:49,571 INFO L85 PathProgramCache]: Analyzing trace with hash -397065461, now seen corresponding path program 4 times [2024-01-27 15:29:49,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:29:49,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650596230] [2024-01-27 15:29:49,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:29:49,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:29:49,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:29:49,671 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:29:49,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:29:49,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650596230] [2024-01-27 15:29:49,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650596230] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:29:49,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927472134] [2024-01-27 15:29:49,672 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-01-27 15:29:49,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:29:49,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:29:49,676 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:29:49,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-01-27 15:29:49,741 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-01-27 15:29:49,741 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:29:49,742 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2024-01-27 15:29:49,742 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:29:49,835 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:29:49,836 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:29:53,978 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:29:53,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927472134] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:29:53,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:29:53,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 5] total 12 [2024-01-27 15:29:53,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390645177] [2024-01-27 15:29:53,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:29:53,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-01-27 15:29:53,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:29:53,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-01-27 15:29:53,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=110, Unknown=1, NotChecked=0, Total=156 [2024-01-27 15:29:53,981 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2024-01-27 15:29:53,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 174 transitions, 1553 flow. Second operand has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:29:53,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:29:53,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2024-01-27 15:29:53,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:29:54,338 INFO L124 PetriNetUnfolderBase]: 388/748 cut-off events. [2024-01-27 15:29:54,338 INFO L125 PetriNetUnfolderBase]: For 3300/3300 co-relation queries the response was YES. [2024-01-27 15:29:54,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3798 conditions, 748 events. 388/748 cut-off events. For 3300/3300 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3766 event pairs, 47 based on Foata normal form. 3/729 useless extension candidates. Maximal degree in co-relation 3728. Up to 612 conditions per place. [2024-01-27 15:29:54,344 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 153 selfloop transitions, 27 changer transitions 22/203 dead transitions. [2024-01-27 15:29:54,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 203 transitions, 2082 flow [2024-01-27 15:29:54,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-01-27 15:29:54,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-01-27 15:29:54,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 99 transitions. [2024-01-27 15:29:54,345 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2024-01-27 15:29:54,345 INFO L175 Difference]: Start difference. First operand has 162 places, 174 transitions, 1553 flow. Second operand 11 states and 99 transitions. [2024-01-27 15:29:54,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 203 transitions, 2082 flow [2024-01-27 15:29:54,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 203 transitions, 1937 flow, removed 27 selfloop flow, removed 16 redundant places. [2024-01-27 15:29:54,361 INFO L231 Difference]: Finished difference. Result has 156 places, 168 transitions, 1427 flow [2024-01-27 15:29:54,361 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=1401, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1427, PETRI_PLACES=156, PETRI_TRANSITIONS=168} [2024-01-27 15:29:54,362 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 135 predicate places. [2024-01-27 15:29:54,362 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 168 transitions, 1427 flow [2024-01-27 15:29:54,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:29:54,362 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:29:54,362 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:29:54,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-01-27 15:29:54,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-01-27 15:29:54,573 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:29:54,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:29:54,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1992551506, now seen corresponding path program 8 times [2024-01-27 15:29:54,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:29:54,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267630930] [2024-01-27 15:29:54,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:29:54,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:29:54,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:29:54,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:29:54,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:29:54,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267630930] [2024-01-27 15:29:54,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267630930] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:29:54,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720102184] [2024-01-27 15:29:54,946 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 15:29:54,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:29:54,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:29:54,947 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:29:54,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-01-27 15:29:55,078 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 15:29:55,078 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:29:55,079 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 21 conjunts are in the unsatisfiable core [2024-01-27 15:29:55,080 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:29:55,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:29:55,215 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:29:56,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:29:56,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720102184] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:29:56,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:29:56,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 17 [2024-01-27 15:29:56,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33565542] [2024-01-27 15:29:56,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:29:56,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-01-27 15:29:56,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:29:56,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-01-27 15:29:56,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2024-01-27 15:29:56,162 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2024-01-27 15:29:56,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 168 transitions, 1427 flow. Second operand has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 18 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:29:56,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:29:56,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2024-01-27 15:29:56,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:29:57,188 INFO L124 PetriNetUnfolderBase]: 413/800 cut-off events. [2024-01-27 15:29:57,189 INFO L125 PetriNetUnfolderBase]: For 3941/3941 co-relation queries the response was YES. [2024-01-27 15:29:57,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4157 conditions, 800 events. 413/800 cut-off events. For 3941/3941 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4087 event pairs, 49 based on Foata normal form. 2/780 useless extension candidates. Maximal degree in co-relation 4051. Up to 618 conditions per place. [2024-01-27 15:29:57,203 INFO L140 encePairwiseOnDemand]: 11/19 looper letters, 164 selfloop transitions, 56 changer transitions 10/231 dead transitions. [2024-01-27 15:29:57,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 231 transitions, 2419 flow [2024-01-27 15:29:57,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-01-27 15:29:57,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-01-27 15:29:57,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 156 transitions. [2024-01-27 15:29:57,205 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43213296398891965 [2024-01-27 15:29:57,205 INFO L175 Difference]: Start difference. First operand has 156 places, 168 transitions, 1427 flow. Second operand 19 states and 156 transitions. [2024-01-27 15:29:57,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 231 transitions, 2419 flow [2024-01-27 15:29:57,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 231 transitions, 2316 flow, removed 19 selfloop flow, removed 11 redundant places. [2024-01-27 15:29:57,221 INFO L231 Difference]: Finished difference. Result has 166 places, 185 transitions, 1836 flow [2024-01-27 15:29:57,221 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=1336, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1836, PETRI_PLACES=166, PETRI_TRANSITIONS=185} [2024-01-27 15:29:57,227 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 145 predicate places. [2024-01-27 15:29:57,227 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 185 transitions, 1836 flow [2024-01-27 15:29:57,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 18 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:29:57,227 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:29:57,227 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:29:57,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-01-27 15:29:57,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-01-27 15:29:57,438 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:29:57,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:29:57,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1130127026, now seen corresponding path program 9 times [2024-01-27 15:29:57,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:29:57,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017889409] [2024-01-27 15:29:57,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:29:57,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:29:57,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:29:57,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:29:57,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:29:57,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017889409] [2024-01-27 15:29:57,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017889409] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:29:57,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006809218] [2024-01-27 15:29:57,741 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-27 15:29:57,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:29:57,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:29:57,760 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:29:57,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-01-27 15:29:57,851 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-01-27 15:29:57,852 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:29:57,852 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 21 conjunts are in the unsatisfiable core [2024-01-27 15:29:57,853 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:29:58,014 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:29:58,014 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:29:58,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:29:58,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006809218] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:29:58,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:29:58,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 17 [2024-01-27 15:29:58,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083032139] [2024-01-27 15:29:58,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:29:58,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-01-27 15:29:58,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:29:58,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-01-27 15:29:58,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2024-01-27 15:29:58,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2024-01-27 15:29:58,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 185 transitions, 1836 flow. Second operand has 18 states, 18 states have (on average 5.0) internal successors, (90), 18 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:29:58,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:29:58,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2024-01-27 15:29:58,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:29:59,563 INFO L124 PetriNetUnfolderBase]: 421/825 cut-off events. [2024-01-27 15:29:59,563 INFO L125 PetriNetUnfolderBase]: For 5195/5195 co-relation queries the response was YES. [2024-01-27 15:29:59,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4611 conditions, 825 events. 421/825 cut-off events. For 5195/5195 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 4326 event pairs, 55 based on Foata normal form. 3/806 useless extension candidates. Maximal degree in co-relation 4507. Up to 712 conditions per place. [2024-01-27 15:29:59,569 INFO L140 encePairwiseOnDemand]: 11/19 looper letters, 176 selfloop transitions, 36 changer transitions 9/222 dead transitions. [2024-01-27 15:29:59,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 222 transitions, 2462 flow [2024-01-27 15:29:59,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-01-27 15:29:59,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-01-27 15:29:59,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 122 transitions. [2024-01-27 15:29:59,570 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4280701754385965 [2024-01-27 15:29:59,570 INFO L175 Difference]: Start difference. First operand has 166 places, 185 transitions, 1836 flow. Second operand 15 states and 122 transitions. [2024-01-27 15:29:59,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 222 transitions, 2462 flow [2024-01-27 15:29:59,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 222 transitions, 2152 flow, removed 137 selfloop flow, removed 9 redundant places. [2024-01-27 15:29:59,594 INFO L231 Difference]: Finished difference. Result has 174 places, 188 transitions, 1679 flow [2024-01-27 15:29:59,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=1538, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1679, PETRI_PLACES=174, PETRI_TRANSITIONS=188} [2024-01-27 15:29:59,594 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 153 predicate places. [2024-01-27 15:29:59,595 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 188 transitions, 1679 flow [2024-01-27 15:29:59,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.0) internal successors, (90), 18 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:29:59,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:29:59,595 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:29:59,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-01-27 15:29:59,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-01-27 15:29:59,807 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:29:59,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:29:59,807 INFO L85 PathProgramCache]: Analyzing trace with hash 584072084, now seen corresponding path program 10 times [2024-01-27 15:29:59,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:29:59,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053741396] [2024-01-27 15:29:59,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:29:59,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:29:59,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:30:00,195 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:30:00,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:30:00,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053741396] [2024-01-27 15:30:00,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053741396] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:30:00,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640281438] [2024-01-27 15:30:00,196 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-01-27 15:30:00,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:30:00,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:30:00,206 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:30:00,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-01-27 15:30:00,349 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-01-27 15:30:00,349 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:30:00,350 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 21 conjunts are in the unsatisfiable core [2024-01-27 15:30:00,350 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:30:00,501 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:30:00,501 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:30:01,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:30:01,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640281438] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:30:01,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:30:01,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 17 [2024-01-27 15:30:01,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234102087] [2024-01-27 15:30:01,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:30:01,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-01-27 15:30:01,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:30:01,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-01-27 15:30:01,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2024-01-27 15:30:01,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2024-01-27 15:30:01,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 188 transitions, 1679 flow. Second operand has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 18 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:30:01,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:30:01,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2024-01-27 15:30:01,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:30:01,962 INFO L124 PetriNetUnfolderBase]: 412/797 cut-off events. [2024-01-27 15:30:01,962 INFO L125 PetriNetUnfolderBase]: For 4886/4886 co-relation queries the response was YES. [2024-01-27 15:30:01,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4205 conditions, 797 events. 412/797 cut-off events. For 4886/4886 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4075 event pairs, 51 based on Foata normal form. 2/773 useless extension candidates. Maximal degree in co-relation 4111. Up to 633 conditions per place. [2024-01-27 15:30:01,969 INFO L140 encePairwiseOnDemand]: 11/19 looper letters, 152 selfloop transitions, 57 changer transitions 10/220 dead transitions. [2024-01-27 15:30:01,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 220 transitions, 2256 flow [2024-01-27 15:30:01,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-01-27 15:30:01,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-01-27 15:30:01,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 127 transitions. [2024-01-27 15:30:01,971 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41776315789473684 [2024-01-27 15:30:01,971 INFO L175 Difference]: Start difference. First operand has 174 places, 188 transitions, 1679 flow. Second operand 16 states and 127 transitions. [2024-01-27 15:30:01,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 220 transitions, 2256 flow [2024-01-27 15:30:01,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 220 transitions, 2139 flow, removed 33 selfloop flow, removed 11 redundant places. [2024-01-27 15:30:01,989 INFO L231 Difference]: Finished difference. Result has 179 places, 189 transitions, 1762 flow [2024-01-27 15:30:01,989 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=1561, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1762, PETRI_PLACES=179, PETRI_TRANSITIONS=189} [2024-01-27 15:30:01,989 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 158 predicate places. [2024-01-27 15:30:01,989 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 189 transitions, 1762 flow [2024-01-27 15:30:01,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 18 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:30:01,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:30:01,990 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:30:02,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-01-27 15:30:02,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:30:02,201 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:30:02,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:30:02,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1413557038, now seen corresponding path program 11 times [2024-01-27 15:30:02,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:30:02,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071174162] [2024-01-27 15:30:02,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:30:02,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:30:02,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:30:02,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:30:02,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:30:02,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071174162] [2024-01-27 15:30:02,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071174162] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:30:02,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369381274] [2024-01-27 15:30:02,503 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-01-27 15:30:02,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:30:02,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:30:02,504 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:30:02,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-01-27 15:30:02,636 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 15:30:02,637 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:30:02,637 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 21 conjunts are in the unsatisfiable core [2024-01-27 15:30:02,638 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:30:02,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:30:02,860 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:30:03,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:30:03,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369381274] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:30:03,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:30:03,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 17 [2024-01-27 15:30:03,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183250790] [2024-01-27 15:30:03,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:30:03,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-01-27 15:30:03,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:30:03,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-01-27 15:30:03,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2024-01-27 15:30:03,268 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2024-01-27 15:30:03,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 189 transitions, 1762 flow. Second operand has 18 states, 18 states have (on average 4.944444444444445) internal successors, (89), 18 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:30:03,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:30:03,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2024-01-27 15:30:03,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:30:07,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:30:12,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:30:12,736 INFO L124 PetriNetUnfolderBase]: 495/957 cut-off events. [2024-01-27 15:30:12,736 INFO L125 PetriNetUnfolderBase]: For 9236/9236 co-relation queries the response was YES. [2024-01-27 15:30:12,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5526 conditions, 957 events. 495/957 cut-off events. For 9236/9236 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 5205 event pairs, 56 based on Foata normal form. 4/941 useless extension candidates. Maximal degree in co-relation 5430. Up to 736 conditions per place. [2024-01-27 15:30:12,747 INFO L140 encePairwiseOnDemand]: 11/19 looper letters, 188 selfloop transitions, 65 changer transitions 31/285 dead transitions. [2024-01-27 15:30:12,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 285 transitions, 3210 flow [2024-01-27 15:30:12,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-01-27 15:30:12,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2024-01-27 15:30:12,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 193 transitions. [2024-01-27 15:30:12,757 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4232456140350877 [2024-01-27 15:30:12,757 INFO L175 Difference]: Start difference. First operand has 179 places, 189 transitions, 1762 flow. Second operand 24 states and 193 transitions. [2024-01-27 15:30:12,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 285 transitions, 3210 flow [2024-01-27 15:30:12,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 285 transitions, 3027 flow, removed 49 selfloop flow, removed 12 redundant places. [2024-01-27 15:30:12,784 INFO L231 Difference]: Finished difference. Result has 200 places, 221 transitions, 2310 flow [2024-01-27 15:30:12,784 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=1615, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2310, PETRI_PLACES=200, PETRI_TRANSITIONS=221} [2024-01-27 15:30:12,785 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 179 predicate places. [2024-01-27 15:30:12,785 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 221 transitions, 2310 flow [2024-01-27 15:30:12,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.944444444444445) internal successors, (89), 18 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:30:12,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:30:12,785 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:30:12,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-01-27 15:30:12,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:30:12,994 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:30:12,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:30:12,995 INFO L85 PathProgramCache]: Analyzing trace with hash 2022534408, now seen corresponding path program 12 times [2024-01-27 15:30:12,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:30:12,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249838534] [2024-01-27 15:30:12,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:30:12,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:30:13,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:30:13,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:30:13,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:30:13,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249838534] [2024-01-27 15:30:13,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249838534] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:30:13,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318115927] [2024-01-27 15:30:13,417 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-01-27 15:30:13,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:30:13,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:30:13,428 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:30:13,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-01-27 15:30:13,511 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2024-01-27 15:30:13,512 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:30:13,512 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 21 conjunts are in the unsatisfiable core [2024-01-27 15:30:13,513 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:30:13,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:30:13,716 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:30:14,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:30:14,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318115927] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:30:14,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:30:14,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 18 [2024-01-27 15:30:14,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176828429] [2024-01-27 15:30:14,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:30:14,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-01-27 15:30:14,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:30:14,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-01-27 15:30:14,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2024-01-27 15:30:14,160 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2024-01-27 15:30:14,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 221 transitions, 2310 flow. Second operand has 19 states, 19 states have (on average 4.894736842105263) internal successors, (93), 19 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:30:14,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:30:14,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2024-01-27 15:30:14,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:30:15,507 INFO L124 PetriNetUnfolderBase]: 529/1021 cut-off events. [2024-01-27 15:30:15,508 INFO L125 PetriNetUnfolderBase]: For 12173/12173 co-relation queries the response was YES. [2024-01-27 15:30:15,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6405 conditions, 1021 events. 529/1021 cut-off events. For 12173/12173 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 5625 event pairs, 60 based on Foata normal form. 3/1004 useless extension candidates. Maximal degree in co-relation 6263. Up to 741 conditions per place. [2024-01-27 15:30:15,519 INFO L140 encePairwiseOnDemand]: 11/19 looper letters, 188 selfloop transitions, 92 changer transitions 17/298 dead transitions. [2024-01-27 15:30:15,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 298 transitions, 3765 flow [2024-01-27 15:30:15,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-01-27 15:30:15,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2024-01-27 15:30:15,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 196 transitions. [2024-01-27 15:30:15,520 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4298245614035088 [2024-01-27 15:30:15,520 INFO L175 Difference]: Start difference. First operand has 200 places, 221 transitions, 2310 flow. Second operand 24 states and 196 transitions. [2024-01-27 15:30:15,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 298 transitions, 3765 flow [2024-01-27 15:30:15,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 298 transitions, 3317 flow, removed 216 selfloop flow, removed 6 redundant places. [2024-01-27 15:30:15,564 INFO L231 Difference]: Finished difference. Result has 220 places, 241 transitions, 2669 flow [2024-01-27 15:30:15,564 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=1916, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2669, PETRI_PLACES=220, PETRI_TRANSITIONS=241} [2024-01-27 15:30:15,565 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 199 predicate places. [2024-01-27 15:30:15,565 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 241 transitions, 2669 flow [2024-01-27 15:30:15,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.894736842105263) internal successors, (93), 19 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:30:15,565 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:30:15,565 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:30:15,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-01-27 15:30:15,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-01-27 15:30:15,776 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:30:15,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:30:15,777 INFO L85 PathProgramCache]: Analyzing trace with hash 165662552, now seen corresponding path program 13 times [2024-01-27 15:30:15,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:30:15,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980969780] [2024-01-27 15:30:15,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:30:15,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:30:15,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:30:16,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:30:16,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:30:16,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980969780] [2024-01-27 15:30:16,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980969780] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:30:16,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901607866] [2024-01-27 15:30:16,114 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-01-27 15:30:16,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:30:16,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:30:16,133 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:30:16,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-01-27 15:30:16,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:30:16,235 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 21 conjunts are in the unsatisfiable core [2024-01-27 15:30:16,236 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:30:16,438 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:30:16,439 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:30:16,916 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:30:16,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901607866] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:30:16,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:30:16,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 18 [2024-01-27 15:30:16,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590952131] [2024-01-27 15:30:16,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:30:16,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-01-27 15:30:16,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:30:16,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-01-27 15:30:16,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2024-01-27 15:30:16,918 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2024-01-27 15:30:16,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 241 transitions, 2669 flow. Second operand has 19 states, 19 states have (on average 4.842105263157895) internal successors, (92), 19 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:30:16,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:30:16,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2024-01-27 15:30:16,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:30:18,462 INFO L124 PetriNetUnfolderBase]: 524/1019 cut-off events. [2024-01-27 15:30:18,462 INFO L125 PetriNetUnfolderBase]: For 11743/11743 co-relation queries the response was YES. [2024-01-27 15:30:18,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6317 conditions, 1019 events. 524/1019 cut-off events. For 11743/11743 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 5614 event pairs, 54 based on Foata normal form. 3/1000 useless extension candidates. Maximal degree in co-relation 6138. Up to 745 conditions per place. [2024-01-27 15:30:18,470 INFO L140 encePairwiseOnDemand]: 11/19 looper letters, 195 selfloop transitions, 97 changer transitions 14/307 dead transitions. [2024-01-27 15:30:18,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 307 transitions, 3863 flow [2024-01-27 15:30:18,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-01-27 15:30:18,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2024-01-27 15:30:18,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 211 transitions. [2024-01-27 15:30:18,472 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4271255060728745 [2024-01-27 15:30:18,472 INFO L175 Difference]: Start difference. First operand has 220 places, 241 transitions, 2669 flow. Second operand 26 states and 211 transitions. [2024-01-27 15:30:18,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 307 transitions, 3863 flow [2024-01-27 15:30:18,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 307 transitions, 3175 flow, removed 311 selfloop flow, removed 11 redundant places. [2024-01-27 15:30:18,525 INFO L231 Difference]: Finished difference. Result has 234 places, 248 transitions, 2575 flow [2024-01-27 15:30:18,525 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=2206, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=2575, PETRI_PLACES=234, PETRI_TRANSITIONS=248} [2024-01-27 15:30:18,525 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 213 predicate places. [2024-01-27 15:30:18,526 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 248 transitions, 2575 flow [2024-01-27 15:30:18,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.842105263157895) internal successors, (92), 19 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:30:18,526 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:30:18,526 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:30:18,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2024-01-27 15:30:18,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-01-27 15:30:18,738 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:30:18,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:30:18,738 INFO L85 PathProgramCache]: Analyzing trace with hash 77725818, now seen corresponding path program 14 times [2024-01-27 15:30:18,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:30:18,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698173810] [2024-01-27 15:30:18,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:30:18,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:30:18,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:30:19,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:30:19,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:30:19,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698173810] [2024-01-27 15:30:19,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698173810] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:30:19,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682027162] [2024-01-27 15:30:19,062 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 15:30:19,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:30:19,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:30:19,063 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:30:19,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-01-27 15:30:19,125 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 15:30:19,125 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:30:19,126 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 21 conjunts are in the unsatisfiable core [2024-01-27 15:30:19,126 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:30:19,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:30:19,265 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:30:24,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:30:24,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682027162] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:30:24,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:30:24,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 17 [2024-01-27 15:30:24,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466860062] [2024-01-27 15:30:24,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:30:24,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-01-27 15:30:24,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:30:24,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-01-27 15:30:24,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2024-01-27 15:30:24,470 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2024-01-27 15:30:24,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 248 transitions, 2575 flow. Second operand has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 18 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:30:24,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:30:24,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2024-01-27 15:30:24,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:30:25,287 INFO L124 PetriNetUnfolderBase]: 553/1070 cut-off events. [2024-01-27 15:30:25,287 INFO L125 PetriNetUnfolderBase]: For 10722/10722 co-relation queries the response was YES. [2024-01-27 15:30:25,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6420 conditions, 1070 events. 553/1070 cut-off events. For 10722/10722 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 5954 event pairs, 64 based on Foata normal form. 2/1050 useless extension candidates. Maximal degree in co-relation 6332. Up to 906 conditions per place. [2024-01-27 15:30:25,296 INFO L140 encePairwiseOnDemand]: 10/19 looper letters, 231 selfloop transitions, 53 changer transitions 10/295 dead transitions. [2024-01-27 15:30:25,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 295 transitions, 3620 flow [2024-01-27 15:30:25,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-01-27 15:30:25,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-01-27 15:30:25,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 150 transitions. [2024-01-27 15:30:25,298 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39473684210526316 [2024-01-27 15:30:25,298 INFO L175 Difference]: Start difference. First operand has 234 places, 248 transitions, 2575 flow. Second operand 20 states and 150 transitions. [2024-01-27 15:30:25,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 295 transitions, 3620 flow [2024-01-27 15:30:25,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 295 transitions, 3286 flow, removed 107 selfloop flow, removed 21 redundant places. [2024-01-27 15:30:25,348 INFO L231 Difference]: Finished difference. Result has 235 places, 258 transitions, 2653 flow [2024-01-27 15:30:25,348 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=2257, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=2653, PETRI_PLACES=235, PETRI_TRANSITIONS=258} [2024-01-27 15:30:25,349 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 214 predicate places. [2024-01-27 15:30:25,349 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 258 transitions, 2653 flow [2024-01-27 15:30:25,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 18 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:30:25,349 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:30:25,349 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:30:25,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2024-01-27 15:30:25,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:30:25,560 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:30:25,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:30:25,561 INFO L85 PathProgramCache]: Analyzing trace with hash -126262128, now seen corresponding path program 15 times [2024-01-27 15:30:25,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:30:25,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223367789] [2024-01-27 15:30:25,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:30:25,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:30:25,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:30:25,930 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:30:25,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:30:25,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223367789] [2024-01-27 15:30:25,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223367789] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:30:25,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638063976] [2024-01-27 15:30:25,931 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-27 15:30:25,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:30:25,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:30:25,932 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:30:25,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-01-27 15:30:26,021 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-01-27 15:30:26,022 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:30:26,023 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 21 conjunts are in the unsatisfiable core [2024-01-27 15:30:26,023 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:30:26,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:30:26,161 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:30:26,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:30:26,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638063976] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:30:26,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:30:26,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 17 [2024-01-27 15:30:26,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908705411] [2024-01-27 15:30:26,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:30:26,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-01-27 15:30:26,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:30:26,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-01-27 15:30:26,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2024-01-27 15:30:26,964 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2024-01-27 15:30:26,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 258 transitions, 2653 flow. Second operand has 18 states, 18 states have (on average 4.944444444444445) internal successors, (89), 18 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:30:26,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:30:26,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2024-01-27 15:30:26,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:30:27,684 INFO L124 PetriNetUnfolderBase]: 589/1131 cut-off events. [2024-01-27 15:30:27,685 INFO L125 PetriNetUnfolderBase]: For 11995/11995 co-relation queries the response was YES. [2024-01-27 15:30:27,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7045 conditions, 1131 events. 589/1131 cut-off events. For 11995/11995 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 6345 event pairs, 66 based on Foata normal form. 2/1109 useless extension candidates. Maximal degree in co-relation 6914. Up to 978 conditions per place. [2024-01-27 15:30:27,694 INFO L140 encePairwiseOnDemand]: 11/19 looper letters, 240 selfloop transitions, 52 changer transitions 10/303 dead transitions. [2024-01-27 15:30:27,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 303 transitions, 3840 flow [2024-01-27 15:30:27,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-01-27 15:30:27,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-01-27 15:30:27,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 125 transitions. [2024-01-27 15:30:27,695 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41118421052631576 [2024-01-27 15:30:27,695 INFO L175 Difference]: Start difference. First operand has 235 places, 258 transitions, 2653 flow. Second operand 16 states and 125 transitions. [2024-01-27 15:30:27,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 303 transitions, 3840 flow [2024-01-27 15:30:27,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 303 transitions, 3640 flow, removed 71 selfloop flow, removed 16 redundant places. [2024-01-27 15:30:27,741 INFO L231 Difference]: Finished difference. Result has 237 places, 271 transitions, 2980 flow [2024-01-27 15:30:27,742 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=2457, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2980, PETRI_PLACES=237, PETRI_TRANSITIONS=271} [2024-01-27 15:30:27,742 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 216 predicate places. [2024-01-27 15:30:27,742 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 271 transitions, 2980 flow [2024-01-27 15:30:27,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.944444444444445) internal successors, (89), 18 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:30:27,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:30:27,743 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:30:27,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2024-01-27 15:30:27,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:30:27,954 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:30:27,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:30:27,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1983133984, now seen corresponding path program 16 times [2024-01-27 15:30:27,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:30:27,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736760721] [2024-01-27 15:30:27,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:30:27,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:30:27,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:30:28,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:30:28,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:30:28,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736760721] [2024-01-27 15:30:28,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736760721] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:30:28,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706428232] [2024-01-27 15:30:28,254 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-01-27 15:30:28,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:30:28,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:30:28,255 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:30:28,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-01-27 15:30:28,348 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-01-27 15:30:28,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:30:28,349 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 21 conjunts are in the unsatisfiable core [2024-01-27 15:30:28,350 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:30:28,473 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:30:28,473 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:30:29,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:30:29,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706428232] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:30:29,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:30:29,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 17 [2024-01-27 15:30:29,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82720927] [2024-01-27 15:30:29,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:30:29,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-01-27 15:30:29,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:30:29,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-01-27 15:30:29,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2024-01-27 15:30:29,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2024-01-27 15:30:29,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 271 transitions, 2980 flow. Second operand has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 18 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:30:29,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:30:29,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2024-01-27 15:30:29,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:30:30,670 INFO L124 PetriNetUnfolderBase]: 587/1133 cut-off events. [2024-01-27 15:30:30,671 INFO L125 PetriNetUnfolderBase]: For 11799/11799 co-relation queries the response was YES. [2024-01-27 15:30:30,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7042 conditions, 1133 events. 587/1133 cut-off events. For 11799/11799 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 6429 event pairs, 64 based on Foata normal form. 2/1111 useless extension candidates. Maximal degree in co-relation 6920. Up to 980 conditions per place. [2024-01-27 15:30:30,681 INFO L140 encePairwiseOnDemand]: 11/19 looper letters, 243 selfloop transitions, 55 changer transitions 8/307 dead transitions. [2024-01-27 15:30:30,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 307 transitions, 3941 flow [2024-01-27 15:30:30,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-01-27 15:30:30,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-01-27 15:30:30,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 134 transitions. [2024-01-27 15:30:30,688 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4148606811145511 [2024-01-27 15:30:30,689 INFO L175 Difference]: Start difference. First operand has 237 places, 271 transitions, 2980 flow. Second operand 17 states and 134 transitions. [2024-01-27 15:30:30,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 307 transitions, 3941 flow [2024-01-27 15:30:30,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 307 transitions, 3557 flow, removed 176 selfloop flow, removed 8 redundant places. [2024-01-27 15:30:30,790 INFO L231 Difference]: Finished difference. Result has 246 places, 276 transitions, 2950 flow [2024-01-27 15:30:30,791 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=2690, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2950, PETRI_PLACES=246, PETRI_TRANSITIONS=276} [2024-01-27 15:30:30,791 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 225 predicate places. [2024-01-27 15:30:30,791 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 276 transitions, 2950 flow [2024-01-27 15:30:30,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 18 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:30:30,792 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:30:30,792 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:30:30,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2024-01-27 15:30:31,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-01-27 15:30:31,002 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:30:31,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:30:31,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1919404264, now seen corresponding path program 17 times [2024-01-27 15:30:31,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:30:31,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851006046] [2024-01-27 15:30:31,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:30:31,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:30:31,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:30:31,368 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:30:31,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:30:31,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851006046] [2024-01-27 15:30:31,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851006046] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:30:31,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011860683] [2024-01-27 15:30:31,368 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-01-27 15:30:31,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:30:31,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:30:31,369 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:30:31,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-01-27 15:30:31,435 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 15:30:31,435 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:30:31,436 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 21 conjunts are in the unsatisfiable core [2024-01-27 15:30:31,437 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:30:31,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:30:31,580 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:30:32,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:30:32,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011860683] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:30:32,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:30:32,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 17 [2024-01-27 15:30:32,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625447428] [2024-01-27 15:30:32,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:30:32,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-01-27 15:30:32,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:30:32,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-01-27 15:30:32,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2024-01-27 15:30:32,277 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2024-01-27 15:30:32,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 276 transitions, 2950 flow. Second operand has 18 states, 18 states have (on average 5.0) internal successors, (90), 18 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:30:32,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:30:32,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2024-01-27 15:30:32,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:30:33,250 INFO L124 PetriNetUnfolderBase]: 588/1138 cut-off events. [2024-01-27 15:30:33,250 INFO L125 PetriNetUnfolderBase]: For 10340/10340 co-relation queries the response was YES. [2024-01-27 15:30:33,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6809 conditions, 1138 events. 588/1138 cut-off events. For 10340/10340 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 6462 event pairs, 60 based on Foata normal form. 2/1114 useless extension candidates. Maximal degree in co-relation 6721. Up to 970 conditions per place. [2024-01-27 15:30:33,259 INFO L140 encePairwiseOnDemand]: 10/19 looper letters, 259 selfloop transitions, 54 changer transitions 10/324 dead transitions. [2024-01-27 15:30:33,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 324 transitions, 3841 flow [2024-01-27 15:30:33,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-01-27 15:30:33,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-01-27 15:30:33,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 172 transitions. [2024-01-27 15:30:33,274 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41148325358851673 [2024-01-27 15:30:33,274 INFO L175 Difference]: Start difference. First operand has 246 places, 276 transitions, 2950 flow. Second operand 22 states and 172 transitions. [2024-01-27 15:30:33,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 324 transitions, 3841 flow [2024-01-27 15:30:33,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 324 transitions, 3618 flow, removed 77 selfloop flow, removed 14 redundant places. [2024-01-27 15:30:33,324 INFO L231 Difference]: Finished difference. Result has 255 places, 279 transitions, 2954 flow [2024-01-27 15:30:33,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=2727, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2954, PETRI_PLACES=255, PETRI_TRANSITIONS=279} [2024-01-27 15:30:33,325 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 234 predicate places. [2024-01-27 15:30:33,325 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 279 transitions, 2954 flow [2024-01-27 15:30:33,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.0) internal successors, (90), 18 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:30:33,326 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:30:33,326 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:30:33,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2024-01-27 15:30:33,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-01-27 15:30:33,536 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:30:33,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:30:33,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1438092632, now seen corresponding path program 18 times [2024-01-27 15:30:33,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:30:33,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700925536] [2024-01-27 15:30:33,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:30:33,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:30:33,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:30:33,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:30:33,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:30:33,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700925536] [2024-01-27 15:30:33,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700925536] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:30:33,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749037217] [2024-01-27 15:30:33,799 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-01-27 15:30:33,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:30:33,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:30:33,800 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:30:33,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-01-27 15:30:33,880 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-01-27 15:30:33,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:30:33,881 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 21 conjunts are in the unsatisfiable core [2024-01-27 15:30:33,882 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:30:34,031 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:30:34,031 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:30:34,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:30:34,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749037217] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:30:34,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:30:34,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 17 [2024-01-27 15:30:34,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284725665] [2024-01-27 15:30:34,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:30:34,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-01-27 15:30:34,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:30:34,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-01-27 15:30:34,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2024-01-27 15:30:34,845 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2024-01-27 15:30:34,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 279 transitions, 2954 flow. Second operand has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 18 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:30:34,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:30:34,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2024-01-27 15:30:34,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:30:35,553 INFO L124 PetriNetUnfolderBase]: 584/1145 cut-off events. [2024-01-27 15:30:35,553 INFO L125 PetriNetUnfolderBase]: For 9337/9337 co-relation queries the response was YES. [2024-01-27 15:30:35,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6804 conditions, 1145 events. 584/1145 cut-off events. For 9337/9337 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 6555 event pairs, 74 based on Foata normal form. 3/1120 useless extension candidates. Maximal degree in co-relation 6716. Up to 1053 conditions per place. [2024-01-27 15:30:35,574 INFO L140 encePairwiseOnDemand]: 11/19 looper letters, 261 selfloop transitions, 36 changer transitions 8/306 dead transitions. [2024-01-27 15:30:35,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 306 transitions, 3757 flow [2024-01-27 15:30:35,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-01-27 15:30:35,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-01-27 15:30:35,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 110 transitions. [2024-01-27 15:30:35,589 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38596491228070173 [2024-01-27 15:30:35,589 INFO L175 Difference]: Start difference. First operand has 255 places, 279 transitions, 2954 flow. Second operand 15 states and 110 transitions. [2024-01-27 15:30:35,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 306 transitions, 3757 flow [2024-01-27 15:30:35,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 306 transitions, 3543 flow, removed 73 selfloop flow, removed 19 redundant places. [2024-01-27 15:30:35,637 INFO L231 Difference]: Finished difference. Result has 253 places, 282 transitions, 2907 flow [2024-01-27 15:30:35,638 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=2742, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2907, PETRI_PLACES=253, PETRI_TRANSITIONS=282} [2024-01-27 15:30:35,638 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 232 predicate places. [2024-01-27 15:30:35,638 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 282 transitions, 2907 flow [2024-01-27 15:30:35,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 18 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:30:35,639 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:30:35,639 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:30:35,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2024-01-27 15:30:35,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-01-27 15:30:35,849 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:30:35,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:30:35,849 INFO L85 PathProgramCache]: Analyzing trace with hash 401833575, now seen corresponding path program 19 times [2024-01-27 15:30:35,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:30:35,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851100834] [2024-01-27 15:30:35,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:30:35,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:30:35,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:30:36,297 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:30:36,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:30:36,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851100834] [2024-01-27 15:30:36,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851100834] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:30:36,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297672087] [2024-01-27 15:30:36,297 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-01-27 15:30:36,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:30:36,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:30:36,312 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:30:36,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2024-01-27 15:30:36,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:30:36,409 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 25 conjunts are in the unsatisfiable core [2024-01-27 15:30:36,409 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:30:40,717 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:30:40,718 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:30:45,352 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:30:45,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297672087] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:30:45,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:30:45,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 20 [2024-01-27 15:30:45,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243579456] [2024-01-27 15:30:45,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:30:45,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-01-27 15:30:45,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:30:45,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-01-27 15:30:45,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=336, Unknown=2, NotChecked=0, Total=420 [2024-01-27 15:30:45,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2024-01-27 15:30:45,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 282 transitions, 2907 flow. Second operand has 21 states, 21 states have (on average 4.857142857142857) internal successors, (102), 21 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:30:45,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:30:45,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2024-01-27 15:30:45,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:30:49,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:30:54,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:30:58,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:31:03,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:31:07,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:31:07,686 INFO L124 PetriNetUnfolderBase]: 707/1362 cut-off events. [2024-01-27 15:31:07,686 INFO L125 PetriNetUnfolderBase]: For 18457/18457 co-relation queries the response was YES. [2024-01-27 15:31:07,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8874 conditions, 1362 events. 707/1362 cut-off events. For 18457/18457 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 8067 event pairs, 45 based on Foata normal form. 4/1338 useless extension candidates. Maximal degree in co-relation 8784. Up to 939 conditions per place. [2024-01-27 15:31:07,700 INFO L140 encePairwiseOnDemand]: 11/19 looper letters, 280 selfloop transitions, 103 changer transitions 27/411 dead transitions. [2024-01-27 15:31:07,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 411 transitions, 5008 flow [2024-01-27 15:31:07,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-01-27 15:31:07,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2024-01-27 15:31:07,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 278 transitions. [2024-01-27 15:31:07,702 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4433811802232855 [2024-01-27 15:31:07,703 INFO L175 Difference]: Start difference. First operand has 253 places, 282 transitions, 2907 flow. Second operand 33 states and 278 transitions. [2024-01-27 15:31:07,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 411 transitions, 5008 flow [2024-01-27 15:31:07,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 411 transitions, 4867 flow, removed 36 selfloop flow, removed 13 redundant places. [2024-01-27 15:31:07,780 INFO L231 Difference]: Finished difference. Result has 282 places, 318 transitions, 3813 flow [2024-01-27 15:31:07,780 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=2770, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=3813, PETRI_PLACES=282, PETRI_TRANSITIONS=318} [2024-01-27 15:31:07,785 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 261 predicate places. [2024-01-27 15:31:07,785 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 318 transitions, 3813 flow [2024-01-27 15:31:07,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.857142857142857) internal successors, (102), 21 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:31:07,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:31:07,785 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:31:07,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2024-01-27 15:31:07,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-01-27 15:31:07,996 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:31:07,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:31:07,996 INFO L85 PathProgramCache]: Analyzing trace with hash 935864290, now seen corresponding path program 5 times [2024-01-27 15:31:07,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:31:07,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458268978] [2024-01-27 15:31:07,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:31:07,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:31:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:31:08,148 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:31:08,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:31:08,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458268978] [2024-01-27 15:31:08,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458268978] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:31:08,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675471174] [2024-01-27 15:31:08,149 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-01-27 15:31:08,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:31:08,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:31:08,150 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:31:08,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2024-01-27 15:31:08,247 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-01-27 15:31:08,247 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:31:08,248 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 16 conjunts are in the unsatisfiable core [2024-01-27 15:31:08,249 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:31:08,339 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:31:08,340 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:31:08,727 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:31:08,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675471174] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:31:08,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:31:08,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 5] total 13 [2024-01-27 15:31:08,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491737059] [2024-01-27 15:31:08,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:31:08,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-01-27 15:31:08,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:31:08,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-01-27 15:31:08,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-01-27 15:31:08,729 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2024-01-27 15:31:08,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 318 transitions, 3813 flow. Second operand has 14 states, 14 states have (on average 5.785714285714286) internal successors, (81), 14 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:31:08,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:31:08,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2024-01-27 15:31:08,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:31:09,453 INFO L124 PetriNetUnfolderBase]: 692/1348 cut-off events. [2024-01-27 15:31:09,453 INFO L125 PetriNetUnfolderBase]: For 19796/19796 co-relation queries the response was YES. [2024-01-27 15:31:09,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9247 conditions, 1348 events. 692/1348 cut-off events. For 19796/19796 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 8039 event pairs, 36 based on Foata normal form. 5/1327 useless extension candidates. Maximal degree in co-relation 9145. Up to 1053 conditions per place. [2024-01-27 15:31:09,466 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 277 selfloop transitions, 70 changer transitions 25/373 dead transitions. [2024-01-27 15:31:09,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 373 transitions, 5155 flow [2024-01-27 15:31:09,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-01-27 15:31:09,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-01-27 15:31:09,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 149 transitions. [2024-01-27 15:31:09,467 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4613003095975232 [2024-01-27 15:31:09,467 INFO L175 Difference]: Start difference. First operand has 282 places, 318 transitions, 3813 flow. Second operand 17 states and 149 transitions. [2024-01-27 15:31:09,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 373 transitions, 5155 flow [2024-01-27 15:31:09,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 373 transitions, 4421 flow, removed 343 selfloop flow, removed 13 redundant places. [2024-01-27 15:31:09,602 INFO L231 Difference]: Finished difference. Result has 284 places, 316 transitions, 3378 flow [2024-01-27 15:31:09,602 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=3189, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=3378, PETRI_PLACES=284, PETRI_TRANSITIONS=316} [2024-01-27 15:31:09,603 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 263 predicate places. [2024-01-27 15:31:09,603 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 316 transitions, 3378 flow [2024-01-27 15:31:09,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.785714285714286) internal successors, (81), 14 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:31:09,603 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:31:09,603 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:31:09,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2024-01-27 15:31:09,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-01-27 15:31:09,815 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:31:09,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:31:09,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1270456160, now seen corresponding path program 6 times [2024-01-27 15:31:09,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:31:09,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603055277] [2024-01-27 15:31:09,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:31:09,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:31:09,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:31:09,959 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:31:09,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:31:09,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603055277] [2024-01-27 15:31:09,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603055277] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:31:09,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048688067] [2024-01-27 15:31:09,961 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-01-27 15:31:09,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:31:09,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:31:09,967 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:31:09,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-01-27 15:31:10,042 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2024-01-27 15:31:10,043 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:31:10,044 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 16 conjunts are in the unsatisfiable core [2024-01-27 15:31:10,044 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:31:10,130 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:31:10,130 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:31:10,345 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:31:10,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048688067] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:31:10,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:31:10,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 14 [2024-01-27 15:31:10,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839009350] [2024-01-27 15:31:10,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:31:10,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-01-27 15:31:10,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:31:10,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-01-27 15:31:10,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2024-01-27 15:31:10,346 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2024-01-27 15:31:10,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 316 transitions, 3378 flow. Second operand has 15 states, 15 states have (on average 5.6) internal successors, (84), 15 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:31:10,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:31:10,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2024-01-27 15:31:10,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:31:12,367 INFO L124 PetriNetUnfolderBase]: 707/1377 cut-off events. [2024-01-27 15:31:12,367 INFO L125 PetriNetUnfolderBase]: For 16900/16900 co-relation queries the response was YES. [2024-01-27 15:31:12,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8790 conditions, 1377 events. 707/1377 cut-off events. For 16900/16900 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 8246 event pairs, 46 based on Foata normal form. 6/1351 useless extension candidates. Maximal degree in co-relation 8669. Up to 1006 conditions per place. [2024-01-27 15:31:12,377 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 273 selfloop transitions, 48 changer transitions 50/372 dead transitions. [2024-01-27 15:31:12,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 372 transitions, 4770 flow [2024-01-27 15:31:12,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-01-27 15:31:12,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-01-27 15:31:12,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 130 transitions. [2024-01-27 15:31:12,378 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45614035087719296 [2024-01-27 15:31:12,378 INFO L175 Difference]: Start difference. First operand has 284 places, 316 transitions, 3378 flow. Second operand 15 states and 130 transitions. [2024-01-27 15:31:12,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 372 transitions, 4770 flow [2024-01-27 15:31:12,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 372 transitions, 4598 flow, removed 32 selfloop flow, removed 15 redundant places. [2024-01-27 15:31:12,461 INFO L231 Difference]: Finished difference. Result has 284 places, 295 transitions, 3133 flow [2024-01-27 15:31:12,462 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=3224, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=3133, PETRI_PLACES=284, PETRI_TRANSITIONS=295} [2024-01-27 15:31:12,462 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 263 predicate places. [2024-01-27 15:31:12,462 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 295 transitions, 3133 flow [2024-01-27 15:31:12,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.6) internal successors, (84), 15 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:31:12,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:31:12,463 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:31:12,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2024-01-27 15:31:12,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:31:12,674 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:31:12,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:31:12,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1071048199, now seen corresponding path program 20 times [2024-01-27 15:31:12,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:31:12,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388347937] [2024-01-27 15:31:12,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:31:12,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:31:12,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:31:13,038 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:31:13,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:31:13,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388347937] [2024-01-27 15:31:13,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388347937] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:31:13,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163728560] [2024-01-27 15:31:13,038 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 15:31:13,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:31:13,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:31:13,039 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:31:13,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2024-01-27 15:31:13,125 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 15:31:13,125 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:31:13,126 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 25 conjunts are in the unsatisfiable core [2024-01-27 15:31:13,126 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:31:17,397 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:31:17,397 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:31:21,957 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:31:21,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163728560] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:31:21,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:31:21,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 19 [2024-01-27 15:31:21,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382514271] [2024-01-27 15:31:21,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:31:21,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-01-27 15:31:21,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:31:21,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-01-27 15:31:21,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=303, Unknown=2, NotChecked=0, Total=380 [2024-01-27 15:31:21,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2024-01-27 15:31:21,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 295 transitions, 3133 flow. Second operand has 20 states, 20 states have (on average 4.85) internal successors, (97), 20 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:31:21,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:31:21,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2024-01-27 15:31:21,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:31:26,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:31:31,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:31:35,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:31:39,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:31:40,097 INFO L124 PetriNetUnfolderBase]: 683/1306 cut-off events. [2024-01-27 15:31:40,097 INFO L125 PetriNetUnfolderBase]: For 15272/15272 co-relation queries the response was YES. [2024-01-27 15:31:40,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8334 conditions, 1306 events. 683/1306 cut-off events. For 15272/15272 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 7576 event pairs, 71 based on Foata normal form. 3/1283 useless extension candidates. Maximal degree in co-relation 8213. Up to 1104 conditions per place. [2024-01-27 15:31:40,108 INFO L140 encePairwiseOnDemand]: 11/19 looper letters, 280 selfloop transitions, 72 changer transitions 15/368 dead transitions. [2024-01-27 15:31:40,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 368 transitions, 4437 flow [2024-01-27 15:31:40,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-01-27 15:31:40,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2024-01-27 15:31:40,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 191 transitions. [2024-01-27 15:31:40,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41885964912280704 [2024-01-27 15:31:40,109 INFO L175 Difference]: Start difference. First operand has 284 places, 295 transitions, 3133 flow. Second operand 24 states and 191 transitions. [2024-01-27 15:31:40,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 368 transitions, 4437 flow [2024-01-27 15:31:40,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 368 transitions, 4229 flow, removed 79 selfloop flow, removed 15 redundant places. [2024-01-27 15:31:40,187 INFO L231 Difference]: Finished difference. Result has 285 places, 313 transitions, 3501 flow [2024-01-27 15:31:40,188 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=2983, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=3501, PETRI_PLACES=285, PETRI_TRANSITIONS=313} [2024-01-27 15:31:40,188 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 264 predicate places. [2024-01-27 15:31:40,188 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 313 transitions, 3501 flow [2024-01-27 15:31:40,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.85) internal successors, (97), 20 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:31:40,188 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:31:40,189 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:31:40,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2024-01-27 15:31:40,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2024-01-27 15:31:40,399 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:31:40,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:31:40,400 INFO L85 PathProgramCache]: Analyzing trace with hash -400762848, now seen corresponding path program 21 times [2024-01-27 15:31:40,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:31:40,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160687462] [2024-01-27 15:31:40,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:31:40,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:31:40,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:31:40,922 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:31:40,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:31:40,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160687462] [2024-01-27 15:31:40,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160687462] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:31:40,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667310329] [2024-01-27 15:31:40,923 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-27 15:31:40,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:31:40,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:31:40,924 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:31:40,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2024-01-27 15:31:41,029 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-01-27 15:31:41,030 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:31:41,031 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 25 conjunts are in the unsatisfiable core [2024-01-27 15:31:41,031 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:31:41,252 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:31:41,252 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:31:43,262 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:31:43,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667310329] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:31:43,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:31:43,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 21 [2024-01-27 15:31:43,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806325427] [2024-01-27 15:31:43,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:31:43,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-01-27 15:31:43,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:31:43,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-01-27 15:31:43,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2024-01-27 15:31:43,264 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2024-01-27 15:31:43,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 313 transitions, 3501 flow. Second operand has 22 states, 22 states have (on average 4.818181818181818) internal successors, (106), 22 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:31:43,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:31:43,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2024-01-27 15:31:43,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:31:45,771 INFO L124 PetriNetUnfolderBase]: 692/1327 cut-off events. [2024-01-27 15:31:45,771 INFO L125 PetriNetUnfolderBase]: For 16985/16985 co-relation queries the response was YES. [2024-01-27 15:31:45,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8712 conditions, 1327 events. 692/1327 cut-off events. For 16985/16985 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 7754 event pairs, 48 based on Foata normal form. 3/1304 useless extension candidates. Maximal degree in co-relation 8611. Up to 1079 conditions per place. [2024-01-27 15:31:45,783 INFO L140 encePairwiseOnDemand]: 11/19 looper letters, 292 selfloop transitions, 71 changer transitions 15/379 dead transitions. [2024-01-27 15:31:45,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 379 transitions, 4649 flow [2024-01-27 15:31:45,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-01-27 15:31:45,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2024-01-27 15:31:45,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 194 transitions. [2024-01-27 15:31:45,784 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42543859649122806 [2024-01-27 15:31:45,784 INFO L175 Difference]: Start difference. First operand has 285 places, 313 transitions, 3501 flow. Second operand 24 states and 194 transitions. [2024-01-27 15:31:45,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 379 transitions, 4649 flow [2024-01-27 15:31:45,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 379 transitions, 4440 flow, removed 70 selfloop flow, removed 17 redundant places. [2024-01-27 15:31:45,869 INFO L231 Difference]: Finished difference. Result has 294 places, 316 transitions, 3567 flow [2024-01-27 15:31:45,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=3292, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=3567, PETRI_PLACES=294, PETRI_TRANSITIONS=316} [2024-01-27 15:31:45,870 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 273 predicate places. [2024-01-27 15:31:45,870 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 316 transitions, 3567 flow [2024-01-27 15:31:45,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.818181818181818) internal successors, (106), 22 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:31:45,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:31:45,870 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:31:45,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2024-01-27 15:31:46,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:31:46,081 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:31:46,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:31:46,082 INFO L85 PathProgramCache]: Analyzing trace with hash 550317604, now seen corresponding path program 22 times [2024-01-27 15:31:46,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:31:46,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778132921] [2024-01-27 15:31:46,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:31:46,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:31:46,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:31:46,690 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:31:46,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:31:46,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778132921] [2024-01-27 15:31:46,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778132921] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:31:46,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831868869] [2024-01-27 15:31:46,691 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-01-27 15:31:46,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:31:46,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:31:46,692 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:31:46,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2024-01-27 15:31:46,786 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-01-27 15:31:46,786 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:31:46,787 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 25 conjunts are in the unsatisfiable core [2024-01-27 15:31:46,787 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:31:47,002 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:31:47,003 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:31:50,388 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:31:50,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831868869] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:31:50,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:31:50,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 21 [2024-01-27 15:31:50,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154274915] [2024-01-27 15:31:50,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:31:50,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-01-27 15:31:50,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:31:50,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-01-27 15:31:50,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2024-01-27 15:31:50,389 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2024-01-27 15:31:50,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 316 transitions, 3567 flow. Second operand has 22 states, 22 states have (on average 4.7272727272727275) internal successors, (104), 22 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:31:50,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:31:50,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2024-01-27 15:31:50,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:31:52,337 INFO L124 PetriNetUnfolderBase]: 698/1335 cut-off events. [2024-01-27 15:31:52,342 INFO L125 PetriNetUnfolderBase]: For 16414/16414 co-relation queries the response was YES. [2024-01-27 15:31:52,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8726 conditions, 1335 events. 698/1335 cut-off events. For 16414/16414 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 7829 event pairs, 38 based on Foata normal form. 3/1312 useless extension candidates. Maximal degree in co-relation 8607. Up to 995 conditions per place. [2024-01-27 15:31:52,386 INFO L140 encePairwiseOnDemand]: 11/19 looper letters, 263 selfloop transitions, 108 changer transitions 11/383 dead transitions. [2024-01-27 15:31:52,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 383 transitions, 4652 flow [2024-01-27 15:31:52,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-01-27 15:31:52,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2024-01-27 15:31:52,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 209 transitions. [2024-01-27 15:31:52,387 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4230769230769231 [2024-01-27 15:31:52,387 INFO L175 Difference]: Start difference. First operand has 294 places, 316 transitions, 3567 flow. Second operand 26 states and 209 transitions. [2024-01-27 15:31:52,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 383 transitions, 4652 flow [2024-01-27 15:31:52,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 383 transitions, 4406 flow, removed 75 selfloop flow, removed 20 redundant places. [2024-01-27 15:31:52,475 INFO L231 Difference]: Finished difference. Result has 298 places, 319 transitions, 3656 flow [2024-01-27 15:31:52,475 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=3352, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=3656, PETRI_PLACES=298, PETRI_TRANSITIONS=319} [2024-01-27 15:31:52,475 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 277 predicate places. [2024-01-27 15:31:52,476 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 319 transitions, 3656 flow [2024-01-27 15:31:52,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.7272727272727275) internal successors, (104), 22 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:31:52,476 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:31:52,476 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:31:52,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2024-01-27 15:31:52,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:31:52,691 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:31:52,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:31:52,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1264617183, now seen corresponding path program 23 times [2024-01-27 15:31:52,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:31:52,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383467768] [2024-01-27 15:31:52,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:31:52,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:31:52,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:31:53,155 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:31:53,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:31:53,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383467768] [2024-01-27 15:31:53,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383467768] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:31:53,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144405794] [2024-01-27 15:31:53,155 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-01-27 15:31:53,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:31:53,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:31:53,164 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:31:53,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2024-01-27 15:31:53,306 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-01-27 15:31:53,306 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:31:53,307 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 25 conjunts are in the unsatisfiable core [2024-01-27 15:31:53,307 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:31:53,487 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:31:53,487 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:31:54,501 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:31:54,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144405794] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:31:54,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:31:54,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 19 [2024-01-27 15:31:54,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867743028] [2024-01-27 15:31:54,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:31:54,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-01-27 15:31:54,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:31:54,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-01-27 15:31:54,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2024-01-27 15:31:54,503 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2024-01-27 15:31:54,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 319 transitions, 3656 flow. Second operand has 20 states, 20 states have (on average 4.8) internal successors, (96), 20 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:31:54,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:31:54,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2024-01-27 15:31:54,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:31:58,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:32:03,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:32:07,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:32:11,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:32:15,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:32:16,527 INFO L124 PetriNetUnfolderBase]: 691/1324 cut-off events. [2024-01-27 15:32:16,527 INFO L125 PetriNetUnfolderBase]: For 14271/14271 co-relation queries the response was YES. [2024-01-27 15:32:16,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8553 conditions, 1324 events. 691/1324 cut-off events. For 14271/14271 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 7770 event pairs, 92 based on Foata normal form. 2/1300 useless extension candidates. Maximal degree in co-relation 8439. Up to 1178 conditions per place. [2024-01-27 15:32:16,539 INFO L140 encePairwiseOnDemand]: 11/19 looper letters, 272 selfloop transitions, 79 changer transitions 10/362 dead transitions. [2024-01-27 15:32:16,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 362 transitions, 4622 flow [2024-01-27 15:32:16,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-01-27 15:32:16,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2024-01-27 15:32:16,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 186 transitions. [2024-01-27 15:32:16,541 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.391578947368421 [2024-01-27 15:32:16,541 INFO L175 Difference]: Start difference. First operand has 298 places, 319 transitions, 3656 flow. Second operand 25 states and 186 transitions. [2024-01-27 15:32:16,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 362 transitions, 4622 flow [2024-01-27 15:32:16,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 362 transitions, 4329 flow, removed 39 selfloop flow, removed 23 redundant places. [2024-01-27 15:32:16,617 INFO L231 Difference]: Finished difference. Result has 302 places, 322 transitions, 3622 flow [2024-01-27 15:32:16,618 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=3367, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=3622, PETRI_PLACES=302, PETRI_TRANSITIONS=322} [2024-01-27 15:32:16,618 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 281 predicate places. [2024-01-27 15:32:16,618 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 322 transitions, 3622 flow [2024-01-27 15:32:16,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.8) internal successors, (96), 20 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:32:16,618 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:32:16,618 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:32:16,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2024-01-27 15:32:16,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-01-27 15:32:16,830 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:32:16,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:32:16,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1574377982, now seen corresponding path program 24 times [2024-01-27 15:32:16,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:32:16,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171968268] [2024-01-27 15:32:16,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:32:16,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:32:16,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:32:17,283 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:32:17,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:32:17,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171968268] [2024-01-27 15:32:17,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171968268] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:32:17,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362219319] [2024-01-27 15:32:17,284 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-01-27 15:32:17,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:32:17,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:32:17,285 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:32:17,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2024-01-27 15:32:17,393 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2024-01-27 15:32:17,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:32:17,394 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 25 conjunts are in the unsatisfiable core [2024-01-27 15:32:17,395 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:32:17,579 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:32:17,579 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:32:22,321 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~x_1~0 4294967296)) (.cse3 (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse4 (* 4294967296 (div c_~x_1~0 4294967296))) (.cse1 (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296)) (.cse5 (+ (mod c_thread1Thread1of1ForFork0_~i~0 4294967296) 1)) (.cse6 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296))) (and (or (< 4294967294 (+ .cse0 .cse1)) (forall ((v_z_309 Int)) (or (let ((.cse2 (* 2 v_z_309))) (< (+ c_~x_1~0 (* 4294967296 (div (+ c_~x_2~0 .cse2) 4294967296)) .cse3) (+ c_~x_2~0 .cse4 .cse2 1))) (< v_z_309 .cse5) (< .cse6 v_z_309)))) (or (< (+ .cse0 .cse3) 4294967296) (forall ((v_z_309 Int)) (or (< v_z_309 .cse5) (< .cse6 v_z_309) (let ((.cse7 (* 2 v_z_309))) (< (+ c_~x_2~0 4294967294 .cse4 .cse7) (+ .cse1 c_~x_1~0 (* 4294967296 (div (+ c_~x_2~0 .cse7) 4294967296)))))))) (forall ((v_z_309 Int)) (or (let ((.cse8 (* 2 v_z_309))) (< (+ c_~x_1~0 (* 4294967296 (div (+ c_~x_2~0 .cse8) 4294967296)) .cse3) (+ c_~x_2~0 4294967297 .cse4 .cse8))) (< v_z_309 .cse5) (< .cse6 v_z_309))) (forall ((v_z_309 Int)) (or (let ((.cse9 (* 2 v_z_309))) (< (+ c_~x_2~0 .cse4 .cse9) (+ .cse1 c_~x_1~0 2 (* 4294967296 (div (+ c_~x_2~0 .cse9) 4294967296))))) (< v_z_309 .cse5) (< .cse6 v_z_309))))) is different from false [2024-01-27 15:32:26,419 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~x_1~0 4294967296)) (.cse1 (+ (mod c_thread1Thread1of1ForFork0_~i~0 4294967296) 1)) (.cse4 (* 4294967296 (div c_~x_1~0 4294967296))) (.cse2 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296))) (and (or (< 4294967293 .cse0) (forall ((v_z_309 Int)) (or (< v_z_309 .cse1) (< .cse2 v_z_309) (let ((.cse3 (* 2 v_z_309))) (< (+ c_~x_1~0 (* 4294967296 (div (+ c_~x_2~0 .cse3) 4294967296)) 1) (+ c_~x_2~0 .cse4 .cse3)))))) (forall ((v_z_309 Int)) (or (< v_z_309 .cse1) (< .cse2 v_z_309) (let ((.cse5 (* 2 v_z_309))) (< (+ c_~x_1~0 (* 4294967296 (div (+ c_~x_2~0 .cse5) 4294967296))) (+ c_~x_2~0 4294967295 .cse4 .cse5))))) (forall ((v_z_309 Int)) (or (let ((.cse6 (* 2 v_z_309))) (< (+ c_~x_2~0 .cse4 .cse6) (+ c_~x_1~0 3 (* 4294967296 (div (+ c_~x_2~0 .cse6) 4294967296))))) (< v_z_309 .cse1) (< .cse2 v_z_309))) (or (< .cse0 4294967294) (forall ((v_z_309 Int)) (or (< v_z_309 .cse1) (let ((.cse7 (* 2 v_z_309))) (< (+ c_~x_2~0 .cse4 .cse7 4294967293) (+ c_~x_1~0 (* 4294967296 (div (+ c_~x_2~0 .cse7) 4294967296))))) (< .cse2 v_z_309)))))) is different from false [2024-01-27 15:32:26,475 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-01-27 15:32:26,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362219319] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:32:26,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:32:26,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 19 [2024-01-27 15:32:26,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228511599] [2024-01-27 15:32:26,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:32:26,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-01-27 15:32:26,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:32:26,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-01-27 15:32:26,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=245, Unknown=2, NotChecked=66, Total=380 [2024-01-27 15:32:26,476 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2024-01-27 15:32:26,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 322 transitions, 3622 flow. Second operand has 20 states, 20 states have (on average 4.9) internal successors, (98), 20 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:32:26,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:32:26,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2024-01-27 15:32:26,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:32:27,905 INFO L124 PetriNetUnfolderBase]: 714/1365 cut-off events. [2024-01-27 15:32:27,906 INFO L125 PetriNetUnfolderBase]: For 16237/16237 co-relation queries the response was YES. [2024-01-27 15:32:27,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8778 conditions, 1365 events. 714/1365 cut-off events. For 16237/16237 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 8024 event pairs, 90 based on Foata normal form. 2/1341 useless extension candidates. Maximal degree in co-relation 8665. Up to 1238 conditions per place. [2024-01-27 15:32:27,923 INFO L140 encePairwiseOnDemand]: 11/19 looper letters, 310 selfloop transitions, 47 changer transitions 10/368 dead transitions. [2024-01-27 15:32:27,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 368 transitions, 4691 flow [2024-01-27 15:32:27,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-01-27 15:32:27,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-01-27 15:32:27,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 146 transitions. [2024-01-27 15:32:27,924 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40443213296398894 [2024-01-27 15:32:27,925 INFO L175 Difference]: Start difference. First operand has 302 places, 322 transitions, 3622 flow. Second operand 19 states and 146 transitions. [2024-01-27 15:32:27,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 368 transitions, 4691 flow [2024-01-27 15:32:28,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 368 transitions, 4526 flow, removed 39 selfloop flow, removed 20 redundant places. [2024-01-27 15:32:28,070 INFO L231 Difference]: Finished difference. Result has 304 places, 330 transitions, 3755 flow [2024-01-27 15:32:28,070 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=3457, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=3755, PETRI_PLACES=304, PETRI_TRANSITIONS=330} [2024-01-27 15:32:28,070 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 283 predicate places. [2024-01-27 15:32:28,071 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 330 transitions, 3755 flow [2024-01-27 15:32:28,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.9) internal successors, (98), 20 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:32:28,071 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:32:28,071 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:32:28,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2024-01-27 15:32:28,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-01-27 15:32:28,285 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:32:28,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:32:28,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1390957161, now seen corresponding path program 5 times [2024-01-27 15:32:28,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:32:28,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373462225] [2024-01-27 15:32:28,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:32:28,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:32:28,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:32:28,487 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:32:28,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:32:28,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373462225] [2024-01-27 15:32:28,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373462225] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:32:28,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106990412] [2024-01-27 15:32:28,488 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-01-27 15:32:28,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:32:28,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:32:28,489 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:32:28,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2024-01-27 15:32:28,575 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-01-27 15:32:28,576 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:32:28,577 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 16 conjunts are in the unsatisfiable core [2024-01-27 15:32:28,577 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:32:36,692 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:32:36,692 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:32:48,926 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (mod c_~x_1~0 4294967296))) (let ((.cse0 (+ .cse7 4294967296)) (.cse3 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse4 (mod c_~x_2~0 4294967296))) (and (forall ((v_y_316 Int) (v_z_316 Int)) (let ((.cse1 (+ .cse4 v_z_316)) (.cse2 (+ (* v_y_316 4294967296) (* 2863311531 v_z_316)))) (or (= .cse0 .cse1) (< 4294967295 v_z_316) (< .cse2 0) (< .cse1 4294967296) (< .cse3 .cse2)))) (forall ((v_y_316 Int) (v_z_316 Int)) (let ((.cse5 (+ .cse4 v_z_316)) (.cse6 (+ (* v_y_316 4294967296) (* 2863311531 v_z_316)))) (or (= .cse0 .cse5) (< 4294967295 v_z_316) (< .cse6 0) (= .cse7 .cse5) (< v_z_316 0) (< .cse3 .cse6)))) (forall ((v_y_316 Int) (v_z_316 Int)) (let ((.cse9 (+ .cse4 v_z_316)) (.cse8 (+ (* v_y_316 4294967296) (* 2863311531 v_z_316)))) (or (< .cse8 0) (= .cse7 .cse9) (< 4294967295 .cse9) (< v_z_316 0) (< .cse3 .cse8))))))) is different from false [2024-01-27 15:33:17,063 WARN L293 SmtUtils]: Spent 16.04s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-01-27 15:33:27,108 WARN L293 SmtUtils]: Spent 6.01s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-01-27 15:33:35,128 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-01-27 15:33:39,396 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~x_1~0 4294967296))) (let ((.cse3 (+ .cse0 4294967296)) (.cse2 (mod c_~x_2~0 4294967296))) (and (forall ((v_y_316 Int) (v_z_316 Int)) (let ((.cse1 (+ .cse2 v_z_316))) (or (not (= (+ (* v_y_316 4294967296) (* 2863311531 v_z_316)) 0)) (= .cse0 .cse1) (< 4294967295 .cse1) (< v_z_316 0)))) (forall ((v_y_316 Int) (v_z_316 Int)) (let ((.cse4 (+ .cse2 v_z_316))) (or (= .cse3 .cse4) (< 4294967295 v_z_316) (not (= (+ (* v_y_316 4294967296) (* 2863311531 v_z_316)) 0)) (= .cse0 .cse4) (< v_z_316 0)))) (forall ((v_y_316 Int) (v_z_316 Int)) (let ((.cse5 (+ .cse2 v_z_316))) (or (= .cse3 .cse5) (< 4294967295 v_z_316) (not (= (+ (* v_y_316 4294967296) (* 2863311531 v_z_316)) 0)) (< .cse5 4294967296))))))) is different from false [2024-01-27 15:34:08,472 WARN L293 SmtUtils]: Spent 16.12s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-01-27 15:34:24,660 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-01-27 15:34:52,795 WARN L293 SmtUtils]: Spent 16.10s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-01-27 15:35:08,868 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-01-27 15:35:36,940 WARN L293 SmtUtils]: Spent 16.04s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-01-27 15:35:52,989 WARN L293 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-01-27 15:36:03,636 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-01-27 15:36:31,782 WARN L293 SmtUtils]: Spent 16.05s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-01-27 15:36:51,858 WARN L293 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-01-27 15:36:59,884 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-01-27 15:36:59,885 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-01-27 15:36:59,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106990412] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:36:59,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:36:59,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-01-27 15:36:59,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894102347] [2024-01-27 15:36:59,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:36:59,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-01-27 15:36:59,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:36:59,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-01-27 15:36:59,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=129, Unknown=5, NotChecked=50, Total=240 [2024-01-27 15:36:59,886 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2024-01-27 15:36:59,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 330 transitions, 3755 flow. Second operand has 16 states, 16 states have (on average 5.4375) internal successors, (87), 16 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:36:59,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:36:59,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2024-01-27 15:36:59,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:37:04,075 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~x_1~0 4294967296))) (let ((.cse3 (+ .cse0 4294967296)) (.cse2 (mod c_~x_2~0 4294967296))) (and (forall ((v_y_316 Int) (v_z_316 Int)) (let ((.cse1 (+ .cse2 v_z_316))) (or (not (= (+ (* v_y_316 4294967296) (* 2863311531 v_z_316)) 0)) (= .cse0 .cse1) (< 4294967295 .cse1) (< v_z_316 0)))) (forall ((v_y_316 Int) (v_z_316 Int)) (let ((.cse4 (+ .cse2 v_z_316))) (or (= .cse3 .cse4) (< 4294967295 v_z_316) (not (= (+ (* v_y_316 4294967296) (* 2863311531 v_z_316)) 0)) (= .cse0 .cse4) (< v_z_316 0)))) (= c_~x_2~0 0) (= c_~x_1~0 0) (forall ((v_y_316 Int) (v_z_316 Int)) (let ((.cse5 (+ .cse2 v_z_316))) (or (= .cse3 .cse5) (< 4294967295 v_z_316) (not (= (+ (* v_y_316 4294967296) (* 2863311531 v_z_316)) 0)) (< .cse5 4294967296))))))) is different from false [2024-01-27 15:37:08,100 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (mod c_~x_1~0 4294967296))) (let ((.cse0 (+ .cse7 4294967296)) (.cse3 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse4 (mod c_~x_2~0 4294967296))) (and (forall ((v_y_316 Int) (v_z_316 Int)) (let ((.cse1 (+ .cse4 v_z_316)) (.cse2 (+ (* v_y_316 4294967296) (* 2863311531 v_z_316)))) (or (= .cse0 .cse1) (< 4294967295 v_z_316) (< .cse2 0) (< .cse1 4294967296) (< .cse3 .cse2)))) (= c_~x_2~0 0) (= c_thread1Thread1of1ForFork0_~i~0 0) (forall ((v_y_316 Int) (v_z_316 Int)) (let ((.cse5 (+ .cse4 v_z_316)) (.cse6 (+ (* v_y_316 4294967296) (* 2863311531 v_z_316)))) (or (= .cse0 .cse5) (< 4294967295 v_z_316) (< .cse6 0) (= .cse7 .cse5) (< v_z_316 0) (< .cse3 .cse6)))) (forall ((v_y_316 Int) (v_z_316 Int)) (let ((.cse9 (+ .cse4 v_z_316)) (.cse8 (+ (* v_y_316 4294967296) (* 2863311531 v_z_316)))) (or (< .cse8 0) (= .cse7 .cse9) (< 4294967295 .cse9) (< v_z_316 0) (< .cse3 .cse8)))) (= c_~x_1~0 0)))) is different from false [2024-01-27 15:37:08,749 INFO L124 PetriNetUnfolderBase]: 771/1469 cut-off events. [2024-01-27 15:37:08,749 INFO L125 PetriNetUnfolderBase]: For 23403/23403 co-relation queries the response was YES. [2024-01-27 15:37:08,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10266 conditions, 1469 events. 771/1469 cut-off events. For 23403/23403 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 8693 event pairs, 100 based on Foata normal form. 2/1445 useless extension candidates. Maximal degree in co-relation 10137. Up to 1354 conditions per place. [2024-01-27 15:37:08,762 INFO L140 encePairwiseOnDemand]: 9/19 looper letters, 353 selfloop transitions, 24 changer transitions 4/382 dead transitions. [2024-01-27 15:37:08,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 382 transitions, 5406 flow [2024-01-27 15:37:08,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-01-27 15:37:08,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-01-27 15:37:08,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 100 transitions. [2024-01-27 15:37:08,763 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4784688995215311 [2024-01-27 15:37:08,763 INFO L175 Difference]: Start difference. First operand has 304 places, 330 transitions, 3755 flow. Second operand 11 states and 100 transitions. [2024-01-27 15:37:08,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 382 transitions, 5406 flow [2024-01-27 15:37:08,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 382 transitions, 5242 flow, removed 54 selfloop flow, removed 13 redundant places. [2024-01-27 15:37:08,877 INFO L231 Difference]: Finished difference. Result has 305 places, 352 transitions, 4269 flow [2024-01-27 15:37:08,877 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=3619, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4269, PETRI_PLACES=305, PETRI_TRANSITIONS=352} [2024-01-27 15:37:08,878 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 284 predicate places. [2024-01-27 15:37:08,878 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 352 transitions, 4269 flow [2024-01-27 15:37:08,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.4375) internal successors, (87), 16 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:37:08,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:37:08,878 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:37:08,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2024-01-27 15:37:09,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-01-27 15:37:09,090 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:37:09,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:37:09,090 INFO L85 PathProgramCache]: Analyzing trace with hash -117304015, now seen corresponding path program 6 times [2024-01-27 15:37:09,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:37:09,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005713933] [2024-01-27 15:37:09,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:37:09,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:37:09,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:37:09,298 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:37:09,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:37:09,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005713933] [2024-01-27 15:37:09,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005713933] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:37:09,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937282102] [2024-01-27 15:37:09,299 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-01-27 15:37:09,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:37:09,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:37:09,300 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:37:09,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2024-01-27 15:37:09,396 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2024-01-27 15:37:09,397 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:37:09,397 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 14 conjunts are in the unsatisfiable core [2024-01-27 15:37:09,398 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:37:17,505 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:37:17,506 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:37:29,843 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_~x_1~0 4294967296))) (let ((.cse3 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse7 (+ .cse2 4294967296)) (.cse4 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_322 Int) (v_y_322 Int)) (let ((.cse1 (+ .cse4 v_z_322)) (.cse0 (+ (* v_y_322 4294967296) (* 2863311531 v_z_322)))) (or (< .cse0 0) (< 4294967295 .cse1) (= .cse2 .cse1) (< .cse3 .cse0) (< v_z_322 0)))) (forall ((v_z_322 Int) (v_y_322 Int)) (let ((.cse5 (+ (* v_y_322 4294967296) (* 2863311531 v_z_322))) (.cse6 (+ .cse4 v_z_322))) (or (< .cse5 0) (< 4294967295 v_z_322) (< .cse3 .cse5) (< .cse6 4294967296) (= .cse7 .cse6)))) (forall ((v_z_322 Int) (v_y_322 Int)) (let ((.cse8 (+ (* v_y_322 4294967296) (* 2863311531 v_z_322))) (.cse9 (+ .cse4 v_z_322))) (or (< .cse8 0) (< 4294967295 v_z_322) (= .cse2 .cse9) (< .cse3 .cse8) (< v_z_322 0) (= .cse7 .cse9))))))) is different from false [2024-01-27 15:38:02,838 WARN L293 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-01-27 15:38:07,029 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_~x_1~0 4294967296))) (let ((.cse4 (+ .cse1 4294967296)) (.cse2 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_322 Int) (v_y_322 Int)) (let ((.cse0 (+ .cse2 v_z_322))) (or (< 4294967295 .cse0) (= .cse1 .cse0) (not (= (+ (* v_y_322 4294967296) (* 2863311531 v_z_322)) 0)) (< v_z_322 0)))) (forall ((v_z_322 Int) (v_y_322 Int)) (let ((.cse3 (+ .cse2 v_z_322))) (or (< 4294967295 v_z_322) (= .cse1 .cse3) (not (= (+ (* v_y_322 4294967296) (* 2863311531 v_z_322)) 0)) (< v_z_322 0) (= .cse4 .cse3)))) (forall ((v_z_322 Int) (v_y_322 Int)) (let ((.cse5 (+ .cse2 v_z_322))) (or (< 4294967295 v_z_322) (< .cse5 4294967296) (not (= (+ (* v_y_322 4294967296) (* 2863311531 v_z_322)) 0)) (= .cse4 .cse5))))))) is different from false [2024-01-27 15:38:13,375 WARN L293 SmtUtils]: Spent 6.32s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-01-27 15:38:45,436 WARN L293 SmtUtils]: Spent 16.03s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-01-27 15:39:21,580 WARN L293 SmtUtils]: Spent 16.04s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-01-27 15:39:58,157 WARN L293 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-01-27 15:39:58,280 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-01-27 15:39:58,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937282102] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:39:58,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:39:58,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-01-27 15:39:58,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669053970] [2024-01-27 15:39:58,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:39:58,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-01-27 15:39:58,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:39:58,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-01-27 15:39:58,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=129, Unknown=5, NotChecked=50, Total=240 [2024-01-27 15:39:58,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2024-01-27 15:39:58,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 352 transitions, 4269 flow. Second operand has 16 states, 16 states have (on average 5.4375) internal successors, (87), 16 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:39:58,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:39:58,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2024-01-27 15:39:58,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:40:02,464 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_~x_1~0 4294967296))) (let ((.cse4 (+ .cse1 4294967296)) (.cse2 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_322 Int) (v_y_322 Int)) (let ((.cse0 (+ .cse2 v_z_322))) (or (< 4294967295 .cse0) (= .cse1 .cse0) (not (= (+ (* v_y_322 4294967296) (* 2863311531 v_z_322)) 0)) (< v_z_322 0)))) (= c_~x_2~0 0) (forall ((v_z_322 Int) (v_y_322 Int)) (let ((.cse3 (+ .cse2 v_z_322))) (or (< 4294967295 v_z_322) (= .cse1 .cse3) (not (= (+ (* v_y_322 4294967296) (* 2863311531 v_z_322)) 0)) (< v_z_322 0) (= .cse4 .cse3)))) (forall ((v_z_322 Int) (v_y_322 Int)) (let ((.cse5 (+ .cse2 v_z_322))) (or (< 4294967295 v_z_322) (< .cse5 4294967296) (not (= (+ (* v_y_322 4294967296) (* 2863311531 v_z_322)) 0)) (= .cse4 .cse5)))) (= c_~x_1~0 0)))) is different from false [2024-01-27 15:40:06,821 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_~x_1~0 4294967296))) (let ((.cse3 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse7 (+ .cse2 4294967296)) (.cse4 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_322 Int) (v_y_322 Int)) (let ((.cse1 (+ .cse4 v_z_322)) (.cse0 (+ (* v_y_322 4294967296) (* 2863311531 v_z_322)))) (or (< .cse0 0) (< 4294967295 .cse1) (= .cse2 .cse1) (< .cse3 .cse0) (< v_z_322 0)))) (= c_~x_2~0 0) (forall ((v_z_322 Int) (v_y_322 Int)) (let ((.cse5 (+ (* v_y_322 4294967296) (* 2863311531 v_z_322))) (.cse6 (+ .cse4 v_z_322))) (or (< .cse5 0) (< 4294967295 v_z_322) (< .cse3 .cse5) (< .cse6 4294967296) (= .cse7 .cse6)))) (forall ((v_z_322 Int) (v_y_322 Int)) (let ((.cse8 (+ (* v_y_322 4294967296) (* 2863311531 v_z_322))) (.cse9 (+ .cse4 v_z_322))) (or (< .cse8 0) (< 4294967295 v_z_322) (= .cse2 .cse9) (< .cse3 .cse8) (< v_z_322 0) (= .cse7 .cse9)))) (= c_thread1Thread1of1ForFork0_~i~0 0) (= c_~x_1~0 0)))) is different from false [2024-01-27 15:40:07,735 INFO L124 PetriNetUnfolderBase]: 830/1603 cut-off events. [2024-01-27 15:40:07,735 INFO L125 PetriNetUnfolderBase]: For 32307/32307 co-relation queries the response was YES. [2024-01-27 15:40:07,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12388 conditions, 1603 events. 830/1603 cut-off events. For 32307/32307 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 9804 event pairs, 193 based on Foata normal form. 2/1579 useless extension candidates. Maximal degree in co-relation 12224. Up to 1429 conditions per place. [2024-01-27 15:40:07,749 INFO L140 encePairwiseOnDemand]: 9/19 looper letters, 375 selfloop transitions, 42 changer transitions 4/422 dead transitions. [2024-01-27 15:40:07,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 422 transitions, 6622 flow [2024-01-27 15:40:07,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-01-27 15:40:07,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-01-27 15:40:07,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 100 transitions. [2024-01-27 15:40:07,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4784688995215311 [2024-01-27 15:40:07,750 INFO L175 Difference]: Start difference. First operand has 305 places, 352 transitions, 4269 flow. Second operand 11 states and 100 transitions. [2024-01-27 15:40:07,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 422 transitions, 6622 flow [2024-01-27 15:40:07,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 422 transitions, 6201 flow, removed 208 selfloop flow, removed 1 redundant places. [2024-01-27 15:40:07,914 INFO L231 Difference]: Finished difference. Result has 323 places, 392 transitions, 5219 flow [2024-01-27 15:40:07,915 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=4058, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5219, PETRI_PLACES=323, PETRI_TRANSITIONS=392} [2024-01-27 15:40:07,915 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 302 predicate places. [2024-01-27 15:40:07,915 INFO L495 AbstractCegarLoop]: Abstraction has has 323 places, 392 transitions, 5219 flow [2024-01-27 15:40:07,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.4375) internal successors, (87), 16 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:40:07,916 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:40:07,916 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:40:07,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2024-01-27 15:40:08,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:40:08,127 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:40:08,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:40:08,127 INFO L85 PathProgramCache]: Analyzing trace with hash 69248795, now seen corresponding path program 7 times [2024-01-27 15:40:08,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:40:08,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395858562] [2024-01-27 15:40:08,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:40:08,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:40:08,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:40:08,304 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:40:08,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:40:08,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395858562] [2024-01-27 15:40:08,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395858562] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:40:08,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493564429] [2024-01-27 15:40:08,305 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-01-27 15:40:08,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:40:08,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:40:08,306 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:40:08,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2024-01-27 15:40:08,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:40:08,405 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 24 conjunts are in the unsatisfiable core [2024-01-27 15:40:08,406 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:40:16,766 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:40:16,766 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:40:45,936 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~x_1~0 4294967296))) (let ((.cse5 (+ .cse0 4294967296)) (.cse2 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse4 (mod c_~x_2~0 4294967296))) (and (forall ((v_y_328 Int) (v_z_328 Int)) (let ((.cse1 (+ .cse4 v_z_328)) (.cse3 (+ (* v_y_328 4294967296) (* 2863311531 v_z_328)))) (or (= .cse0 .cse1) (< 4294967295 .cse1) (< .cse2 .cse3) (< .cse3 0) (< v_z_328 0)))) (forall ((v_y_328 Int) (v_z_328 Int)) (let ((.cse6 (+ .cse4 v_z_328)) (.cse7 (+ (* v_y_328 4294967296) (* 2863311531 v_z_328)))) (or (< 4294967295 v_z_328) (= .cse5 .cse6) (< .cse6 4294967296) (< .cse2 .cse7) (< .cse7 0)))) (forall ((v_y_328 Int) (v_z_328 Int)) (let ((.cse8 (+ .cse4 v_z_328)) (.cse9 (+ (* v_y_328 4294967296) (* 2863311531 v_z_328)))) (or (< 4294967295 v_z_328) (= .cse5 .cse8) (= .cse0 .cse8) (< .cse2 .cse9) (< .cse9 0) (< v_z_328 0))))))) is different from false [2024-01-27 15:41:21,305 WARN L293 SmtUtils]: Spent 16.07s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-01-27 15:41:25,470 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~x_1~0 4294967296))) (let ((.cse3 (+ .cse0 4294967296)) (.cse2 (mod c_~x_2~0 4294967296))) (and (forall ((v_y_328 Int) (v_z_328 Int)) (let ((.cse1 (+ .cse2 v_z_328))) (or (= .cse0 .cse1) (< 4294967295 .cse1) (not (= (+ (* v_y_328 4294967296) (* 2863311531 v_z_328)) 0)) (< v_z_328 0)))) (forall ((v_y_328 Int) (v_z_328 Int)) (let ((.cse4 (+ .cse2 v_z_328))) (or (< 4294967295 v_z_328) (= .cse3 .cse4) (= .cse0 .cse4) (not (= (+ (* v_y_328 4294967296) (* 2863311531 v_z_328)) 0)) (< v_z_328 0)))) (forall ((v_y_328 Int) (v_z_328 Int)) (let ((.cse5 (+ .cse2 v_z_328))) (or (< 4294967295 v_z_328) (= .cse3 .cse5) (< .cse5 4294967296) (not (= (+ (* v_y_328 4294967296) (* 2863311531 v_z_328)) 0)))))))) is different from false [2024-01-27 15:41:35,155 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-01-27 15:42:10,619 WARN L293 SmtUtils]: Spent 16.03s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-01-27 15:42:47,979 WARN L293 SmtUtils]: Spent 16.04s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-01-27 15:42:47,980 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:42:47,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493564429] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:42:47,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:42:47,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 21 [2024-01-27 15:42:47,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760886598] [2024-01-27 15:42:47,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:42:47,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-01-27 15:42:47,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:42:47,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-01-27 15:42:47,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=277, Unknown=9, NotChecked=74, Total=462 [2024-01-27 15:42:47,981 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2024-01-27 15:42:47,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 392 transitions, 5219 flow. Second operand has 22 states, 22 states have (on average 4.909090909090909) internal successors, (108), 22 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:42:47,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:42:47,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2024-01-27 15:42:47,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:42:52,087 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~x_1~0 4294967296))) (let ((.cse3 (+ .cse0 4294967296)) (.cse2 (mod c_~x_2~0 4294967296))) (and (forall ((v_y_328 Int) (v_z_328 Int)) (let ((.cse1 (+ .cse2 v_z_328))) (or (= .cse0 .cse1) (< 4294967295 .cse1) (not (= (+ (* v_y_328 4294967296) (* 2863311531 v_z_328)) 0)) (< v_z_328 0)))) (= c_~x_2~0 0) (forall ((v_y_328 Int) (v_z_328 Int)) (let ((.cse4 (+ .cse2 v_z_328))) (or (< 4294967295 v_z_328) (= .cse3 .cse4) (= .cse0 .cse4) (not (= (+ (* v_y_328 4294967296) (* 2863311531 v_z_328)) 0)) (< v_z_328 0)))) (= c_~x_1~0 0) (forall ((v_y_328 Int) (v_z_328 Int)) (let ((.cse5 (+ .cse2 v_z_328))) (or (< 4294967295 v_z_328) (= .cse3 .cse5) (< .cse5 4294967296) (not (= (+ (* v_y_328 4294967296) (* 2863311531 v_z_328)) 0)))))))) is different from false [2024-01-27 15:42:56,271 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~x_1~0 4294967296))) (let ((.cse5 (+ .cse0 4294967296)) (.cse2 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse4 (mod c_~x_2~0 4294967296))) (and (forall ((v_y_328 Int) (v_z_328 Int)) (let ((.cse1 (+ .cse4 v_z_328)) (.cse3 (+ (* v_y_328 4294967296) (* 2863311531 v_z_328)))) (or (= .cse0 .cse1) (< 4294967295 .cse1) (< .cse2 .cse3) (< .cse3 0) (< v_z_328 0)))) (forall ((v_y_328 Int) (v_z_328 Int)) (let ((.cse6 (+ .cse4 v_z_328)) (.cse7 (+ (* v_y_328 4294967296) (* 2863311531 v_z_328)))) (or (< 4294967295 v_z_328) (= .cse5 .cse6) (< .cse6 4294967296) (< .cse2 .cse7) (< .cse7 0)))) (forall ((v_y_328 Int) (v_z_328 Int)) (let ((.cse8 (+ .cse4 v_z_328)) (.cse9 (+ (* v_y_328 4294967296) (* 2863311531 v_z_328)))) (or (< 4294967295 v_z_328) (= .cse5 .cse8) (= .cse0 .cse8) (< .cse2 .cse9) (< .cse9 0) (< v_z_328 0)))) (= c_~x_2~0 0) (= c_thread1Thread1of1ForFork0_~i~0 0) (= c_~x_1~0 0)))) is different from false [2024-01-27 15:43:00,711 WARN L854 $PredicateComparison]: unable to prove that (and (= c_~x_2~0 0) (= c_thread1Thread1of1ForFork0_~i~0 0) (= c_thread2Thread1of1ForFork1_~i~1 0) (or (let ((.cse0 (mod c_~x_1~0 4294967296))) (let ((.cse5 (+ .cse0 4294967296)) (.cse2 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse4 (mod c_~x_2~0 4294967296))) (and (forall ((v_y_328 Int) (v_z_328 Int)) (let ((.cse1 (+ .cse4 v_z_328)) (.cse3 (+ (* v_y_328 4294967296) (* 2863311531 v_z_328)))) (or (= .cse0 .cse1) (< 4294967295 .cse1) (< .cse2 .cse3) (< .cse3 0) (< v_z_328 0)))) (forall ((v_y_328 Int) (v_z_328 Int)) (let ((.cse6 (+ .cse4 v_z_328)) (.cse7 (+ (* v_y_328 4294967296) (* 2863311531 v_z_328)))) (or (< 4294967295 v_z_328) (= .cse5 .cse6) (< .cse6 4294967296) (< .cse2 .cse7) (< .cse7 0)))) (forall ((v_y_328 Int) (v_z_328 Int)) (let ((.cse8 (+ .cse4 v_z_328)) (.cse9 (+ (* v_y_328 4294967296) (* 2863311531 v_z_328)))) (or (< 4294967295 v_z_328) (= .cse5 .cse8) (= .cse0 .cse8) (< .cse2 .cse9) (< .cse9 0) (< v_z_328 0))))))) (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296) (+ (mod c_thread2Thread1of1ForFork1_~i~1 4294967296) 1))) (= c_~x_1~0 0)) is different from false [2024-01-27 15:43:06,901 INFO L124 PetriNetUnfolderBase]: 934/1789 cut-off events. [2024-01-27 15:43:06,902 INFO L125 PetriNetUnfolderBase]: For 42310/42310 co-relation queries the response was YES. [2024-01-27 15:43:06,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14886 conditions, 1789 events. 934/1789 cut-off events. For 42310/42310 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 11058 event pairs, 235 based on Foata normal form. 3/1764 useless extension candidates. Maximal degree in co-relation 14711. Up to 1629 conditions per place. [2024-01-27 15:43:06,922 INFO L140 encePairwiseOnDemand]: 8/19 looper letters, 423 selfloop transitions, 54 changer transitions 12/490 dead transitions. [2024-01-27 15:43:06,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 490 transitions, 8135 flow [2024-01-27 15:43:06,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-01-27 15:43:06,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-01-27 15:43:06,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 171 transitions. [2024-01-27 15:43:06,923 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-01-27 15:43:06,923 INFO L175 Difference]: Start difference. First operand has 323 places, 392 transitions, 5219 flow. Second operand 21 states and 171 transitions. [2024-01-27 15:43:06,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 490 transitions, 8135 flow [2024-01-27 15:43:07,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 490 transitions, 7927 flow, removed 104 selfloop flow, removed 0 redundant places. [2024-01-27 15:43:07,232 INFO L231 Difference]: Finished difference. Result has 360 places, 445 transitions, 6772 flow [2024-01-27 15:43:07,232 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=5011, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=6772, PETRI_PLACES=360, PETRI_TRANSITIONS=445} [2024-01-27 15:43:07,233 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 339 predicate places. [2024-01-27 15:43:07,233 INFO L495 AbstractCegarLoop]: Abstraction has has 360 places, 445 transitions, 6772 flow [2024-01-27 15:43:07,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.909090909090909) internal successors, (108), 22 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:43:07,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:43:07,233 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:43:07,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2024-01-27 15:43:07,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-01-27 15:43:07,445 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:43:07,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:43:07,445 INFO L85 PathProgramCache]: Analyzing trace with hash 765081244, now seen corresponding path program 25 times [2024-01-27 15:43:07,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:43:07,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500242310] [2024-01-27 15:43:07,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:43:07,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:43:07,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:43:07,844 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:43:07,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:43:07,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500242310] [2024-01-27 15:43:07,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500242310] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:43:07,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38635453] [2024-01-27 15:43:07,844 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-01-27 15:43:07,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:43:07,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:43:07,846 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:43:07,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2024-01-27 15:43:08,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:43:08,067 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 25 conjunts are in the unsatisfiable core [2024-01-27 15:43:08,068 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:43:12,407 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:43:12,407 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:43:13,052 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:43:13,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38635453] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:43:13,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:43:13,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 20 [2024-01-27 15:43:13,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533107695] [2024-01-27 15:43:13,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:43:13,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-01-27 15:43:13,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:43:13,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-01-27 15:43:13,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=337, Unknown=1, NotChecked=0, Total=420 [2024-01-27 15:43:13,057 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2024-01-27 15:43:13,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 445 transitions, 6772 flow. Second operand has 21 states, 21 states have (on average 4.761904761904762) internal successors, (100), 21 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:43:13,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:43:13,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2024-01-27 15:43:13,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:43:17,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:43:22,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:43:26,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:43:31,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:43:35,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:43:35,892 INFO L124 PetriNetUnfolderBase]: 1096/2115 cut-off events. [2024-01-27 15:43:35,892 INFO L125 PetriNetUnfolderBase]: For 82686/82686 co-relation queries the response was YES. [2024-01-27 15:43:35,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19923 conditions, 2115 events. 1096/2115 cut-off events. For 82686/82686 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 13671 event pairs, 197 based on Foata normal form. 4/2091 useless extension candidates. Maximal degree in co-relation 19729. Up to 1434 conditions per place. [2024-01-27 15:43:35,916 INFO L140 encePairwiseOnDemand]: 11/19 looper letters, 363 selfloop transitions, 191 changer transitions 29/584 dead transitions. [2024-01-27 15:43:35,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 584 transitions, 10468 flow [2024-01-27 15:43:35,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-01-27 15:43:35,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2024-01-27 15:43:35,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 262 transitions. [2024-01-27 15:43:35,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4178628389154705 [2024-01-27 15:43:35,918 INFO L175 Difference]: Start difference. First operand has 360 places, 445 transitions, 6772 flow. Second operand 33 states and 262 transitions. [2024-01-27 15:43:35,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 584 transitions, 10468 flow [2024-01-27 15:43:36,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 584 transitions, 9260 flow, removed 604 selfloop flow, removed 2 redundant places. [2024-01-27 15:43:36,218 INFO L231 Difference]: Finished difference. Result has 400 places, 496 transitions, 7748 flow [2024-01-27 15:43:36,218 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=5852, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=150, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=7748, PETRI_PLACES=400, PETRI_TRANSITIONS=496} [2024-01-27 15:43:36,219 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 379 predicate places. [2024-01-27 15:43:36,219 INFO L495 AbstractCegarLoop]: Abstraction has has 400 places, 496 transitions, 7748 flow [2024-01-27 15:43:36,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.761904761904762) internal successors, (100), 21 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:43:36,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:43:36,219 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:43:36,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2024-01-27 15:43:36,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-01-27 15:43:36,425 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:43:36,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:43:36,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1176626721, now seen corresponding path program 8 times [2024-01-27 15:43:36,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:43:36,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784531771] [2024-01-27 15:43:36,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:43:36,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:43:36,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:43:36,651 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:43:36,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:43:36,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784531771] [2024-01-27 15:43:36,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784531771] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:43:36,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975305386] [2024-01-27 15:43:36,652 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 15:43:36,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:43:36,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:43:36,653 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:43:36,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2024-01-27 15:43:36,757 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 15:43:36,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:43:36,758 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 16 conjunts are in the unsatisfiable core [2024-01-27 15:43:36,758 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:43:44,941 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:43:44,942 INFO L327 TraceCheckSpWp]: Computing backward predicates... Killed by 15