./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread/queue.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/queue.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4d771c5dc4ab027f123135a7de4324b9be0c6bae288f44d0eaffc15d1836bd60 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:32:36,816 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:32:36,869 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 06:32:36,874 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:32:36,874 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:32:36,896 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:32:36,897 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:32:36,897 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:32:36,897 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:32:36,897 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:32:36,897 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:32:36,897 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:32:36,898 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:32:36,898 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:32:36,898 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:32:36,898 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:32:36,898 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:32:36,898 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:32:36,898 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:32:36,898 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:32:36,898 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:32:36,898 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:32:36,898 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:32:36,898 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:32:36,898 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:32:36,898 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:32:36,898 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:32:36,898 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:32:36,898 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:32:36,900 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:32:36,900 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:32:36,900 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:32:36,900 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:32:36,900 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:32:36,900 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:32:36,900 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:32:36,901 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:32:36,901 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:32:36,901 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:32:36,901 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:32:36,901 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:32:36,901 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:32:36,901 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:32:36,901 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:32:36,901 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:32:36,901 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:32:36,901 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:32:36,901 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:32:36,901 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:32:36,901 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:32:36,901 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 ! overflow) ) 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 -> 4d771c5dc4ab027f123135a7de4324b9be0c6bae288f44d0eaffc15d1836bd60 [2025-01-10 06:32:37,129 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:32:37,138 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:32:37,140 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:32:37,141 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:32:37,141 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:32:37,142 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/queue.i [2025-01-10 06:32:38,355 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5aefbdbf8/8a8edbe101e54609b5786c13aa5d84f0/FLAGcbfe61ce6 [2025-01-10 06:32:38,673 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:32:38,674 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/queue.i [2025-01-10 06:32:38,689 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5aefbdbf8/8a8edbe101e54609b5786c13aa5d84f0/FLAGcbfe61ce6 [2025-01-10 06:32:38,938 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5aefbdbf8/8a8edbe101e54609b5786c13aa5d84f0 [2025-01-10 06:32:38,940 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:32:38,941 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:32:38,942 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:32:38,942 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:32:38,946 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:32:38,947 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:32:38" (1/1) ... [2025-01-10 06:32:38,948 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@208c0a39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:32:38, skipping insertion in model container [2025-01-10 06:32:38,948 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:32:38" (1/1) ... [2025-01-10 06:32:38,983 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:32:39,384 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:32:39,400 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:32:39,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:32:39,509 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:32:39,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:32:39 WrapperNode [2025-01-10 06:32:39,510 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:32:39,511 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:32:39,512 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:32:39,512 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:32:39,516 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:32:39" (1/1) ... [2025-01-10 06:32:39,531 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:32:39" (1/1) ... [2025-01-10 06:32:39,554 INFO L138 Inliner]: procedures = 274, calls = 107, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 307 [2025-01-10 06:32:39,555 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:32:39,555 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:32:39,555 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:32:39,555 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:32:39,565 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:32:39" (1/1) ... [2025-01-10 06:32:39,565 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:32:39" (1/1) ... [2025-01-10 06:32:39,569 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:32:39" (1/1) ... [2025-01-10 06:32:39,599 INFO L175 MemorySlicer]: Split 92 memory accesses to 5 slices as follows [2, 8, 5, 23, 54]. 59 percent of accesses are in the largest equivalence class. The 58 initializations are split as follows [2, 8, 5, 20, 23]. The 16 writes are split as follows [0, 0, 0, 2, 14]. [2025-01-10 06:32:39,601 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:32:39" (1/1) ... [2025-01-10 06:32:39,601 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:32:39" (1/1) ... [2025-01-10 06:32:39,610 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:32:39" (1/1) ... [2025-01-10 06:32:39,611 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:32:39" (1/1) ... [2025-01-10 06:32:39,613 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:32:39" (1/1) ... [2025-01-10 06:32:39,614 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:32:39" (1/1) ... [2025-01-10 06:32:39,615 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:32:39" (1/1) ... [2025-01-10 06:32:39,616 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:32:39,617 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:32:39,620 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:32:39,620 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:32:39,621 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:32:39" (1/1) ... [2025-01-10 06:32:39,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:32:39,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:32:39,653 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 06:32:39,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 06:32:39,672 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-01-10 06:32:39,672 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-01-10 06:32:39,672 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-01-10 06:32:39,673 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-01-10 06:32:39,673 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 06:32:39,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:32:39,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:32:39,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 06:32:39,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 06:32:39,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-10 06:32:39,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:32:39,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:32:39,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 06:32:39,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 06:32:39,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-10 06:32:39,674 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 06:32:39,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:32:39,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:32:39,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:32:39,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 06:32:39,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 06:32:39,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-10 06:32:39,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:32:39,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:32:39,676 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 06:32:39,800 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:32:39,801 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:32:40,161 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:32:40,162 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:32:40,530 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:32:40,531 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 06:32:40,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:32:40 BoogieIcfgContainer [2025-01-10 06:32:40,531 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:32:40,533 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:32:40,533 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:32:40,538 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:32:40,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:32:38" (1/3) ... [2025-01-10 06:32:40,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c94b592 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:32:40, skipping insertion in model container [2025-01-10 06:32:40,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:32:39" (2/3) ... [2025-01-10 06:32:40,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c94b592 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:32:40, skipping insertion in model container [2025-01-10 06:32:40,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:32:40" (3/3) ... [2025-01-10 06:32:40,540 INFO L128 eAbstractionObserver]: Analyzing ICFG queue.i [2025-01-10 06:32:40,552 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:32:40,553 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG queue.i that has 3 procedures, 77 locations, 1 initial locations, 2 loop locations, and 18 error locations. [2025-01-10 06:32:40,553 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:32:40,620 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 06:32:40,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 86 transitions, 186 flow [2025-01-10 06:32:40,691 INFO L124 PetriNetUnfolderBase]: 10/84 cut-off events. [2025-01-10 06:32:40,695 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 06:32:40,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 84 events. 10/84 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 216 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2025-01-10 06:32:40,698 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 86 transitions, 186 flow [2025-01-10 06:32:40,702 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 80 transitions, 169 flow [2025-01-10 06:32:40,709 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:32:40,720 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@64945636, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:32:40,721 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2025-01-10 06:32:40,727 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:32:40,729 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-01-10 06:32:40,729 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:32:40,730 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:32:40,730 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:32:40,730 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-01-10 06:32:40,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:32:40,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1565587992, now seen corresponding path program 1 times [2025-01-10 06:32:40,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:32:40,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837441231] [2025-01-10 06:32:40,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:40,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:32:40,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:32:40,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:32:40,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:40,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:32:41,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:32:41,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:32:41,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837441231] [2025-01-10 06:32:41,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837441231] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:32:41,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:32:41,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:32:41,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015807212] [2025-01-10 06:32:41,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:32:41,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:32:41,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:32:41,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:32:41,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:32:41,416 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 86 [2025-01-10 06:32:41,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 80 transitions, 169 flow. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 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) [2025-01-10 06:32:41,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:32:41,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 86 [2025-01-10 06:32:41,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:32:41,863 INFO L124 PetriNetUnfolderBase]: 1236/2547 cut-off events. [2025-01-10 06:32:41,864 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2025-01-10 06:32:41,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4531 conditions, 2547 events. 1236/2547 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 15934 event pairs, 205 based on Foata normal form. 48/2218 useless extension candidates. Maximal degree in co-relation 4460. Up to 1613 conditions per place. [2025-01-10 06:32:41,882 INFO L140 encePairwiseOnDemand]: 78/86 looper letters, 74 selfloop transitions, 6 changer transitions 0/110 dead transitions. [2025-01-10 06:32:41,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 110 transitions, 395 flow [2025-01-10 06:32:41,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:32:41,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:32:41,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 210 transitions. [2025-01-10 06:32:41,892 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6104651162790697 [2025-01-10 06:32:41,894 INFO L175 Difference]: Start difference. First operand has 78 places, 80 transitions, 169 flow. Second operand 4 states and 210 transitions. [2025-01-10 06:32:41,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 110 transitions, 395 flow [2025-01-10 06:32:41,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 110 transitions, 388 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:32:41,904 INFO L231 Difference]: Finished difference. Result has 81 places, 83 transitions, 204 flow [2025-01-10 06:32:41,906 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=204, PETRI_PLACES=81, PETRI_TRANSITIONS=83} [2025-01-10 06:32:41,908 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 3 predicate places. [2025-01-10 06:32:41,908 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 83 transitions, 204 flow [2025-01-10 06:32:41,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 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) [2025-01-10 06:32:41,908 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:32:41,909 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:32:41,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:32:41,909 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-01-10 06:32:41,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:32:41,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1288588335, now seen corresponding path program 1 times [2025-01-10 06:32:41,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:32:41,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796293382] [2025-01-10 06:32:41,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:41,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:32:41,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:32:41,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:32:41,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:41,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:32:42,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:32:42,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:32:42,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796293382] [2025-01-10 06:32:42,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796293382] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:32:42,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:32:42,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:32:42,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861731182] [2025-01-10 06:32:42,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:32:42,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:32:42,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:32:42,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:32:42,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:32:42,264 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 86 [2025-01-10 06:32:42,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 83 transitions, 204 flow. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 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) [2025-01-10 06:32:42,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:32:42,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 86 [2025-01-10 06:32:42,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:32:42,680 INFO L124 PetriNetUnfolderBase]: 1242/2600 cut-off events. [2025-01-10 06:32:42,680 INFO L125 PetriNetUnfolderBase]: For 456/460 co-relation queries the response was YES. [2025-01-10 06:32:42,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4910 conditions, 2600 events. 1242/2600 cut-off events. For 456/460 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 16689 event pairs, 264 based on Foata normal form. 40/2318 useless extension candidates. Maximal degree in co-relation 4140. Up to 1757 conditions per place. [2025-01-10 06:32:42,693 INFO L140 encePairwiseOnDemand]: 81/86 looper letters, 82 selfloop transitions, 6 changer transitions 0/118 dead transitions. [2025-01-10 06:32:42,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 118 transitions, 460 flow [2025-01-10 06:32:42,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:32:42,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:32:42,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 250 transitions. [2025-01-10 06:32:42,695 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5813953488372093 [2025-01-10 06:32:42,695 INFO L175 Difference]: Start difference. First operand has 81 places, 83 transitions, 204 flow. Second operand 5 states and 250 transitions. [2025-01-10 06:32:42,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 118 transitions, 460 flow [2025-01-10 06:32:42,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 118 transitions, 454 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:32:42,701 INFO L231 Difference]: Finished difference. Result has 85 places, 84 transitions, 221 flow [2025-01-10 06:32:42,702 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=221, PETRI_PLACES=85, PETRI_TRANSITIONS=84} [2025-01-10 06:32:42,702 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 7 predicate places. [2025-01-10 06:32:42,703 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 84 transitions, 221 flow [2025-01-10 06:32:42,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 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) [2025-01-10 06:32:42,703 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:32:42,703 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:32:42,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:32:42,703 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-01-10 06:32:42,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:32:42,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1382835570, now seen corresponding path program 1 times [2025-01-10 06:32:42,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:32:42,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467299558] [2025-01-10 06:32:42,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:42,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:32:42,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:32:42,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:32:42,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:42,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:32:42,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:32:42,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:32:42,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467299558] [2025-01-10 06:32:42,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467299558] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:32:42,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:32:42,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:32:42,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897438170] [2025-01-10 06:32:42,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:32:42,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:32:42,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:32:42,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:32:42,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:32:42,937 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 86 [2025-01-10 06:32:42,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 84 transitions, 221 flow. Second operand has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 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) [2025-01-10 06:32:42,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:32:42,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 86 [2025-01-10 06:32:42,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:32:43,292 INFO L124 PetriNetUnfolderBase]: 1322/2710 cut-off events. [2025-01-10 06:32:43,293 INFO L125 PetriNetUnfolderBase]: For 536/554 co-relation queries the response was YES. [2025-01-10 06:32:43,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5219 conditions, 2710 events. 1322/2710 cut-off events. For 536/554 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 17291 event pairs, 266 based on Foata normal form. 44/2400 useless extension candidates. Maximal degree in co-relation 4439. Up to 1803 conditions per place. [2025-01-10 06:32:43,305 INFO L140 encePairwiseOnDemand]: 77/86 looper letters, 103 selfloop transitions, 11 changer transitions 0/144 dead transitions. [2025-01-10 06:32:43,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 144 transitions, 589 flow [2025-01-10 06:32:43,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:32:43,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 06:32:43,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 341 transitions. [2025-01-10 06:32:43,308 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5664451827242525 [2025-01-10 06:32:43,308 INFO L175 Difference]: Start difference. First operand has 85 places, 84 transitions, 221 flow. Second operand 7 states and 341 transitions. [2025-01-10 06:32:43,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 144 transitions, 589 flow [2025-01-10 06:32:43,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 144 transitions, 575 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-01-10 06:32:43,313 INFO L231 Difference]: Finished difference. Result has 91 places, 90 transitions, 276 flow [2025-01-10 06:32:43,313 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=276, PETRI_PLACES=91, PETRI_TRANSITIONS=90} [2025-01-10 06:32:43,314 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 13 predicate places. [2025-01-10 06:32:43,314 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 90 transitions, 276 flow [2025-01-10 06:32:43,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 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) [2025-01-10 06:32:43,315 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:32:43,315 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:32:43,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:32:43,315 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-01-10 06:32:43,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:32:43,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1404943297, now seen corresponding path program 1 times [2025-01-10 06:32:43,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:32:43,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23036360] [2025-01-10 06:32:43,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:43,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:32:43,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:32:43,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:32:43,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:43,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:32:43,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:32:43,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:32:43,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23036360] [2025-01-10 06:32:43,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23036360] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:32:43,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:32:43,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:32:43,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399301595] [2025-01-10 06:32:43,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:32:43,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:32:43,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:32:43,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:32:43,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:32:43,402 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 86 [2025-01-10 06:32:43,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 90 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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) [2025-01-10 06:32:43,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:32:43,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 86 [2025-01-10 06:32:43,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:32:43,627 INFO L124 PetriNetUnfolderBase]: 1023/2392 cut-off events. [2025-01-10 06:32:43,627 INFO L125 PetriNetUnfolderBase]: For 554/554 co-relation queries the response was YES. [2025-01-10 06:32:43,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4364 conditions, 2392 events. 1023/2392 cut-off events. For 554/554 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 14084 event pairs, 483 based on Foata normal form. 41/2132 useless extension candidates. Maximal degree in co-relation 4354. Up to 885 conditions per place. [2025-01-10 06:32:43,638 INFO L140 encePairwiseOnDemand]: 82/86 looper letters, 64 selfloop transitions, 3 changer transitions 0/97 dead transitions. [2025-01-10 06:32:43,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 97 transitions, 374 flow [2025-01-10 06:32:43,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:32:43,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:32:43,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2025-01-10 06:32:43,640 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6821705426356589 [2025-01-10 06:32:43,640 INFO L175 Difference]: Start difference. First operand has 91 places, 90 transitions, 276 flow. Second operand 3 states and 176 transitions. [2025-01-10 06:32:43,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 97 transitions, 374 flow [2025-01-10 06:32:43,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 97 transitions, 335 flow, removed 4 selfloop flow, removed 13 redundant places. [2025-01-10 06:32:43,643 INFO L231 Difference]: Finished difference. Result has 75 places, 76 transitions, 169 flow [2025-01-10 06:32:43,643 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=169, PETRI_PLACES=75, PETRI_TRANSITIONS=76} [2025-01-10 06:32:43,643 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, -3 predicate places. [2025-01-10 06:32:43,644 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 76 transitions, 169 flow [2025-01-10 06:32:43,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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) [2025-01-10 06:32:43,644 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:32:43,644 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:32:43,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:32:43,644 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-01-10 06:32:43,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:32:43,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1530780638, now seen corresponding path program 1 times [2025-01-10 06:32:43,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:32:43,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668399048] [2025-01-10 06:32:43,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:43,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:32:43,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:32:43,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:32:43,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:43,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:32:43,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:32:43,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:32:43,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668399048] [2025-01-10 06:32:43,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668399048] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:32:43,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:32:43,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:32:43,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576871899] [2025-01-10 06:32:43,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:32:43,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:32:43,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:32:43,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:32:43,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:32:43,703 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 86 [2025-01-10 06:32:43,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 76 transitions, 169 flow. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 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) [2025-01-10 06:32:43,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:32:43,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 86 [2025-01-10 06:32:43,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:32:44,125 INFO L124 PetriNetUnfolderBase]: 1890/4150 cut-off events. [2025-01-10 06:32:44,126 INFO L125 PetriNetUnfolderBase]: For 190/190 co-relation queries the response was YES. [2025-01-10 06:32:44,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7405 conditions, 4150 events. 1890/4150 cut-off events. For 190/190 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 26860 event pairs, 960 based on Foata normal form. 138/3776 useless extension candidates. Maximal degree in co-relation 7400. Up to 1980 conditions per place. [2025-01-10 06:32:44,146 INFO L140 encePairwiseOnDemand]: 80/86 looper letters, 113 selfloop transitions, 3 changer transitions 0/144 dead transitions. [2025-01-10 06:32:44,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 144 transitions, 554 flow [2025-01-10 06:32:44,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:32:44,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:32:44,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 252 transitions. [2025-01-10 06:32:44,148 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7325581395348837 [2025-01-10 06:32:44,148 INFO L175 Difference]: Start difference. First operand has 75 places, 76 transitions, 169 flow. Second operand 4 states and 252 transitions. [2025-01-10 06:32:44,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 144 transitions, 554 flow [2025-01-10 06:32:44,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 144 transitions, 548 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:32:44,152 INFO L231 Difference]: Finished difference. Result has 79 places, 78 transitions, 190 flow [2025-01-10 06:32:44,153 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=190, PETRI_PLACES=79, PETRI_TRANSITIONS=78} [2025-01-10 06:32:44,155 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 1 predicate places. [2025-01-10 06:32:44,155 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 78 transitions, 190 flow [2025-01-10 06:32:44,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 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) [2025-01-10 06:32:44,155 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:32:44,155 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:32:44,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:32:44,156 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-01-10 06:32:44,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:32:44,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1948205179, now seen corresponding path program 1 times [2025-01-10 06:32:44,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:32:44,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595379128] [2025-01-10 06:32:44,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:44,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:32:44,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 06:32:44,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 06:32:44,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:44,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:32:44,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:32:44,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:32:44,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595379128] [2025-01-10 06:32:44,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595379128] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:32:44,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:32:44,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:32:44,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228167095] [2025-01-10 06:32:44,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:32:44,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:32:44,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:32:44,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:32:44,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:32:44,397 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 86 [2025-01-10 06:32:44,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 78 transitions, 190 flow. Second operand has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 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) [2025-01-10 06:32:44,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:32:44,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 86 [2025-01-10 06:32:44,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:32:44,785 INFO L124 PetriNetUnfolderBase]: 1715/3852 cut-off events. [2025-01-10 06:32:44,785 INFO L125 PetriNetUnfolderBase]: For 790/910 co-relation queries the response was YES. [2025-01-10 06:32:44,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7356 conditions, 3852 events. 1715/3852 cut-off events. For 790/910 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 25030 event pairs, 279 based on Foata normal form. 0/3403 useless extension candidates. Maximal degree in co-relation 7349. Up to 2409 conditions per place. [2025-01-10 06:32:44,810 INFO L140 encePairwiseOnDemand]: 80/86 looper letters, 75 selfloop transitions, 5 changer transitions 0/110 dead transitions. [2025-01-10 06:32:44,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 110 transitions, 468 flow [2025-01-10 06:32:44,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:32:44,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:32:44,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 252 transitions. [2025-01-10 06:32:44,812 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.586046511627907 [2025-01-10 06:32:44,812 INFO L175 Difference]: Start difference. First operand has 79 places, 78 transitions, 190 flow. Second operand 5 states and 252 transitions. [2025-01-10 06:32:44,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 110 transitions, 468 flow [2025-01-10 06:32:44,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 110 transitions, 460 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:32:44,816 INFO L231 Difference]: Finished difference. Result has 82 places, 77 transitions, 196 flow [2025-01-10 06:32:44,817 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=196, PETRI_PLACES=82, PETRI_TRANSITIONS=77} [2025-01-10 06:32:44,818 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 4 predicate places. [2025-01-10 06:32:44,818 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 77 transitions, 196 flow [2025-01-10 06:32:44,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 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) [2025-01-10 06:32:44,818 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:32:44,819 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:32:44,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:32:44,819 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-01-10 06:32:44,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:32:44,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1130443737, now seen corresponding path program 1 times [2025-01-10 06:32:44,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:32:44,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259880246] [2025-01-10 06:32:44,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:44,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:32:44,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 06:32:44,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 06:32:44,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:44,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:32:45,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:32:45,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:32:45,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259880246] [2025-01-10 06:32:45,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259880246] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:32:45,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:32:45,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 06:32:45,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340239547] [2025-01-10 06:32:45,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:32:45,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:32:45,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:32:45,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:32:45,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:32:45,800 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 86 [2025-01-10 06:32:45,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 77 transitions, 196 flow. Second operand has 10 states, 10 states have (on average 29.7) internal successors, (297), 10 states have internal predecessors, (297), 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) [2025-01-10 06:32:45,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:32:45,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 86 [2025-01-10 06:32:45,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:32:46,527 INFO L124 PetriNetUnfolderBase]: 2309/4799 cut-off events. [2025-01-10 06:32:46,527 INFO L125 PetriNetUnfolderBase]: For 925/1077 co-relation queries the response was YES. [2025-01-10 06:32:46,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9576 conditions, 4799 events. 2309/4799 cut-off events. For 925/1077 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 31297 event pairs, 444 based on Foata normal form. 22/4282 useless extension candidates. Maximal degree in co-relation 9569. Up to 2448 conditions per place. [2025-01-10 06:32:46,544 INFO L140 encePairwiseOnDemand]: 77/86 looper letters, 135 selfloop transitions, 8 changer transitions 0/169 dead transitions. [2025-01-10 06:32:46,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 169 transitions, 783 flow [2025-01-10 06:32:46,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 06:32:46,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 06:32:46,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 379 transitions. [2025-01-10 06:32:46,548 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4896640826873385 [2025-01-10 06:32:46,548 INFO L175 Difference]: Start difference. First operand has 82 places, 77 transitions, 196 flow. Second operand 9 states and 379 transitions. [2025-01-10 06:32:46,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 169 transitions, 783 flow [2025-01-10 06:32:46,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 169 transitions, 773 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 06:32:46,552 INFO L231 Difference]: Finished difference. Result has 89 places, 80 transitions, 223 flow [2025-01-10 06:32:46,552 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=223, PETRI_PLACES=89, PETRI_TRANSITIONS=80} [2025-01-10 06:32:46,553 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 11 predicate places. [2025-01-10 06:32:46,553 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 80 transitions, 223 flow [2025-01-10 06:32:46,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 29.7) internal successors, (297), 10 states have internal predecessors, (297), 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) [2025-01-10 06:32:46,554 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:32:46,554 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:32:46,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:32:46,554 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-01-10 06:32:46,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:32:46,554 INFO L85 PathProgramCache]: Analyzing trace with hash -708057256, now seen corresponding path program 1 times [2025-01-10 06:32:46,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:32:46,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195147668] [2025-01-10 06:32:46,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:46,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:32:46,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 06:32:46,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 06:32:46,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:46,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:32:46,614 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:32:46,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:32:46,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195147668] [2025-01-10 06:32:46,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195147668] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:32:46,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656426697] [2025-01-10 06:32:46,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:46,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:32:46,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:32:46,618 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:32:46,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 06:32:46,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 06:32:46,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 06:32:46,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:46,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:32:46,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:32:46,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:32:46,750 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:32:46,750 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:32:46,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656426697] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:32:46,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:32:46,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-01-10 06:32:46,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752260310] [2025-01-10 06:32:46,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:32:46,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:32:46,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:32:46,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:32:46,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:32:46,756 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 86 [2025-01-10 06:32:46,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 80 transitions, 223 flow. Second operand has 5 states, 5 states have (on average 36.0) internal successors, (180), 5 states have internal predecessors, (180), 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) [2025-01-10 06:32:46,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:32:46,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 86 [2025-01-10 06:32:46,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:32:47,193 INFO L124 PetriNetUnfolderBase]: 2140/4279 cut-off events. [2025-01-10 06:32:47,194 INFO L125 PetriNetUnfolderBase]: For 783/867 co-relation queries the response was YES. [2025-01-10 06:32:47,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8984 conditions, 4279 events. 2140/4279 cut-off events. For 783/867 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 26715 event pairs, 138 based on Foata normal form. 83/3990 useless extension candidates. Maximal degree in co-relation 8975. Up to 2115 conditions per place. [2025-01-10 06:32:47,211 INFO L140 encePairwiseOnDemand]: 82/86 looper letters, 106 selfloop transitions, 5 changer transitions 0/139 dead transitions. [2025-01-10 06:32:47,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 139 transitions, 613 flow [2025-01-10 06:32:47,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:32:47,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:32:47,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 233 transitions. [2025-01-10 06:32:47,214 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6773255813953488 [2025-01-10 06:32:47,214 INFO L175 Difference]: Start difference. First operand has 89 places, 80 transitions, 223 flow. Second operand 4 states and 233 transitions. [2025-01-10 06:32:47,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 139 transitions, 613 flow [2025-01-10 06:32:47,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 139 transitions, 591 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 06:32:47,219 INFO L231 Difference]: Finished difference. Result has 87 places, 79 transitions, 221 flow [2025-01-10 06:32:47,219 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=221, PETRI_PLACES=87, PETRI_TRANSITIONS=79} [2025-01-10 06:32:47,220 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 9 predicate places. [2025-01-10 06:32:47,220 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 79 transitions, 221 flow [2025-01-10 06:32:47,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.0) internal successors, (180), 5 states have internal predecessors, (180), 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) [2025-01-10 06:32:47,220 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:32:47,220 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:32:47,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 06:32:47,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:32:47,421 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-01-10 06:32:47,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:32:47,422 INFO L85 PathProgramCache]: Analyzing trace with hash -684016613, now seen corresponding path program 1 times [2025-01-10 06:32:47,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:32:47,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970767888] [2025-01-10 06:32:47,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:47,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:32:47,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 06:32:47,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 06:32:47,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:47,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:32:48,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:32:48,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:32:48,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970767888] [2025-01-10 06:32:48,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970767888] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:32:48,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:32:48,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 06:32:48,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050641216] [2025-01-10 06:32:48,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:32:48,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:32:48,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:32:48,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:32:48,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:32:48,131 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 86 [2025-01-10 06:32:48,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 79 transitions, 221 flow. Second operand has 8 states, 8 states have (on average 30.125) internal successors, (241), 8 states have internal predecessors, (241), 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) [2025-01-10 06:32:48,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:32:48,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 86 [2025-01-10 06:32:48,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:32:48,703 INFO L124 PetriNetUnfolderBase]: 2277/4734 cut-off events. [2025-01-10 06:32:48,704 INFO L125 PetriNetUnfolderBase]: For 2384/2456 co-relation queries the response was YES. [2025-01-10 06:32:48,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10219 conditions, 4734 events. 2277/4734 cut-off events. For 2384/2456 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 30848 event pairs, 444 based on Foata normal form. 22/4295 useless extension candidates. Maximal degree in co-relation 10209. Up to 2448 conditions per place. [2025-01-10 06:32:48,730 INFO L140 encePairwiseOnDemand]: 77/86 looper letters, 134 selfloop transitions, 8 changer transitions 0/167 dead transitions. [2025-01-10 06:32:48,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 167 transitions, 866 flow [2025-01-10 06:32:48,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 06:32:48,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 06:32:48,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 378 transitions. [2025-01-10 06:32:48,733 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4883720930232558 [2025-01-10 06:32:48,733 INFO L175 Difference]: Start difference. First operand has 87 places, 79 transitions, 221 flow. Second operand 9 states and 378 transitions. [2025-01-10 06:32:48,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 167 transitions, 866 flow [2025-01-10 06:32:48,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 167 transitions, 783 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 06:32:48,740 INFO L231 Difference]: Finished difference. Result has 91 places, 78 transitions, 220 flow [2025-01-10 06:32:48,740 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=220, PETRI_PLACES=91, PETRI_TRANSITIONS=78} [2025-01-10 06:32:48,741 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 13 predicate places. [2025-01-10 06:32:48,742 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 78 transitions, 220 flow [2025-01-10 06:32:48,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 30.125) internal successors, (241), 8 states have internal predecessors, (241), 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) [2025-01-10 06:32:48,742 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:32:48,742 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:32:48,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 06:32:48,742 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-01-10 06:32:48,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:32:48,743 INFO L85 PathProgramCache]: Analyzing trace with hash -474937556, now seen corresponding path program 1 times [2025-01-10 06:32:48,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:32:48,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212950550] [2025-01-10 06:32:48,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:48,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:32:48,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 06:32:48,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 06:32:48,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:48,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:32:48,784 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:32:48,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:32:48,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212950550] [2025-01-10 06:32:48,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212950550] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:32:48,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:32:48,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:32:48,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140085172] [2025-01-10 06:32:48,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:32:48,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:32:48,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:32:48,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:32:48,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:32:48,792 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 86 [2025-01-10 06:32:48,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 78 transitions, 220 flow. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 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) [2025-01-10 06:32:48,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:32:48,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 86 [2025-01-10 06:32:48,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:32:49,137 INFO L124 PetriNetUnfolderBase]: 1994/4203 cut-off events. [2025-01-10 06:32:49,138 INFO L125 PetriNetUnfolderBase]: For 1066/1110 co-relation queries the response was YES. [2025-01-10 06:32:49,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8640 conditions, 4203 events. 1994/4203 cut-off events. For 1066/1110 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 27091 event pairs, 368 based on Foata normal form. 0/3890 useless extension candidates. Maximal degree in co-relation 8630. Up to 1995 conditions per place. [2025-01-10 06:32:49,154 INFO L140 encePairwiseOnDemand]: 81/86 looper letters, 99 selfloop transitions, 6 changer transitions 6/138 dead transitions. [2025-01-10 06:32:49,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 138 transitions, 620 flow [2025-01-10 06:32:49,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:32:49,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:32:49,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 233 transitions. [2025-01-10 06:32:49,156 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6773255813953488 [2025-01-10 06:32:49,156 INFO L175 Difference]: Start difference. First operand has 91 places, 78 transitions, 220 flow. Second operand 4 states and 233 transitions. [2025-01-10 06:32:49,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 138 transitions, 620 flow [2025-01-10 06:32:49,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 138 transitions, 586 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 06:32:49,160 INFO L231 Difference]: Finished difference. Result has 88 places, 76 transitions, 220 flow [2025-01-10 06:32:49,160 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=220, PETRI_PLACES=88, PETRI_TRANSITIONS=76} [2025-01-10 06:32:49,161 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 10 predicate places. [2025-01-10 06:32:49,161 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 76 transitions, 220 flow [2025-01-10 06:32:49,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 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) [2025-01-10 06:32:49,162 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:32:49,162 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:32:49,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:32:49,162 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-01-10 06:32:49,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:32:49,163 INFO L85 PathProgramCache]: Analyzing trace with hash 270290570, now seen corresponding path program 1 times [2025-01-10 06:32:49,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:32:49,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402364344] [2025-01-10 06:32:49,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:49,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:32:49,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 06:32:49,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 06:32:49,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:49,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:32:49,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:32:49,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:32:49,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402364344] [2025-01-10 06:32:49,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402364344] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:32:49,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:32:49,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:32:49,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110882220] [2025-01-10 06:32:49,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:32:49,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:32:49,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:32:49,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:32:49,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:32:49,220 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 86 [2025-01-10 06:32:49,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 76 transitions, 220 flow. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 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) [2025-01-10 06:32:49,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:32:49,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 86 [2025-01-10 06:32:49,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:32:49,668 INFO L124 PetriNetUnfolderBase]: 2829/5823 cut-off events. [2025-01-10 06:32:49,668 INFO L125 PetriNetUnfolderBase]: For 3581/3591 co-relation queries the response was YES. [2025-01-10 06:32:49,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12846 conditions, 5823 events. 2829/5823 cut-off events. For 3581/3591 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 39971 event pairs, 1541 based on Foata normal form. 144/5581 useless extension candidates. Maximal degree in co-relation 12835. Up to 3624 conditions per place. [2025-01-10 06:32:49,690 INFO L140 encePairwiseOnDemand]: 78/86 looper letters, 93 selfloop transitions, 3 changer transitions 0/121 dead transitions. [2025-01-10 06:32:49,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 121 transitions, 578 flow [2025-01-10 06:32:49,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:32:49,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:32:49,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 220 transitions. [2025-01-10 06:32:49,692 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6395348837209303 [2025-01-10 06:32:49,692 INFO L175 Difference]: Start difference. First operand has 88 places, 76 transitions, 220 flow. Second operand 4 states and 220 transitions. [2025-01-10 06:32:49,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 121 transitions, 578 flow [2025-01-10 06:32:49,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 121 transitions, 556 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:32:49,697 INFO L231 Difference]: Finished difference. Result has 90 places, 78 transitions, 240 flow [2025-01-10 06:32:49,697 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=240, PETRI_PLACES=90, PETRI_TRANSITIONS=78} [2025-01-10 06:32:49,697 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 12 predicate places. [2025-01-10 06:32:49,697 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 78 transitions, 240 flow [2025-01-10 06:32:49,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 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) [2025-01-10 06:32:49,697 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:32:49,697 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:32:49,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 06:32:49,697 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-01-10 06:32:49,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:32:49,698 INFO L85 PathProgramCache]: Analyzing trace with hash -209940992, now seen corresponding path program 1 times [2025-01-10 06:32:49,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:32:49,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547806792] [2025-01-10 06:32:49,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:49,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:32:49,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 06:32:49,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 06:32:49,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:49,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:32:50,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:32:50,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:32:50,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547806792] [2025-01-10 06:32:50,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547806792] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:32:50,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:32:50,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 06:32:50,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407892586] [2025-01-10 06:32:50,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:32:50,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:32:50,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:32:50,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:32:50,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:32:50,070 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 86 [2025-01-10 06:32:50,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 78 transitions, 240 flow. Second operand has 8 states, 8 states have (on average 32.5) internal successors, (260), 8 states have internal predecessors, (260), 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) [2025-01-10 06:32:50,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:32:50,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 86 [2025-01-10 06:32:50,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:32:50,753 INFO L124 PetriNetUnfolderBase]: 3059/6186 cut-off events. [2025-01-10 06:32:50,753 INFO L125 PetriNetUnfolderBase]: For 2728/2794 co-relation queries the response was YES. [2025-01-10 06:32:50,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14128 conditions, 6186 events. 3059/6186 cut-off events. For 2728/2794 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 42360 event pairs, 484 based on Foata normal form. 0/5752 useless extension candidates. Maximal degree in co-relation 14114. Up to 2649 conditions per place. [2025-01-10 06:32:50,783 INFO L140 encePairwiseOnDemand]: 71/86 looper letters, 150 selfloop transitions, 15 changer transitions 2/192 dead transitions. [2025-01-10 06:32:50,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 192 transitions, 1000 flow [2025-01-10 06:32:50,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:32:50,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:32:50,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 445 transitions. [2025-01-10 06:32:50,786 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5174418604651163 [2025-01-10 06:32:50,786 INFO L175 Difference]: Start difference. First operand has 90 places, 78 transitions, 240 flow. Second operand 10 states and 445 transitions. [2025-01-10 06:32:50,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 192 transitions, 1000 flow [2025-01-10 06:32:50,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 192 transitions, 997 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:32:50,796 INFO L231 Difference]: Finished difference. Result has 101 places, 85 transitions, 312 flow [2025-01-10 06:32:50,796 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=312, PETRI_PLACES=101, PETRI_TRANSITIONS=85} [2025-01-10 06:32:50,800 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 23 predicate places. [2025-01-10 06:32:50,801 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 85 transitions, 312 flow [2025-01-10 06:32:50,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 32.5) internal successors, (260), 8 states have internal predecessors, (260), 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) [2025-01-10 06:32:50,801 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:32:50,801 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:32:50,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 06:32:50,801 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-01-10 06:32:50,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:32:50,802 INFO L85 PathProgramCache]: Analyzing trace with hash 2081764717, now seen corresponding path program 1 times [2025-01-10 06:32:50,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:32:50,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263508886] [2025-01-10 06:32:50,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:50,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:32:50,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 06:32:50,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 06:32:50,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:50,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:32:51,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:32:51,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:32:51,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263508886] [2025-01-10 06:32:51,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263508886] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:32:51,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:32:51,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 06:32:51,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859197494] [2025-01-10 06:32:51,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:32:51,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:32:51,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:32:51,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:32:51,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:32:51,174 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 86 [2025-01-10 06:32:51,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 85 transitions, 312 flow. Second operand has 8 states, 8 states have (on average 34.375) internal successors, (275), 8 states have internal predecessors, (275), 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) [2025-01-10 06:32:51,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:32:51,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 86 [2025-01-10 06:32:51,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:32:51,727 INFO L124 PetriNetUnfolderBase]: 2804/5885 cut-off events. [2025-01-10 06:32:51,728 INFO L125 PetriNetUnfolderBase]: For 3276/3342 co-relation queries the response was YES. [2025-01-10 06:32:51,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14446 conditions, 5885 events. 2804/5885 cut-off events. For 3276/3342 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 41031 event pairs, 484 based on Foata normal form. 44/5767 useless extension candidates. Maximal degree in co-relation 14430. Up to 2649 conditions per place. [2025-01-10 06:32:51,758 INFO L140 encePairwiseOnDemand]: 71/86 looper letters, 147 selfloop transitions, 14 changer transitions 2/191 dead transitions. [2025-01-10 06:32:51,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 191 transitions, 1051 flow [2025-01-10 06:32:51,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:32:51,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:32:51,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 461 transitions. [2025-01-10 06:32:51,760 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.536046511627907 [2025-01-10 06:32:51,760 INFO L175 Difference]: Start difference. First operand has 101 places, 85 transitions, 312 flow. Second operand 10 states and 461 transitions. [2025-01-10 06:32:51,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 191 transitions, 1051 flow [2025-01-10 06:32:51,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 191 transitions, 1039 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-10 06:32:51,769 INFO L231 Difference]: Finished difference. Result has 106 places, 85 transitions, 332 flow [2025-01-10 06:32:51,769 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=332, PETRI_PLACES=106, PETRI_TRANSITIONS=85} [2025-01-10 06:32:51,770 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 28 predicate places. [2025-01-10 06:32:51,770 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 85 transitions, 332 flow [2025-01-10 06:32:51,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 34.375) internal successors, (275), 8 states have internal predecessors, (275), 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) [2025-01-10 06:32:51,770 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:32:51,770 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:32:51,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 06:32:51,770 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-01-10 06:32:51,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:32:51,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1710906304, now seen corresponding path program 1 times [2025-01-10 06:32:51,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:32:51,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325781573] [2025-01-10 06:32:51,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:51,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:32:51,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 06:32:51,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 06:32:51,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:51,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:32:51,842 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:32:51,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:32:51,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325781573] [2025-01-10 06:32:51,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325781573] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:32:51,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208826977] [2025-01-10 06:32:51,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:51,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:32:51,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:32:51,846 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:32:51,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 06:32:51,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 06:32:51,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 06:32:51,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:51,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:32:51,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:32:51,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:32:51,976 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:32:51,976 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:32:51,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208826977] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:32:51,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:32:51,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-01-10 06:32:51,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996185382] [2025-01-10 06:32:51,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:32:51,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:32:51,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:32:51,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:32:51,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:32:51,991 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 86 [2025-01-10 06:32:51,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 85 transitions, 332 flow. Second operand has 5 states, 5 states have (on average 35.6) internal successors, (178), 5 states have internal predecessors, (178), 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) [2025-01-10 06:32:51,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:32:51,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 86 [2025-01-10 06:32:51,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:32:52,537 INFO L124 PetriNetUnfolderBase]: 3093/6107 cut-off events. [2025-01-10 06:32:52,538 INFO L125 PetriNetUnfolderBase]: For 3811/3845 co-relation queries the response was YES. [2025-01-10 06:32:52,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15687 conditions, 6107 events. 3093/6107 cut-off events. For 3811/3845 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 40625 event pairs, 680 based on Foata normal form. 150/6007 useless extension candidates. Maximal degree in co-relation 15669. Up to 3349 conditions per place. [2025-01-10 06:32:52,577 INFO L140 encePairwiseOnDemand]: 81/86 looper letters, 81 selfloop transitions, 5 changer transitions 0/111 dead transitions. [2025-01-10 06:32:52,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 111 transitions, 604 flow [2025-01-10 06:32:52,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:32:52,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:32:52,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 195 transitions. [2025-01-10 06:32:52,579 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5668604651162791 [2025-01-10 06:32:52,579 INFO L175 Difference]: Start difference. First operand has 106 places, 85 transitions, 332 flow. Second operand 4 states and 195 transitions. [2025-01-10 06:32:52,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 111 transitions, 604 flow [2025-01-10 06:32:52,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 111 transitions, 580 flow, removed 1 selfloop flow, removed 8 redundant places. [2025-01-10 06:32:52,593 INFO L231 Difference]: Finished difference. Result has 99 places, 83 transitions, 310 flow [2025-01-10 06:32:52,593 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=310, PETRI_PLACES=99, PETRI_TRANSITIONS=83} [2025-01-10 06:32:52,594 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 21 predicate places. [2025-01-10 06:32:52,594 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 83 transitions, 310 flow [2025-01-10 06:32:52,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.6) internal successors, (178), 5 states have internal predecessors, (178), 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) [2025-01-10 06:32:52,594 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:32:52,594 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:32:52,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 06:32:52,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:32:52,795 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-01-10 06:32:52,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:32:52,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1498488744, now seen corresponding path program 1 times [2025-01-10 06:32:52,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:32:52,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783581813] [2025-01-10 06:32:52,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:52,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:32:52,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-10 06:32:52,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-10 06:32:52,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:52,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:32:52,839 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:32:52,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:32:52,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783581813] [2025-01-10 06:32:52,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783581813] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:32:52,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:32:52,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:32:52,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665670794] [2025-01-10 06:32:52,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:32:52,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:32:52,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:32:52,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:32:52,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:32:52,853 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 86 [2025-01-10 06:32:52,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 83 transitions, 310 flow. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 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) [2025-01-10 06:32:52,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:32:52,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 86 [2025-01-10 06:32:52,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:32:53,310 INFO L124 PetriNetUnfolderBase]: 2751/5655 cut-off events. [2025-01-10 06:32:53,310 INFO L125 PetriNetUnfolderBase]: For 3828/3848 co-relation queries the response was YES. [2025-01-10 06:32:53,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14316 conditions, 5655 events. 2751/5655 cut-off events. For 3828/3848 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 38036 event pairs, 724 based on Foata normal form. 150/5661 useless extension candidates. Maximal degree in co-relation 14298. Up to 2840 conditions per place. [2025-01-10 06:32:53,336 INFO L140 encePairwiseOnDemand]: 80/86 looper letters, 85 selfloop transitions, 6 changer transitions 0/116 dead transitions. [2025-01-10 06:32:53,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 116 transitions, 614 flow [2025-01-10 06:32:53,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:32:53,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:32:53,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 200 transitions. [2025-01-10 06:32:53,337 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5813953488372093 [2025-01-10 06:32:53,337 INFO L175 Difference]: Start difference. First operand has 99 places, 83 transitions, 310 flow. Second operand 4 states and 200 transitions. [2025-01-10 06:32:53,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 116 transitions, 614 flow [2025-01-10 06:32:53,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 116 transitions, 604 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:32:53,345 INFO L231 Difference]: Finished difference. Result has 98 places, 82 transitions, 312 flow [2025-01-10 06:32:53,345 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=312, PETRI_PLACES=98, PETRI_TRANSITIONS=82} [2025-01-10 06:32:53,346 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 20 predicate places. [2025-01-10 06:32:53,346 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 82 transitions, 312 flow [2025-01-10 06:32:53,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 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) [2025-01-10 06:32:53,346 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:32:53,346 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:32:53,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 06:32:53,347 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-01-10 06:32:53,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:32:53,347 INFO L85 PathProgramCache]: Analyzing trace with hash 683341040, now seen corresponding path program 1 times [2025-01-10 06:32:53,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:32:53,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970604015] [2025-01-10 06:32:53,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:53,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:32:53,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 06:32:53,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 06:32:53,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:53,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:32:53,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:32:53,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:32:53,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970604015] [2025-01-10 06:32:53,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970604015] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:32:53,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:32:53,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:32:53,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794584252] [2025-01-10 06:32:53,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:32:53,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:32:53,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:32:53,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:32:53,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:32:53,406 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 86 [2025-01-10 06:32:53,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 82 transitions, 312 flow. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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) [2025-01-10 06:32:53,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:32:53,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 86 [2025-01-10 06:32:53,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:32:53,678 INFO L124 PetriNetUnfolderBase]: 1748/3960 cut-off events. [2025-01-10 06:32:53,679 INFO L125 PetriNetUnfolderBase]: For 3710/3710 co-relation queries the response was YES. [2025-01-10 06:32:53,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10345 conditions, 3960 events. 1748/3960 cut-off events. For 3710/3710 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 25782 event pairs, 514 based on Foata normal form. 170/4052 useless extension candidates. Maximal degree in co-relation 10327. Up to 1956 conditions per place. [2025-01-10 06:32:53,699 INFO L140 encePairwiseOnDemand]: 80/86 looper letters, 64 selfloop transitions, 6 changer transitions 0/97 dead transitions. [2025-01-10 06:32:53,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 97 transitions, 522 flow [2025-01-10 06:32:53,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:32:53,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:32:53,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 166 transitions. [2025-01-10 06:32:53,701 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6434108527131783 [2025-01-10 06:32:53,701 INFO L175 Difference]: Start difference. First operand has 98 places, 82 transitions, 312 flow. Second operand 3 states and 166 transitions. [2025-01-10 06:32:53,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 97 transitions, 522 flow [2025-01-10 06:32:53,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 97 transitions, 503 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-01-10 06:32:53,707 INFO L231 Difference]: Finished difference. Result has 98 places, 80 transitions, 298 flow [2025-01-10 06:32:53,708 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=298, PETRI_PLACES=98, PETRI_TRANSITIONS=80} [2025-01-10 06:32:53,708 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 20 predicate places. [2025-01-10 06:32:53,709 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 80 transitions, 298 flow [2025-01-10 06:32:53,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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) [2025-01-10 06:32:53,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:32:53,709 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:32:53,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 06:32:53,709 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-01-10 06:32:53,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:32:53,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1510978649, now seen corresponding path program 1 times [2025-01-10 06:32:53,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:32:53,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173320021] [2025-01-10 06:32:53,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:53,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:32:53,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-10 06:32:53,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 06:32:53,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:53,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:32:54,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:32:54,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:32:54,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173320021] [2025-01-10 06:32:54,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173320021] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:32:54,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:32:54,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 06:32:54,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563119779] [2025-01-10 06:32:54,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:32:54,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:32:54,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:32:54,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:32:54,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:32:54,138 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 86 [2025-01-10 06:32:54,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 80 transitions, 298 flow. Second operand has 10 states, 10 states have (on average 29.9) internal successors, (299), 10 states have internal predecessors, (299), 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) [2025-01-10 06:32:54,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:32:54,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 86 [2025-01-10 06:32:54,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:32:54,868 INFO L124 PetriNetUnfolderBase]: 2803/5783 cut-off events. [2025-01-10 06:32:54,868 INFO L125 PetriNetUnfolderBase]: For 4765/4765 co-relation queries the response was YES. [2025-01-10 06:32:54,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15640 conditions, 5783 events. 2803/5783 cut-off events. For 4765/4765 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 39141 event pairs, 615 based on Foata normal form. 30/5641 useless extension candidates. Maximal degree in co-relation 15621. Up to 1939 conditions per place. [2025-01-10 06:32:54,901 INFO L140 encePairwiseOnDemand]: 68/86 looper letters, 156 selfloop transitions, 27 changer transitions 1/204 dead transitions. [2025-01-10 06:32:54,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 204 transitions, 1216 flow [2025-01-10 06:32:54,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 06:32:54,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-10 06:32:54,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 525 transitions. [2025-01-10 06:32:54,904 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.436046511627907 [2025-01-10 06:32:54,904 INFO L175 Difference]: Start difference. First operand has 98 places, 80 transitions, 298 flow. Second operand 14 states and 525 transitions. [2025-01-10 06:32:54,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 204 transitions, 1216 flow [2025-01-10 06:32:54,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 204 transitions, 1202 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:32:54,918 INFO L231 Difference]: Finished difference. Result has 117 places, 91 transitions, 440 flow [2025-01-10 06:32:54,918 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=440, PETRI_PLACES=117, PETRI_TRANSITIONS=91} [2025-01-10 06:32:54,919 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 39 predicate places. [2025-01-10 06:32:54,919 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 91 transitions, 440 flow [2025-01-10 06:32:54,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 29.9) internal successors, (299), 10 states have internal predecessors, (299), 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) [2025-01-10 06:32:54,919 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:32:54,919 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:32:54,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 06:32:54,920 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-01-10 06:32:54,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:32:54,920 INFO L85 PathProgramCache]: Analyzing trace with hash 400665411, now seen corresponding path program 1 times [2025-01-10 06:32:54,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:32:54,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682916996] [2025-01-10 06:32:54,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:54,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:32:54,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 06:32:54,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 06:32:54,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:54,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:32:55,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:32:55,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:32:55,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682916996] [2025-01-10 06:32:55,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682916996] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:32:55,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:32:55,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:32:55,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390856716] [2025-01-10 06:32:55,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:32:55,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:32:55,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:32:55,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:32:55,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:32:55,389 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 86 [2025-01-10 06:32:55,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 91 transitions, 440 flow. Second operand has 8 states, 8 states have (on average 35.25) internal successors, (282), 8 states have internal predecessors, (282), 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) [2025-01-10 06:32:55,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:32:55,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 86 [2025-01-10 06:32:55,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:32:55,941 INFO L124 PetriNetUnfolderBase]: 2321/5017 cut-off events. [2025-01-10 06:32:55,941 INFO L125 PetriNetUnfolderBase]: For 5589/5599 co-relation queries the response was YES. [2025-01-10 06:32:55,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14239 conditions, 5017 events. 2321/5017 cut-off events. For 5589/5599 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 33145 event pairs, 475 based on Foata normal form. 36/4961 useless extension candidates. Maximal degree in co-relation 14212. Up to 2679 conditions per place. [2025-01-10 06:32:55,999 INFO L140 encePairwiseOnDemand]: 75/86 looper letters, 125 selfloop transitions, 10 changer transitions 2/165 dead transitions. [2025-01-10 06:32:55,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 165 transitions, 1034 flow [2025-01-10 06:32:55,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 06:32:55,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 06:32:56,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 396 transitions. [2025-01-10 06:32:56,000 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5116279069767442 [2025-01-10 06:32:56,000 INFO L175 Difference]: Start difference. First operand has 117 places, 91 transitions, 440 flow. Second operand 9 states and 396 transitions. [2025-01-10 06:32:56,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 165 transitions, 1034 flow [2025-01-10 06:32:56,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 165 transitions, 1028 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-01-10 06:32:56,010 INFO L231 Difference]: Finished difference. Result has 125 places, 90 transitions, 447 flow [2025-01-10 06:32:56,010 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=447, PETRI_PLACES=125, PETRI_TRANSITIONS=90} [2025-01-10 06:32:56,011 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 47 predicate places. [2025-01-10 06:32:56,011 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 90 transitions, 447 flow [2025-01-10 06:32:56,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 35.25) internal successors, (282), 8 states have internal predecessors, (282), 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) [2025-01-10 06:32:56,011 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:32:56,011 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:32:56,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 06:32:56,011 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-01-10 06:32:56,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:32:56,012 INFO L85 PathProgramCache]: Analyzing trace with hash 748571557, now seen corresponding path program 1 times [2025-01-10 06:32:56,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:32:56,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592794831] [2025-01-10 06:32:56,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:56,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:32:56,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-10 06:32:56,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 06:32:56,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:56,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:32:56,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:32:56,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:32:56,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592794831] [2025-01-10 06:32:56,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592794831] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:32:56,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:32:56,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 06:32:56,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102759718] [2025-01-10 06:32:56,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:32:56,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 06:32:56,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:32:56,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 06:32:56,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-10 06:32:56,902 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 86 [2025-01-10 06:32:56,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 90 transitions, 447 flow. Second operand has 12 states, 12 states have (on average 28.333333333333332) internal successors, (340), 12 states have internal predecessors, (340), 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) [2025-01-10 06:32:56,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:32:56,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 86 [2025-01-10 06:32:56,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:32:57,854 INFO L124 PetriNetUnfolderBase]: 2759/5855 cut-off events. [2025-01-10 06:32:57,854 INFO L125 PetriNetUnfolderBase]: For 6849/6849 co-relation queries the response was YES. [2025-01-10 06:32:57,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16729 conditions, 5855 events. 2759/5855 cut-off events. For 6849/6849 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 38979 event pairs, 305 based on Foata normal form. 26/5805 useless extension candidates. Maximal degree in co-relation 16701. Up to 2571 conditions per place. [2025-01-10 06:32:57,882 INFO L140 encePairwiseOnDemand]: 73/86 looper letters, 173 selfloop transitions, 13 changer transitions 2/211 dead transitions. [2025-01-10 06:32:57,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 211 transitions, 1353 flow [2025-01-10 06:32:57,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 06:32:57,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 06:32:57,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 488 transitions. [2025-01-10 06:32:57,884 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4364937388193202 [2025-01-10 06:32:57,884 INFO L175 Difference]: Start difference. First operand has 125 places, 90 transitions, 447 flow. Second operand 13 states and 488 transitions. [2025-01-10 06:32:57,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 211 transitions, 1353 flow [2025-01-10 06:32:57,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 211 transitions, 1327 flow, removed 1 selfloop flow, removed 8 redundant places. [2025-01-10 06:32:57,897 INFO L231 Difference]: Finished difference. Result has 132 places, 94 transitions, 487 flow [2025-01-10 06:32:57,897 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=487, PETRI_PLACES=132, PETRI_TRANSITIONS=94} [2025-01-10 06:32:57,898 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 54 predicate places. [2025-01-10 06:32:57,898 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 94 transitions, 487 flow [2025-01-10 06:32:57,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 28.333333333333332) internal successors, (340), 12 states have internal predecessors, (340), 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) [2025-01-10 06:32:57,898 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:32:57,898 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:32:57,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 06:32:57,898 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-01-10 06:32:57,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:32:57,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1730882681, now seen corresponding path program 1 times [2025-01-10 06:32:57,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:32:57,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273708304] [2025-01-10 06:32:57,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:57,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:32:57,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-10 06:32:57,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 06:32:57,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:57,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:32:58,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:32:58,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:32:58,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273708304] [2025-01-10 06:32:58,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273708304] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:32:58,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:32:58,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:32:58,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367648210] [2025-01-10 06:32:58,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:32:58,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:32:58,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:32:58,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:32:58,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:32:58,072 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 86 [2025-01-10 06:32:58,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 94 transitions, 487 flow. Second operand has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 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) [2025-01-10 06:32:58,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:32:58,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 86 [2025-01-10 06:32:58,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:32:58,605 INFO L124 PetriNetUnfolderBase]: 2535/5545 cut-off events. [2025-01-10 06:32:58,605 INFO L125 PetriNetUnfolderBase]: For 7167/7167 co-relation queries the response was YES. [2025-01-10 06:32:58,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15998 conditions, 5545 events. 2535/5545 cut-off events. For 7167/7167 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 37904 event pairs, 1561 based on Foata normal form. 62/5513 useless extension candidates. Maximal degree in co-relation 15968. Up to 3067 conditions per place. [2025-01-10 06:32:58,632 INFO L140 encePairwiseOnDemand]: 78/86 looper letters, 63 selfloop transitions, 17 changer transitions 0/108 dead transitions. [2025-01-10 06:32:58,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 108 transitions, 709 flow [2025-01-10 06:32:58,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:32:58,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:32:58,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 226 transitions. [2025-01-10 06:32:58,634 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5255813953488372 [2025-01-10 06:32:58,634 INFO L175 Difference]: Start difference. First operand has 132 places, 94 transitions, 487 flow. Second operand 5 states and 226 transitions. [2025-01-10 06:32:58,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 108 transitions, 709 flow [2025-01-10 06:32:58,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 108 transitions, 683 flow, removed 2 selfloop flow, removed 10 redundant places. [2025-01-10 06:32:58,650 INFO L231 Difference]: Finished difference. Result has 124 places, 92 transitions, 486 flow [2025-01-10 06:32:58,650 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=486, PETRI_PLACES=124, PETRI_TRANSITIONS=92} [2025-01-10 06:32:58,650 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 46 predicate places. [2025-01-10 06:32:58,650 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 92 transitions, 486 flow [2025-01-10 06:32:58,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 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) [2025-01-10 06:32:58,651 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:32:58,651 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:32:58,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 06:32:58,651 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-01-10 06:32:58,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:32:58,651 INFO L85 PathProgramCache]: Analyzing trace with hash -42056530, now seen corresponding path program 1 times [2025-01-10 06:32:58,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:32:58,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370446096] [2025-01-10 06:32:58,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:58,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:32:58,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-10 06:32:58,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 06:32:58,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:58,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:32:58,712 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:32:58,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:32:58,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370446096] [2025-01-10 06:32:58,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370446096] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:32:58,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:32:58,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:32:58,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238200588] [2025-01-10 06:32:58,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:32:58,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:32:58,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:32:58,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:32:58,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:32:58,716 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 86 [2025-01-10 06:32:58,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 92 transitions, 486 flow. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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) [2025-01-10 06:32:58,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:32:58,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 86 [2025-01-10 06:32:58,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:32:59,150 INFO L124 PetriNetUnfolderBase]: 2115/4738 cut-off events. [2025-01-10 06:32:59,151 INFO L125 PetriNetUnfolderBase]: For 6467/6477 co-relation queries the response was YES. [2025-01-10 06:32:59,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13380 conditions, 4738 events. 2115/4738 cut-off events. For 6467/6477 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 30585 event pairs, 1246 based on Foata normal form. 42/4690 useless extension candidates. Maximal degree in co-relation 13350. Up to 2302 conditions per place. [2025-01-10 06:32:59,175 INFO L140 encePairwiseOnDemand]: 83/86 looper letters, 77 selfloop transitions, 2 changer transitions 0/108 dead transitions. [2025-01-10 06:32:59,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 108 transitions, 703 flow [2025-01-10 06:32:59,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:32:59,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:32:59,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 166 transitions. [2025-01-10 06:32:59,176 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6434108527131783 [2025-01-10 06:32:59,176 INFO L175 Difference]: Start difference. First operand has 124 places, 92 transitions, 486 flow. Second operand 3 states and 166 transitions. [2025-01-10 06:32:59,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 108 transitions, 703 flow [2025-01-10 06:32:59,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 108 transitions, 670 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-10 06:32:59,189 INFO L231 Difference]: Finished difference. Result has 122 places, 89 transitions, 439 flow [2025-01-10 06:32:59,190 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=439, PETRI_PLACES=122, PETRI_TRANSITIONS=89} [2025-01-10 06:32:59,190 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 44 predicate places. [2025-01-10 06:32:59,190 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 89 transitions, 439 flow [2025-01-10 06:32:59,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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) [2025-01-10 06:32:59,190 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:32:59,190 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:32:59,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 06:32:59,191 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-01-10 06:32:59,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:32:59,191 INFO L85 PathProgramCache]: Analyzing trace with hash -2052472252, now seen corresponding path program 1 times [2025-01-10 06:32:59,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:32:59,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021194647] [2025-01-10 06:32:59,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:59,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:32:59,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-10 06:32:59,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-10 06:32:59,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:59,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:32:59,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:32:59,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:32:59,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021194647] [2025-01-10 06:32:59,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021194647] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:32:59,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:32:59,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 06:32:59,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966521158] [2025-01-10 06:32:59,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:32:59,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:32:59,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:32:59,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:32:59,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:32:59,761 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 86 [2025-01-10 06:32:59,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 89 transitions, 439 flow. Second operand has 10 states, 10 states have (on average 36.0) internal successors, (360), 10 states have internal predecessors, (360), 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) [2025-01-10 06:32:59,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:32:59,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 86 [2025-01-10 06:32:59,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:00,285 INFO L124 PetriNetUnfolderBase]: 2265/4806 cut-off events. [2025-01-10 06:33:00,286 INFO L125 PetriNetUnfolderBase]: For 5449/5459 co-relation queries the response was YES. [2025-01-10 06:33:00,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13634 conditions, 4806 events. 2265/4806 cut-off events. For 5449/5459 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 29607 event pairs, 348 based on Foata normal form. 0/4734 useless extension candidates. Maximal degree in co-relation 13603. Up to 1476 conditions per place. [2025-01-10 06:33:00,308 INFO L140 encePairwiseOnDemand]: 72/86 looper letters, 149 selfloop transitions, 14 changer transitions 7/196 dead transitions. [2025-01-10 06:33:00,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 196 transitions, 1239 flow [2025-01-10 06:33:00,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 06:33:00,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 06:33:00,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 533 transitions. [2025-01-10 06:33:00,310 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5164728682170543 [2025-01-10 06:33:00,310 INFO L175 Difference]: Start difference. First operand has 122 places, 89 transitions, 439 flow. Second operand 12 states and 533 transitions. [2025-01-10 06:33:00,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 196 transitions, 1239 flow [2025-01-10 06:33:00,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 196 transitions, 1231 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:33:00,321 INFO L231 Difference]: Finished difference. Result has 136 places, 95 transitions, 513 flow [2025-01-10 06:33:00,321 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=513, PETRI_PLACES=136, PETRI_TRANSITIONS=95} [2025-01-10 06:33:00,322 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 58 predicate places. [2025-01-10 06:33:00,322 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 95 transitions, 513 flow [2025-01-10 06:33:00,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 36.0) internal successors, (360), 10 states have internal predecessors, (360), 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) [2025-01-10 06:33:00,322 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:00,322 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:33:00,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-10 06:33:00,322 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-01-10 06:33:00,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:00,323 INFO L85 PathProgramCache]: Analyzing trace with hash -650514229, now seen corresponding path program 1 times [2025-01-10 06:33:00,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:00,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902965265] [2025-01-10 06:33:00,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:00,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:00,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-10 06:33:00,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-10 06:33:00,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:00,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:00,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:00,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:00,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902965265] [2025-01-10 06:33:00,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902965265] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:00,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:00,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 06:33:00,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739164920] [2025-01-10 06:33:00,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:00,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:33:00,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:00,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:33:00,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:33:00,902 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 86 [2025-01-10 06:33:00,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 95 transitions, 513 flow. Second operand has 10 states, 10 states have (on average 33.0) internal successors, (330), 10 states have internal predecessors, (330), 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) [2025-01-10 06:33:00,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:00,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 86 [2025-01-10 06:33:00,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:01,474 INFO L124 PetriNetUnfolderBase]: 2229/4753 cut-off events. [2025-01-10 06:33:01,474 INFO L125 PetriNetUnfolderBase]: For 6356/6366 co-relation queries the response was YES. [2025-01-10 06:33:01,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13938 conditions, 4753 events. 2229/4753 cut-off events. For 6356/6366 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 29298 event pairs, 378 based on Foata normal form. 26/4751 useless extension candidates. Maximal degree in co-relation 13903. Up to 1650 conditions per place. [2025-01-10 06:33:01,493 INFO L140 encePairwiseOnDemand]: 72/86 looper letters, 145 selfloop transitions, 13 changer transitions 16/200 dead transitions. [2025-01-10 06:33:01,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 200 transitions, 1322 flow [2025-01-10 06:33:01,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 06:33:01,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 06:33:01,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 498 transitions. [2025-01-10 06:33:01,495 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48255813953488375 [2025-01-10 06:33:01,495 INFO L175 Difference]: Start difference. First operand has 136 places, 95 transitions, 513 flow. Second operand 12 states and 498 transitions. [2025-01-10 06:33:01,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 200 transitions, 1322 flow [2025-01-10 06:33:01,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 200 transitions, 1310 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 06:33:01,507 INFO L231 Difference]: Finished difference. Result has 143 places, 96 transitions, 543 flow [2025-01-10 06:33:01,507 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=543, PETRI_PLACES=143, PETRI_TRANSITIONS=96} [2025-01-10 06:33:01,507 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 65 predicate places. [2025-01-10 06:33:01,507 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 96 transitions, 543 flow [2025-01-10 06:33:01,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 33.0) internal successors, (330), 10 states have internal predecessors, (330), 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) [2025-01-10 06:33:01,508 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:01,508 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:33:01,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-10 06:33:01,508 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-01-10 06:33:01,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:01,508 INFO L85 PathProgramCache]: Analyzing trace with hash 776291203, now seen corresponding path program 1 times [2025-01-10 06:33:01,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:01,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278377905] [2025-01-10 06:33:01,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:01,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:01,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-10 06:33:01,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 06:33:01,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:01,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:02,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:02,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:02,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278377905] [2025-01-10 06:33:02,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278377905] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:33:02,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371044480] [2025-01-10 06:33:02,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:02,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:33:02,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:33:02,128 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:33:02,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 06:33:02,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-10 06:33:02,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 06:33:02,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:02,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:02,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-01-10 06:33:02,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:33:02,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 1 [2025-01-10 06:33:02,354 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2025-01-10 06:33:02,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 29 [2025-01-10 06:33:02,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-10 06:33:02,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-10 06:33:02,493 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2025-01-10 06:33:02,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 29 [2025-01-10 06:33:02,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-10 06:33:02,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2025-01-10 06:33:02,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2025-01-10 06:33:02,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-01-10 06:33:02,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2025-01-10 06:33:02,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 23 [2025-01-10 06:33:02,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:02,851 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:33:07,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:07,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371044480] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:33:07,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:33:07,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 13] total 34 [2025-01-10 06:33:07,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877213847] [2025-01-10 06:33:07,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:33:07,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-01-10 06:33:07,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:07,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-01-10 06:33:07,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1007, Unknown=2, NotChecked=0, Total=1190 [2025-01-10 06:33:10,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:33:10,726 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 86 [2025-01-10 06:33:10,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 96 transitions, 543 flow. Second operand has 35 states, 35 states have (on average 29.057142857142857) internal successors, (1017), 35 states have internal predecessors, (1017), 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) [2025-01-10 06:33:10,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:10,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 86 [2025-01-10 06:33:10,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:17,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:33:18,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:33:23,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:33:26,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:33:27,824 INFO L124 PetriNetUnfolderBase]: 3912/8485 cut-off events. [2025-01-10 06:33:27,824 INFO L125 PetriNetUnfolderBase]: For 10415/10416 co-relation queries the response was YES. [2025-01-10 06:33:27,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24372 conditions, 8485 events. 3912/8485 cut-off events. For 10415/10416 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 50501 event pairs, 383 based on Foata normal form. 129/8578 useless extension candidates. Maximal degree in co-relation 24334. Up to 1256 conditions per place. [2025-01-10 06:33:27,871 INFO L140 encePairwiseOnDemand]: 65/86 looper letters, 428 selfloop transitions, 70 changer transitions 14/536 dead transitions. [2025-01-10 06:33:27,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 536 transitions, 3586 flow [2025-01-10 06:33:27,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-01-10 06:33:27,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2025-01-10 06:33:27,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 1733 transitions. [2025-01-10 06:33:27,877 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41124822021831986 [2025-01-10 06:33:27,877 INFO L175 Difference]: Start difference. First operand has 143 places, 96 transitions, 543 flow. Second operand 49 states and 1733 transitions. [2025-01-10 06:33:27,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 536 transitions, 3586 flow [2025-01-10 06:33:27,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 536 transitions, 3556 flow, removed 2 selfloop flow, removed 9 redundant places. [2025-01-10 06:33:27,904 INFO L231 Difference]: Finished difference. Result has 202 places, 151 transitions, 1209 flow [2025-01-10 06:33:27,905 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=49, PETRI_FLOW=1209, PETRI_PLACES=202, PETRI_TRANSITIONS=151} [2025-01-10 06:33:27,908 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 124 predicate places. [2025-01-10 06:33:27,908 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 151 transitions, 1209 flow [2025-01-10 06:33:27,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 29.057142857142857) internal successors, (1017), 35 states have internal predecessors, (1017), 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) [2025-01-10 06:33:27,909 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:27,909 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:33:27,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 06:33:28,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:33:28,110 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-01-10 06:33:28,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:28,110 INFO L85 PathProgramCache]: Analyzing trace with hash 495566028, now seen corresponding path program 1 times [2025-01-10 06:33:28,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:28,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374381178] [2025-01-10 06:33:28,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:28,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:28,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-10 06:33:28,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-10 06:33:28,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:28,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:29,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:29,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:29,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374381178] [2025-01-10 06:33:29,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374381178] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:29,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:29,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-10 06:33:29,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744694312] [2025-01-10 06:33:29,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:29,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 06:33:29,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:29,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 06:33:29,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-01-10 06:33:29,708 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 86 [2025-01-10 06:33:29,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 151 transitions, 1209 flow. Second operand has 15 states, 15 states have (on average 28.466666666666665) internal successors, (427), 15 states have internal predecessors, (427), 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) [2025-01-10 06:33:29,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:29,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 86 [2025-01-10 06:33:29,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:31,326 INFO L124 PetriNetUnfolderBase]: 4008/8678 cut-off events. [2025-01-10 06:33:31,326 INFO L125 PetriNetUnfolderBase]: For 14481/14483 co-relation queries the response was YES. [2025-01-10 06:33:31,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26348 conditions, 8678 events. 4008/8678 cut-off events. For 14481/14483 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 52162 event pairs, 1267 based on Foata normal form. 12/8652 useless extension candidates. Maximal degree in co-relation 26292. Up to 4195 conditions per place. [2025-01-10 06:33:31,371 INFO L140 encePairwiseOnDemand]: 72/86 looper letters, 235 selfloop transitions, 16 changer transitions 17/292 dead transitions. [2025-01-10 06:33:31,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 292 transitions, 2364 flow [2025-01-10 06:33:31,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-10 06:33:31,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-01-10 06:33:31,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 585 transitions. [2025-01-10 06:33:31,372 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4251453488372093 [2025-01-10 06:33:31,372 INFO L175 Difference]: Start difference. First operand has 202 places, 151 transitions, 1209 flow. Second operand 16 states and 585 transitions. [2025-01-10 06:33:31,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 292 transitions, 2364 flow [2025-01-10 06:33:31,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 292 transitions, 2268 flow, removed 41 selfloop flow, removed 7 redundant places. [2025-01-10 06:33:31,411 INFO L231 Difference]: Finished difference. Result has 212 places, 153 transitions, 1171 flow [2025-01-10 06:33:31,412 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=1113, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1171, PETRI_PLACES=212, PETRI_TRANSITIONS=153} [2025-01-10 06:33:31,412 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 134 predicate places. [2025-01-10 06:33:31,412 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 153 transitions, 1171 flow [2025-01-10 06:33:31,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 28.466666666666665) internal successors, (427), 15 states have internal predecessors, (427), 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) [2025-01-10 06:33:31,412 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:31,412 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:33:31,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-10 06:33:31,413 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-01-10 06:33:31,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:31,413 INFO L85 PathProgramCache]: Analyzing trace with hash 843521479, now seen corresponding path program 1 times [2025-01-10 06:33:31,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:31,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832801939] [2025-01-10 06:33:31,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:31,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:31,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-10 06:33:31,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-10 06:33:31,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:31,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:32,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:32,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:32,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832801939] [2025-01-10 06:33:32,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832801939] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:33:32,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087264468] [2025-01-10 06:33:32,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:32,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:33:32,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:33:32,400 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:33:32,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 06:33:32,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-10 06:33:32,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-10 06:33:32,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:32,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:32,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-01-10 06:33:32,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:33:32,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 1 [2025-01-10 06:33:32,627 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-10 06:33:32,641 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-01-10 06:33:32,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 35 [2025-01-10 06:33:32,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 06:33:32,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-01-10 06:33:32,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 15 [2025-01-10 06:33:32,786 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-10 06:33:32,794 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-01-10 06:33:32,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 35 [2025-01-10 06:33:32,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 06:33:32,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-01-10 06:33:32,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 15 [2025-01-10 06:33:33,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 06:33:33,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 18 [2025-01-10 06:33:33,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 18 [2025-01-10 06:33:33,117 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-01-10 06:33:33,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 40 [2025-01-10 06:33:33,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 18 [2025-01-10 06:33:33,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2025-01-10 06:33:33,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:33,194 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:33:52,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:52,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087264468] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:33:52,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:33:52,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 14] total 34 [2025-01-10 06:33:52,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186572289] [2025-01-10 06:33:52,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:33:52,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-01-10 06:33:52,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:52,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-01-10 06:33:52,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1061, Unknown=3, NotChecked=0, Total=1260 [2025-01-10 06:33:52,641 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 86 [2025-01-10 06:33:52,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 153 transitions, 1171 flow. Second operand has 36 states, 36 states have (on average 33.388888888888886) internal successors, (1202), 36 states have internal predecessors, (1202), 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) [2025-01-10 06:33:52,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:52,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 86 [2025-01-10 06:33:52,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand