./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread/queue_longer.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_longer.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 9f874a9872f93f025fac23ebed37f94a1f3b80bd0133ea4d7e298577c4fec427 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:32:37,304 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:32:37,357 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:37,366 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:32:37,366 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:32:37,391 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:32:37,393 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:32:37,393 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:32:37,394 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:32:37,394 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:32:37,395 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:32:37,395 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:32:37,395 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:32:37,395 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:32:37,396 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:32:37,396 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:32:37,396 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:32:37,396 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:32:37,396 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:32:37,396 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:32:37,397 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:32:37,397 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:32:37,397 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:32:37,397 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:32:37,397 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:32:37,397 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:32:37,397 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:32:37,398 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:32:37,398 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:32:37,398 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:32:37,398 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:32:37,398 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:32:37,398 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:32:37,398 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:32:37,399 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:32:37,399 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:32:37,399 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:32:37,399 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:32:37,399 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:32:37,399 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:32:37,400 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:32:37,400 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:32:37,400 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:32:37,400 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:32:37,400 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:32:37,400 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:32:37,400 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:32:37,400 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:32:37,400 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:32:37,401 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:32:37,401 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 -> 9f874a9872f93f025fac23ebed37f94a1f3b80bd0133ea4d7e298577c4fec427 [2025-01-10 06:32:37,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:32:37,643 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:32:37,645 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:32:37,646 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:32:37,646 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:32:37,647 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/queue_longer.i [2025-01-10 06:32:38,830 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c80d1c38f/c91bae4439264444b61fa5eb0433de3e/FLAG0655b6717 [2025-01-10 06:32:39,134 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:32:39,134 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/queue_longer.i [2025-01-10 06:32:39,147 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c80d1c38f/c91bae4439264444b61fa5eb0433de3e/FLAG0655b6717 [2025-01-10 06:32:39,158 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c80d1c38f/c91bae4439264444b61fa5eb0433de3e [2025-01-10 06:32:39,160 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:32:39,161 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:32:39,165 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:32:39,165 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:32:39,170 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:32:39,171 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:32:39" (1/1) ... [2025-01-10 06:32:39,171 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c1e8b99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:32:39, skipping insertion in model container [2025-01-10 06:32:39,171 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:32:39" (1/1) ... [2025-01-10 06:32:39,192 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:32:39,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:32:39,633 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:32:39,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:32:39,783 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:32:39,785 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,785 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:32:39,786 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:32:39,786 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:32:39,787 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:32:39,791 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,817 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,858 INFO L138 Inliner]: procedures = 274, calls = 859, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 1058 [2025-01-10 06:32:39,859 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:32:39,859 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:32:39,859 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:32:39,859 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:32:39,869 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,869 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,884 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,923 INFO L175 MemorySlicer]: Split 844 memory accesses to 4 slices as follows [2, 5, 434, 403]. 51 percent of accesses are in the largest equivalence class. The 810 initializations are split as follows [2, 5, 403, 400]. The 16 writes are split as follows [0, 0, 14, 2]. [2025-01-10 06:32:39,924 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,924 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,943 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,946 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,949 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,957 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,961 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,969 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:32:39,970 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:32:39,970 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:32:39,970 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:32:39,970 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,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:32:39,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:32:39,997 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:40,002 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:40,018 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-01-10 06:32:40,018 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-01-10 06:32:40,018 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-01-10 06:32:40,018 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-01-10 06:32:40,019 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 06:32:40,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:32:40,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:32:40,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 06:32:40,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 06:32:40,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:32:40,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:32:40,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 06:32:40,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 06:32:40,019 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 06:32:40,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:32:40,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:32:40,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:32:40,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 06:32:40,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 06:32:40,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:32:40,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:32:40,022 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:40,146 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:32:40,148 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:32:41,190 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:32:41,190 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:32:46,179 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:32:46,180 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 06:32:46,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:32:46 BoogieIcfgContainer [2025-01-10 06:32:46,180 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:32:46,182 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:32:46,182 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:32:46,185 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:32:46,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:32:39" (1/3) ... [2025-01-10 06:32:46,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@339a2796 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:32:46, skipping insertion in model container [2025-01-10 06:32:46,185 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:46,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@339a2796 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:32:46, skipping insertion in model container [2025-01-10 06:32:46,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:32:46" (3/3) ... [2025-01-10 06:32:46,187 INFO L128 eAbstractionObserver]: Analyzing ICFG queue_longer.i [2025-01-10 06:32:46,199 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:32:46,204 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG queue_longer.i that has 3 procedures, 75 locations, 1 initial locations, 2 loop locations, and 18 error locations. [2025-01-10 06:32:46,205 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:32:46,291 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 06:32:46,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 83 transitions, 180 flow [2025-01-10 06:32:46,376 INFO L124 PetriNetUnfolderBase]: 9/81 cut-off events. [2025-01-10 06:32:46,380 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 06:32:46,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 81 events. 9/81 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 206 event pairs, 0 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2025-01-10 06:32:46,384 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 83 transitions, 180 flow [2025-01-10 06:32:46,387 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 79 transitions, 167 flow [2025-01-10 06:32:46,392 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:32:46,399 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;@534a20f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:32:46,399 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2025-01-10 06:32:46,429 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:32:46,429 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-01-10 06:32:46,429 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:32:46,429 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:32:46,430 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 06:32:46,430 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:46,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:32:46,434 INFO L85 PathProgramCache]: Analyzing trace with hash -859214275, now seen corresponding path program 1 times [2025-01-10 06:32:46,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:32:46,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998024049] [2025-01-10 06:32:46,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:46,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:32:46,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:32:46,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:32:46,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:46,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:32:47,698 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:47,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:32:47,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998024049] [2025-01-10 06:32:47,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998024049] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:32:47,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:32:47,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:32:47,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456428214] [2025-01-10 06:32:47,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:32:47,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:32:47,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:32:47,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:32:47,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:32:47,739 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2025-01-10 06:32:47,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 79 transitions, 167 flow. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 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:47,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:32:47,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2025-01-10 06:32:47,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:32:48,385 INFO L124 PetriNetUnfolderBase]: 1233/2525 cut-off events. [2025-01-10 06:32:48,386 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2025-01-10 06:32:48,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4503 conditions, 2525 events. 1233/2525 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 15704 event pairs, 205 based on Foata normal form. 48/2196 useless extension candidates. Maximal degree in co-relation 4434. Up to 1608 conditions per place. [2025-01-10 06:32:48,409 INFO L140 encePairwiseOnDemand]: 75/83 looper letters, 73 selfloop transitions, 6 changer transitions 0/109 dead transitions. [2025-01-10 06:32:48,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 109 transitions, 391 flow [2025-01-10 06:32:48,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:32:48,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:32:48,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 209 transitions. [2025-01-10 06:32:48,419 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6295180722891566 [2025-01-10 06:32:48,421 INFO L175 Difference]: Start difference. First operand has 77 places, 79 transitions, 167 flow. Second operand 4 states and 209 transitions. [2025-01-10 06:32:48,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 109 transitions, 391 flow [2025-01-10 06:32:48,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 109 transitions, 384 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:32:48,428 INFO L231 Difference]: Finished difference. Result has 80 places, 82 transitions, 202 flow [2025-01-10 06:32:48,433 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=202, PETRI_PLACES=80, PETRI_TRANSITIONS=82} [2025-01-10 06:32:48,435 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 3 predicate places. [2025-01-10 06:32:48,436 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 82 transitions, 202 flow [2025-01-10 06:32:48,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 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:48,436 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:32:48,436 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:32:48,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:32:48,436 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:48,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:32:48,437 INFO L85 PathProgramCache]: Analyzing trace with hash -865836405, now seen corresponding path program 1 times [2025-01-10 06:32:48,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:32:48,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145542818] [2025-01-10 06:32:48,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:48,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:32:48,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:32:48,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:32:48,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:48,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:32:49,211 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,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:32:49,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145542818] [2025-01-10 06:32:49,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145542818] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:32:49,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:32:49,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:32:49,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045013432] [2025-01-10 06:32:49,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:32:49,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:32:49,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:32:49,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:32:49,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:32:49,227 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2025-01-10 06:32:49,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 82 transitions, 202 flow. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 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:49,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:32:49,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2025-01-10 06:32:49,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:32:49,703 INFO L124 PetriNetUnfolderBase]: 1242/2581 cut-off events. [2025-01-10 06:32:49,703 INFO L125 PetriNetUnfolderBase]: For 452/455 co-relation queries the response was YES. [2025-01-10 06:32:49,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4890 conditions, 2581 events. 1242/2581 cut-off events. For 452/455 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 16535 event pairs, 264 based on Foata normal form. 38/2287 useless extension candidates. Maximal degree in co-relation 4354. Up to 1757 conditions per place. [2025-01-10 06:32:49,720 INFO L140 encePairwiseOnDemand]: 78/83 looper letters, 81 selfloop transitions, 6 changer transitions 0/117 dead transitions. [2025-01-10 06:32:49,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 117 transitions, 456 flow [2025-01-10 06:32:49,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:32:49,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:32:49,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 249 transitions. [2025-01-10 06:32:49,723 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-01-10 06:32:49,723 INFO L175 Difference]: Start difference. First operand has 80 places, 82 transitions, 202 flow. Second operand 5 states and 249 transitions. [2025-01-10 06:32:49,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 117 transitions, 456 flow [2025-01-10 06:32:49,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 117 transitions, 450 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:32:49,729 INFO L231 Difference]: Finished difference. Result has 84 places, 83 transitions, 219 flow [2025-01-10 06:32:49,729 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=219, PETRI_PLACES=84, PETRI_TRANSITIONS=83} [2025-01-10 06:32:49,730 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 7 predicate places. [2025-01-10 06:32:49,730 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 83 transitions, 219 flow [2025-01-10 06:32:49,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 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:49,731 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:32:49,731 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:32:49,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:32:49,732 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:49,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:32:49,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1154945262, now seen corresponding path program 1 times [2025-01-10 06:32:49,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:32:49,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361339246] [2025-01-10 06:32:49,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:49,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:32:49,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:32:49,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:32:49,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:49,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:32:50,545 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,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:32:50,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361339246] [2025-01-10 06:32:50,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361339246] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:32:50,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:32:50,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:32:50,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497088432] [2025-01-10 06:32:50,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:32:50,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:32:50,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:32:50,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:32:50,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:32:50,558 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2025-01-10 06:32:50,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 83 transitions, 219 flow. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:32:50,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2025-01-10 06:32:50,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:32:51,363 INFO L124 PetriNetUnfolderBase]: 1442/2909 cut-off events. [2025-01-10 06:32:51,363 INFO L125 PetriNetUnfolderBase]: For 544/560 co-relation queries the response was YES. [2025-01-10 06:32:51,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5605 conditions, 2909 events. 1442/2909 cut-off events. For 544/560 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 18754 event pairs, 222 based on Foata normal form. 40/2533 useless extension candidates. Maximal degree in co-relation 5043. Up to 1637 conditions per place. [2025-01-10 06:32:51,378 INFO L140 encePairwiseOnDemand]: 69/83 looper letters, 107 selfloop transitions, 17 changer transitions 0/154 dead transitions. [2025-01-10 06:32:51,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 154 transitions, 631 flow [2025-01-10 06:32:51,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:32:51,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 06:32:51,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 349 transitions. [2025-01-10 06:32:51,381 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6006884681583476 [2025-01-10 06:32:51,381 INFO L175 Difference]: Start difference. First operand has 84 places, 83 transitions, 219 flow. Second operand 7 states and 349 transitions. [2025-01-10 06:32:51,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 154 transitions, 631 flow [2025-01-10 06:32:51,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 154 transitions, 617 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-01-10 06:32:51,384 INFO L231 Difference]: Finished difference. Result has 91 places, 93 transitions, 317 flow [2025-01-10 06:32:51,384 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=317, PETRI_PLACES=91, PETRI_TRANSITIONS=93} [2025-01-10 06:32:51,385 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 14 predicate places. [2025-01-10 06:32:51,385 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 93 transitions, 317 flow [2025-01-10 06:32:51,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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,385 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:32:51,385 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:32:51,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:32:51,386 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:51,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:32:51,386 INFO L85 PathProgramCache]: Analyzing trace with hash 681505712, now seen corresponding path program 1 times [2025-01-10 06:32:51,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:32:51,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816546561] [2025-01-10 06:32:51,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:51,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:32:51,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:32:51,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:32:51,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:51,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:32:51,564 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,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:32:51,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816546561] [2025-01-10 06:32:51,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816546561] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:32:51,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:32:51,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:32:51,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505883638] [2025-01-10 06:32:51,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:32:51,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:32:51,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:32:51,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:32:51,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:32:51,568 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 83 [2025-01-10 06:32:51,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 93 transitions, 317 flow. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:32:51,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 83 [2025-01-10 06:32:51,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:32:51,873 INFO L124 PetriNetUnfolderBase]: 1085/2491 cut-off events. [2025-01-10 06:32:51,873 INFO L125 PetriNetUnfolderBase]: For 673/673 co-relation queries the response was YES. [2025-01-10 06:32:51,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4910 conditions, 2491 events. 1085/2491 cut-off events. For 673/673 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 14753 event pairs, 502 based on Foata normal form. 43/2268 useless extension candidates. Maximal degree in co-relation 4780. Up to 925 conditions per place. [2025-01-10 06:32:51,887 INFO L140 encePairwiseOnDemand]: 79/83 looper letters, 67 selfloop transitions, 3 changer transitions 0/101 dead transitions. [2025-01-10 06:32:51,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 101 transitions, 433 flow [2025-01-10 06:32:51,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:32:51,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:32:51,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 175 transitions. [2025-01-10 06:32:51,889 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7028112449799196 [2025-01-10 06:32:51,889 INFO L175 Difference]: Start difference. First operand has 91 places, 93 transitions, 317 flow. Second operand 3 states and 175 transitions. [2025-01-10 06:32:51,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 101 transitions, 433 flow [2025-01-10 06:32:51,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 101 transitions, 387 flow, removed 7 selfloop flow, removed 12 redundant places. [2025-01-10 06:32:51,893 INFO L231 Difference]: Finished difference. Result has 78 places, 79 transitions, 205 flow [2025-01-10 06:32:51,894 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=205, PETRI_PLACES=78, PETRI_TRANSITIONS=79} [2025-01-10 06:32:51,894 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 1 predicate places. [2025-01-10 06:32:51,894 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 79 transitions, 205 flow [2025-01-10 06:32:51,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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,894 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:32:51,895 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:32:51,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:32:51,895 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-01-10 06:32:51,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:32:51,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1443567105, now seen corresponding path program 1 times [2025-01-10 06:32:51,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:32:51,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971814351] [2025-01-10 06:32:51,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:51,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:32:51,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:32:51,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:32:51,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:51,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:32:52,446 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:52,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:32:52,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971814351] [2025-01-10 06:32:52,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971814351] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:32:52,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:32:52,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:32:52,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736230861] [2025-01-10 06:32:52,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:32:52,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:32:52,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:32:52,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:32:52,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:32:52,470 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2025-01-10 06:32:52,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 79 transitions, 205 flow. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:32:52,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2025-01-10 06:32:52,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:32:52,928 INFO L124 PetriNetUnfolderBase]: 1207/2573 cut-off events. [2025-01-10 06:32:52,928 INFO L125 PetriNetUnfolderBase]: For 258/258 co-relation queries the response was YES. [2025-01-10 06:32:52,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5051 conditions, 2573 events. 1207/2573 cut-off events. For 258/258 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 14569 event pairs, 166 based on Foata normal form. 14/2329 useless extension candidates. Maximal degree in co-relation 4462. Up to 1733 conditions per place. [2025-01-10 06:32:52,941 INFO L140 encePairwiseOnDemand]: 76/83 looper letters, 80 selfloop transitions, 6 changer transitions 0/114 dead transitions. [2025-01-10 06:32:52,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 114 transitions, 455 flow [2025-01-10 06:32:52,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:32:52,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:32:52,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 275 transitions. [2025-01-10 06:32:52,944 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5522088353413654 [2025-01-10 06:32:52,944 INFO L175 Difference]: Start difference. First operand has 78 places, 79 transitions, 205 flow. Second operand 6 states and 275 transitions. [2025-01-10 06:32:52,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 114 transitions, 455 flow [2025-01-10 06:32:52,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 114 transitions, 445 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:32:52,947 INFO L231 Difference]: Finished difference. Result has 80 places, 78 transitions, 205 flow [2025-01-10 06:32:52,947 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=205, PETRI_PLACES=80, PETRI_TRANSITIONS=78} [2025-01-10 06:32:52,948 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 3 predicate places. [2025-01-10 06:32:52,948 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 78 transitions, 205 flow [2025-01-10 06:32:52,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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,949 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:32:52,949 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:32:52,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:32:52,949 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-01-10 06:32:52,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:32:52,949 INFO L85 PathProgramCache]: Analyzing trace with hash 2092005235, now seen corresponding path program 1 times [2025-01-10 06:32:52,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:32:52,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492960594] [2025-01-10 06:32:52,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:52,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:32:52,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:32:52,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:32:52,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:52,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:32:53,155 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,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:32:53,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492960594] [2025-01-10 06:32:53,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492960594] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:32:53,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:32:53,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:32:53,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583498620] [2025-01-10 06:32:53,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:32:53,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:32:53,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:32:53,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:32:53,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:32:53,164 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 83 [2025-01-10 06:32:53,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 78 transitions, 205 flow. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 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,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:32:53,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 83 [2025-01-10 06:32:53,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:32:53,805 INFO L124 PetriNetUnfolderBase]: 2004/4379 cut-off events. [2025-01-10 06:32:53,805 INFO L125 PetriNetUnfolderBase]: For 605/605 co-relation queries the response was YES. [2025-01-10 06:32:53,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8392 conditions, 4379 events. 2004/4379 cut-off events. For 605/605 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 28780 event pairs, 1018 based on Foata normal form. 146/4088 useless extension candidates. Maximal degree in co-relation 7771. Up to 2101 conditions per place. [2025-01-10 06:32:53,831 INFO L140 encePairwiseOnDemand]: 77/83 looper letters, 119 selfloop transitions, 3 changer transitions 0/150 dead transitions. [2025-01-10 06:32:53,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 150 transitions, 663 flow [2025-01-10 06:32:53,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:32:53,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:32:53,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 251 transitions. [2025-01-10 06:32:53,833 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7560240963855421 [2025-01-10 06:32:53,833 INFO L175 Difference]: Start difference. First operand has 80 places, 78 transitions, 205 flow. Second operand 4 states and 251 transitions. [2025-01-10 06:32:53,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 150 transitions, 663 flow [2025-01-10 06:32:53,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 150 transitions, 631 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-10 06:32:53,837 INFO L231 Difference]: Finished difference. Result has 80 places, 80 transitions, 217 flow [2025-01-10 06:32:53,837 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=217, PETRI_PLACES=80, PETRI_TRANSITIONS=80} [2025-01-10 06:32:53,838 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 3 predicate places. [2025-01-10 06:32:53,838 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 80 transitions, 217 flow [2025-01-10 06:32:53,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 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,839 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:32:53,839 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:32:53,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:32:53,839 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:53,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:32:53,839 INFO L85 PathProgramCache]: Analyzing trace with hash -952265494, now seen corresponding path program 1 times [2025-01-10 06:32:53,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:32:53,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862336511] [2025-01-10 06:32:53,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:53,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:32:53,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 06:32:53,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 06:32:53,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:53,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:32:54,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:54,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:32:54,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862336511] [2025-01-10 06:32:54,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862336511] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:32:54,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:32:54,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:32:54,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21187351] [2025-01-10 06:32:54,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:32:54,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:32:54,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:32:54,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:32:54,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:32:54,406 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 83 [2025-01-10 06:32:54,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 80 transitions, 217 flow. Second operand has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 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,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:32:54,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 83 [2025-01-10 06:32:54,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:32:55,019 INFO L124 PetriNetUnfolderBase]: 1823/4027 cut-off events. [2025-01-10 06:32:55,019 INFO L125 PetriNetUnfolderBase]: For 1016/1160 co-relation queries the response was YES. [2025-01-10 06:32:55,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8190 conditions, 4027 events. 1823/4027 cut-off events. For 1016/1160 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 26200 event pairs, 263 based on Foata normal form. 38/3680 useless extension candidates. Maximal degree in co-relation 7578. Up to 2417 conditions per place. [2025-01-10 06:32:55,042 INFO L140 encePairwiseOnDemand]: 73/83 looper letters, 88 selfloop transitions, 9 changer transitions 0/127 dead transitions. [2025-01-10 06:32:55,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 127 transitions, 581 flow [2025-01-10 06:32:55,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:32:55,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:32:55,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 303 transitions. [2025-01-10 06:32:55,044 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.608433734939759 [2025-01-10 06:32:55,044 INFO L175 Difference]: Start difference. First operand has 80 places, 80 transitions, 217 flow. Second operand 6 states and 303 transitions. [2025-01-10 06:32:55,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 127 transitions, 581 flow [2025-01-10 06:32:55,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 127 transitions, 571 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:32:55,049 INFO L231 Difference]: Finished difference. Result has 84 places, 79 transitions, 231 flow [2025-01-10 06:32:55,050 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=231, PETRI_PLACES=84, PETRI_TRANSITIONS=79} [2025-01-10 06:32:55,051 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 7 predicate places. [2025-01-10 06:32:55,051 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 79 transitions, 231 flow [2025-01-10 06:32:55,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 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,051 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:32:55,052 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:32:55,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:32:55,052 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:55,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:32:55,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1987254825, now seen corresponding path program 1 times [2025-01-10 06:32:55,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:32:55,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140827083] [2025-01-10 06:32:55,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:55,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:32:55,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 06:32:55,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 06:32:55,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:55,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:32:55,233 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:55,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:32:55,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140827083] [2025-01-10 06:32:55,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140827083] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:32:55,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671335726] [2025-01-10 06:32:55,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:55,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:32:55,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:32:55,236 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:55,239 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:55,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 06:32:55,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 06:32:55,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:55,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:32:55,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 1762 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:32:55,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:32:55,563 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:55,563 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:32:55,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671335726] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:32:55,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:32:55,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-10 06:32:55,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98449416] [2025-01-10 06:32:55,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:32:55,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:32:55,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:32:55,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:32:55,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:32:55,574 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 83 [2025-01-10 06:32:55,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 79 transitions, 231 flow. Second operand has 6 states, 6 states have (on average 36.166666666666664) internal successors, (217), 6 states have internal predecessors, (217), 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,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:32:55,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 83 [2025-01-10 06:32:55,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:32:56,508 INFO L124 PetriNetUnfolderBase]: 1787/3878 cut-off events. [2025-01-10 06:32:56,509 INFO L125 PetriNetUnfolderBase]: For 1173/1173 co-relation queries the response was YES. [2025-01-10 06:32:56,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8205 conditions, 3878 events. 1787/3878 cut-off events. For 1173/1173 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 24974 event pairs, 118 based on Foata normal form. 74/3649 useless extension candidates. Maximal degree in co-relation 7571. Up to 1148 conditions per place. [2025-01-10 06:32:56,528 INFO L140 encePairwiseOnDemand]: 79/83 looper letters, 171 selfloop transitions, 5 changer transitions 0/204 dead transitions. [2025-01-10 06:32:56,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 204 transitions, 971 flow [2025-01-10 06:32:56,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:32:56,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:32:56,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 367 transitions. [2025-01-10 06:32:56,530 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7369477911646586 [2025-01-10 06:32:56,531 INFO L175 Difference]: Start difference. First operand has 84 places, 79 transitions, 231 flow. Second operand 6 states and 367 transitions. [2025-01-10 06:32:56,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 204 transitions, 971 flow [2025-01-10 06:32:56,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 204 transitions, 925 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 06:32:56,535 INFO L231 Difference]: Finished difference. Result has 84 places, 78 transitions, 225 flow [2025-01-10 06:32:56,536 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=225, PETRI_PLACES=84, PETRI_TRANSITIONS=78} [2025-01-10 06:32:56,536 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 7 predicate places. [2025-01-10 06:32:56,536 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 78 transitions, 225 flow [2025-01-10 06:32:56,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.166666666666664) internal successors, (217), 6 states have internal predecessors, (217), 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,536 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:32:56,536 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] [2025-01-10 06:32:56,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 06:32:56,737 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:56,737 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-01-10 06:32:56,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:32:56,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1810065300, now seen corresponding path program 1 times [2025-01-10 06:32:56,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:32:56,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134751649] [2025-01-10 06:32:56,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:56,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:32:56,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 06:32:56,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 06:32:56,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:56,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:32:58,605 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,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:32:58,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134751649] [2025-01-10 06:32:58,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134751649] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:32:58,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:32:58,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 06:32:58,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321499209] [2025-01-10 06:32:58,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:32:58,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:32:58,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:32:58,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:32:58,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:32:58,655 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 83 [2025-01-10 06:32:58,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 78 transitions, 225 flow. Second operand has 8 states, 8 states have (on average 30.0) internal successors, (240), 8 states have internal predecessors, (240), 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,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:32:58,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 83 [2025-01-10 06:32:58,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:32:59,525 INFO L124 PetriNetUnfolderBase]: 2417/4984 cut-off events. [2025-01-10 06:32:59,525 INFO L125 PetriNetUnfolderBase]: For 2437/2517 co-relation queries the response was YES. [2025-01-10 06:32:59,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10952 conditions, 4984 events. 2417/4984 cut-off events. For 2437/2517 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 32424 event pairs, 444 based on Foata normal form. 22/4530 useless extension candidates. Maximal degree in co-relation 10273. Up to 2624 conditions per place. [2025-01-10 06:32:59,545 INFO L140 encePairwiseOnDemand]: 74/83 looper letters, 137 selfloop transitions, 8 changer transitions 0/170 dead transitions. [2025-01-10 06:32:59,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 170 transitions, 890 flow [2025-01-10 06:32:59,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 06:32:59,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 06:32:59,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 378 transitions. [2025-01-10 06:32:59,547 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5060240963855421 [2025-01-10 06:32:59,547 INFO L175 Difference]: Start difference. First operand has 84 places, 78 transitions, 225 flow. Second operand 9 states and 378 transitions. [2025-01-10 06:32:59,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 170 transitions, 890 flow [2025-01-10 06:32:59,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 170 transitions, 850 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:32:59,550 INFO L231 Difference]: Finished difference. Result has 92 places, 81 transitions, 257 flow [2025-01-10 06:32:59,550 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=257, PETRI_PLACES=92, PETRI_TRANSITIONS=81} [2025-01-10 06:32:59,551 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 15 predicate places. [2025-01-10 06:32:59,551 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 81 transitions, 257 flow [2025-01-10 06:32:59,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 30.0) internal successors, (240), 8 states have internal predecessors, (240), 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,551 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:32:59,551 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:32:59,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 06:32:59,551 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:59,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:32:59,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1475359836, now seen corresponding path program 1 times [2025-01-10 06:32:59,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:32:59,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260456411] [2025-01-10 06:32:59,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:59,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:32:59,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 06:32:59,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 06:32:59,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:59,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:32:59,645 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:59,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:32:59,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260456411] [2025-01-10 06:32:59,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260456411] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:32:59,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:32:59,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:32:59,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035172751] [2025-01-10 06:32:59,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:32:59,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:32:59,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:32:59,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:32:59,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:32:59,651 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 83 [2025-01-10 06:32:59,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 81 transitions, 257 flow. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 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,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:32:59,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 83 [2025-01-10 06:32:59,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:00,203 INFO L124 PetriNetUnfolderBase]: 2103/4453 cut-off events. [2025-01-10 06:33:00,204 INFO L125 PetriNetUnfolderBase]: For 2004/2058 co-relation queries the response was YES. [2025-01-10 06:33:00,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9814 conditions, 4453 events. 2103/4453 cut-off events. For 2004/2058 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 29265 event pairs, 375 based on Foata normal form. 87/4282 useless extension candidates. Maximal degree in co-relation 9151. Up to 2113 conditions per place. [2025-01-10 06:33:00,223 INFO L140 encePairwiseOnDemand]: 78/83 looper letters, 103 selfloop transitions, 6 changer transitions 6/143 dead transitions. [2025-01-10 06:33:00,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 143 transitions, 697 flow [2025-01-10 06:33:00,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:33:00,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:33:00,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 232 transitions. [2025-01-10 06:33:00,225 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6987951807228916 [2025-01-10 06:33:00,225 INFO L175 Difference]: Start difference. First operand has 92 places, 81 transitions, 257 flow. Second operand 4 states and 232 transitions. [2025-01-10 06:33:00,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 143 transitions, 697 flow [2025-01-10 06:33:00,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 143 transitions, 671 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-01-10 06:33:00,231 INFO L231 Difference]: Finished difference. Result has 90 places, 79 transitions, 257 flow [2025-01-10 06:33:00,231 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=257, PETRI_PLACES=90, PETRI_TRANSITIONS=79} [2025-01-10 06:33:00,232 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 13 predicate places. [2025-01-10 06:33:00,232 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 79 transitions, 257 flow [2025-01-10 06:33:00,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 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,232 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:00,232 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:33:00,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:33:00,232 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-01-10 06:33:00,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:00,233 INFO L85 PathProgramCache]: Analyzing trace with hash -277447081, now seen corresponding path program 1 times [2025-01-10 06:33:00,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:00,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754176035] [2025-01-10 06:33:00,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:00,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:00,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 06:33:00,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 06:33:00,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:00,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:01,703 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:01,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:01,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754176035] [2025-01-10 06:33:01,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754176035] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:01,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:01,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 06:33:01,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382703208] [2025-01-10 06:33:01,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:01,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:33:01,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:01,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:33:01,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:33:01,735 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 83 [2025-01-10 06:33:01,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 79 transitions, 257 flow. Second operand has 8 states, 8 states have (on average 30.0) internal successors, (240), 8 states have internal predecessors, (240), 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,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:01,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 83 [2025-01-10 06:33:01,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:02,658 INFO L124 PetriNetUnfolderBase]: 2331/4834 cut-off events. [2025-01-10 06:33:02,658 INFO L125 PetriNetUnfolderBase]: For 3247/3247 co-relation queries the response was YES. [2025-01-10 06:33:02,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11242 conditions, 4834 events. 2331/4834 cut-off events. For 3247/3247 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 31590 event pairs, 444 based on Foata normal form. 22/4495 useless extension candidates. Maximal degree in co-relation 10562. Up to 2624 conditions per place. [2025-01-10 06:33:02,681 INFO L140 encePairwiseOnDemand]: 74/83 looper letters, 132 selfloop transitions, 8 changer transitions 2/167 dead transitions. [2025-01-10 06:33:02,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 167 transitions, 934 flow [2025-01-10 06:33:02,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 06:33:02,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 06:33:02,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 375 transitions. [2025-01-10 06:33:02,682 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5020080321285141 [2025-01-10 06:33:02,682 INFO L175 Difference]: Start difference. First operand has 90 places, 79 transitions, 257 flow. Second operand 9 states and 375 transitions. [2025-01-10 06:33:02,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 167 transitions, 934 flow [2025-01-10 06:33:02,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 167 transitions, 874 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:33:02,689 INFO L231 Difference]: Finished difference. Result has 94 places, 78 transitions, 258 flow [2025-01-10 06:33:02,689 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=86, 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=258, PETRI_PLACES=94, PETRI_TRANSITIONS=78} [2025-01-10 06:33:02,690 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 17 predicate places. [2025-01-10 06:33:02,690 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 78 transitions, 258 flow [2025-01-10 06:33:02,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 30.0) internal successors, (240), 8 states have internal predecessors, (240), 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:02,690 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:02,690 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:33:02,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 06:33:02,690 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-01-10 06:33:02,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:02,691 INFO L85 PathProgramCache]: Analyzing trace with hash -10954321, now seen corresponding path program 1 times [2025-01-10 06:33:02,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:02,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368628688] [2025-01-10 06:33:02,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:02,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:02,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 06:33:02,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 06:33:02,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:02,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:02,810 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:02,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:02,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368628688] [2025-01-10 06:33:02,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368628688] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:02,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:02,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:33:02,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829857801] [2025-01-10 06:33:02,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:02,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:33:02,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:02,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:33:02,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:33:02,819 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2025-01-10 06:33:02,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 78 transitions, 258 flow. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 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:02,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:02,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2025-01-10 06:33:02,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:03,542 INFO L124 PetriNetUnfolderBase]: 2969/6042 cut-off events. [2025-01-10 06:33:03,542 INFO L125 PetriNetUnfolderBase]: For 3024/3034 co-relation queries the response was YES. [2025-01-10 06:33:03,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13946 conditions, 6042 events. 2969/6042 cut-off events. For 3024/3034 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 41591 event pairs, 1613 based on Foata normal form. 144/5877 useless extension candidates. Maximal degree in co-relation 13069. Up to 3799 conditions per place. [2025-01-10 06:33:03,564 INFO L140 encePairwiseOnDemand]: 75/83 looper letters, 96 selfloop transitions, 3 changer transitions 0/124 dead transitions. [2025-01-10 06:33:03,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 124 transitions, 631 flow [2025-01-10 06:33:03,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:33:03,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:33:03,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 219 transitions. [2025-01-10 06:33:03,565 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6596385542168675 [2025-01-10 06:33:03,565 INFO L175 Difference]: Start difference. First operand has 94 places, 78 transitions, 258 flow. Second operand 4 states and 219 transitions. [2025-01-10 06:33:03,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 124 transitions, 631 flow [2025-01-10 06:33:03,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 124 transitions, 616 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 06:33:03,569 INFO L231 Difference]: Finished difference. Result has 93 places, 80 transitions, 274 flow [2025-01-10 06:33:03,570 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=274, PETRI_PLACES=93, PETRI_TRANSITIONS=80} [2025-01-10 06:33:03,570 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 16 predicate places. [2025-01-10 06:33:03,570 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 80 transitions, 274 flow [2025-01-10 06:33:03,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 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:03,570 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:03,570 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:33:03,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 06:33:03,570 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-01-10 06:33:03,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:03,571 INFO L85 PathProgramCache]: Analyzing trace with hash -338596516, now seen corresponding path program 1 times [2025-01-10 06:33:03,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:03,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69676612] [2025-01-10 06:33:03,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:03,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:03,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 06:33:03,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 06:33:03,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:03,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:04,361 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:04,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:04,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69676612] [2025-01-10 06:33:04,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69676612] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:04,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:04,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 06:33:04,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388544406] [2025-01-10 06:33:04,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:04,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:33:04,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:04,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:33:04,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:33:04,396 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2025-01-10 06:33:04,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 80 transitions, 274 flow. Second operand has 8 states, 8 states have (on average 34.25) internal successors, (274), 8 states have internal predecessors, (274), 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:04,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:04,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2025-01-10 06:33:04,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:05,567 INFO L124 PetriNetUnfolderBase]: 2804/5877 cut-off events. [2025-01-10 06:33:05,567 INFO L125 PetriNetUnfolderBase]: For 2855/2921 co-relation queries the response was YES. [2025-01-10 06:33:05,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14060 conditions, 5877 events. 2804/5877 cut-off events. For 2855/2921 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 40916 event pairs, 518 based on Foata normal form. 44/5692 useless extension candidates. Maximal degree in co-relation 13201. Up to 2804 conditions per place. [2025-01-10 06:33:05,602 INFO L140 encePairwiseOnDemand]: 68/83 looper letters, 130 selfloop transitions, 13 changer transitions 2/172 dead transitions. [2025-01-10 06:33:05,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 172 transitions, 930 flow [2025-01-10 06:33:05,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 06:33:05,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 06:33:05,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 414 transitions. [2025-01-10 06:33:05,604 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5542168674698795 [2025-01-10 06:33:05,604 INFO L175 Difference]: Start difference. First operand has 93 places, 80 transitions, 274 flow. Second operand 9 states and 414 transitions. [2025-01-10 06:33:05,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 172 transitions, 930 flow [2025-01-10 06:33:05,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 172 transitions, 927 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:33:05,612 INFO L231 Difference]: Finished difference. Result has 103 places, 83 transitions, 331 flow [2025-01-10 06:33:05,613 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=331, PETRI_PLACES=103, PETRI_TRANSITIONS=83} [2025-01-10 06:33:05,614 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 26 predicate places. [2025-01-10 06:33:05,614 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 83 transitions, 331 flow [2025-01-10 06:33:05,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 34.25) internal successors, (274), 8 states have internal predecessors, (274), 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:05,615 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:05,615 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] [2025-01-10 06:33:05,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 06:33:05,615 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:33:05,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:05,616 INFO L85 PathProgramCache]: Analyzing trace with hash -42749339, now seen corresponding path program 1 times [2025-01-10 06:33:05,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:05,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664061537] [2025-01-10 06:33:05,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:05,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:05,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 06:33:05,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 06:33:05,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:05,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:05,764 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:33:05,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:05,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664061537] [2025-01-10 06:33:05,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664061537] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:33:05,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096149391] [2025-01-10 06:33:05,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:05,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:33:05,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:33:05,767 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:33:05,770 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:33:05,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 06:33:05,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 06:33:05,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:05,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:05,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 1820 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:33:05,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:33:06,012 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:33:06,012 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:33:06,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096149391] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:06,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:33:06,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-01-10 06:33:06,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712905228] [2025-01-10 06:33:06,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:06,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:33:06,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:06,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:33:06,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:33:06,024 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 83 [2025-01-10 06:33:06,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 83 transitions, 331 flow. Second operand has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 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:06,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:06,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 83 [2025-01-10 06:33:06,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:06,855 INFO L124 PetriNetUnfolderBase]: 3093/6084 cut-off events. [2025-01-10 06:33:06,855 INFO L125 PetriNetUnfolderBase]: For 4002/4036 co-relation queries the response was YES. [2025-01-10 06:33:06,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15712 conditions, 6084 events. 3093/6084 cut-off events. For 4002/4036 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 40422 event pairs, 680 based on Foata normal form. 150/5979 useless extension candidates. Maximal degree in co-relation 14761. Up to 3349 conditions per place. [2025-01-10 06:33:06,885 INFO L140 encePairwiseOnDemand]: 78/83 looper letters, 80 selfloop transitions, 5 changer transitions 0/109 dead transitions. [2025-01-10 06:33:06,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 109 transitions, 603 flow [2025-01-10 06:33:06,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:33:06,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:33:06,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 194 transitions. [2025-01-10 06:33:06,886 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5843373493975904 [2025-01-10 06:33:06,886 INFO L175 Difference]: Start difference. First operand has 103 places, 83 transitions, 331 flow. Second operand 4 states and 194 transitions. [2025-01-10 06:33:06,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 109 transitions, 603 flow [2025-01-10 06:33:06,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 109 transitions, 591 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-10 06:33:06,896 INFO L231 Difference]: Finished difference. Result has 99 places, 81 transitions, 321 flow [2025-01-10 06:33:06,897 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=321, PETRI_PLACES=99, PETRI_TRANSITIONS=81} [2025-01-10 06:33:06,897 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 22 predicate places. [2025-01-10 06:33:06,897 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 81 transitions, 321 flow [2025-01-10 06:33:06,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 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:06,897 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:06,897 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] [2025-01-10 06:33:06,905 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:33:07,098 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:33:07,098 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:33:07,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:07,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1325227132, now seen corresponding path program 1 times [2025-01-10 06:33:07,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:07,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118965635] [2025-01-10 06:33:07,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:07,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:07,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 06:33:07,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 06:33:07,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:07,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:07,183 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:33:07,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:07,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118965635] [2025-01-10 06:33:07,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118965635] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:07,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:07,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:33:07,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291138988] [2025-01-10 06:33:07,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:07,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:33:07,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:07,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:33:07,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:33:07,190 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 83 [2025-01-10 06:33:07,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 81 transitions, 321 flow. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 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:07,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:07,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 83 [2025-01-10 06:33:07,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:07,795 INFO L124 PetriNetUnfolderBase]: 2751/5632 cut-off events. [2025-01-10 06:33:07,795 INFO L125 PetriNetUnfolderBase]: For 4193/4213 co-relation queries the response was YES. [2025-01-10 06:33:07,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14578 conditions, 5632 events. 2751/5632 cut-off events. For 4193/4213 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 37838 event pairs, 724 based on Foata normal form. 150/5633 useless extension candidates. Maximal degree in co-relation 13677. Up to 2840 conditions per place. [2025-01-10 06:33:07,819 INFO L140 encePairwiseOnDemand]: 77/83 looper letters, 84 selfloop transitions, 6 changer transitions 0/114 dead transitions. [2025-01-10 06:33:07,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 114 transitions, 625 flow [2025-01-10 06:33:07,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:33:07,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:33:07,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions. [2025-01-10 06:33:07,821 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5993975903614458 [2025-01-10 06:33:07,821 INFO L175 Difference]: Start difference. First operand has 99 places, 81 transitions, 321 flow. Second operand 4 states and 199 transitions. [2025-01-10 06:33:07,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 114 transitions, 625 flow [2025-01-10 06:33:07,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 114 transitions, 615 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:33:07,832 INFO L231 Difference]: Finished difference. Result has 98 places, 80 transitions, 323 flow [2025-01-10 06:33:07,832 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=323, PETRI_PLACES=98, PETRI_TRANSITIONS=80} [2025-01-10 06:33:07,833 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 21 predicate places. [2025-01-10 06:33:07,833 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 80 transitions, 323 flow [2025-01-10 06:33:07,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 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:07,833 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:07,833 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] [2025-01-10 06:33:07,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 06:33:07,833 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:33:07,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:07,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1096630210, now seen corresponding path program 1 times [2025-01-10 06:33:07,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:07,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173580761] [2025-01-10 06:33:07,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:07,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:07,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 06:33:07,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 06:33:07,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:07,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:07,966 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:07,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:07,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173580761] [2025-01-10 06:33:07,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173580761] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:07,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:07,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:33:07,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92073731] [2025-01-10 06:33:07,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:07,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:33:07,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:07,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:33:07,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:33:07,968 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 83 [2025-01-10 06:33:07,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 80 transitions, 323 flow. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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:07,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:07,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 83 [2025-01-10 06:33:07,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:08,280 INFO L124 PetriNetUnfolderBase]: 1748/3956 cut-off events. [2025-01-10 06:33:08,281 INFO L125 PetriNetUnfolderBase]: For 3959/3959 co-relation queries the response was YES. [2025-01-10 06:33:08,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10572 conditions, 3956 events. 1748/3956 cut-off events. For 3959/3959 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 25742 event pairs, 514 based on Foata normal form. 170/4045 useless extension candidates. Maximal degree in co-relation 9681. Up to 1956 conditions per place. [2025-01-10 06:33:08,296 INFO L140 encePairwiseOnDemand]: 77/83 looper letters, 63 selfloop transitions, 6 changer transitions 0/95 dead transitions. [2025-01-10 06:33:08,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 95 transitions, 528 flow [2025-01-10 06:33:08,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:33:08,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:33:08,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2025-01-10 06:33:08,297 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6626506024096386 [2025-01-10 06:33:08,297 INFO L175 Difference]: Start difference. First operand has 98 places, 80 transitions, 323 flow. Second operand 3 states and 165 transitions. [2025-01-10 06:33:08,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 95 transitions, 528 flow [2025-01-10 06:33:08,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 95 transitions, 509 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-01-10 06:33:08,305 INFO L231 Difference]: Finished difference. Result has 98 places, 78 transitions, 305 flow [2025-01-10 06:33:08,305 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=305, PETRI_PLACES=98, PETRI_TRANSITIONS=78} [2025-01-10 06:33:08,305 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 21 predicate places. [2025-01-10 06:33:08,305 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 78 transitions, 305 flow [2025-01-10 06:33:08,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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:08,306 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:08,306 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:33:08,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 06:33:08,306 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:33:08,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:08,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1308998668, now seen corresponding path program 1 times [2025-01-10 06:33:08,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:08,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440179831] [2025-01-10 06:33:08,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:08,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:08,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 06:33:08,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 06:33:08,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:08,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:09,027 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:09,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:09,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440179831] [2025-01-10 06:33:09,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440179831] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:09,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:09,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:33:09,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605708447] [2025-01-10 06:33:09,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:09,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:33:09,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:09,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:33:09,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:33:09,046 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2025-01-10 06:33:09,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 78 transitions, 305 flow. Second operand has 8 states, 8 states have (on average 35.125) internal successors, (281), 8 states have internal predecessors, (281), 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:09,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:09,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2025-01-10 06:33:09,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:09,873 INFO L124 PetriNetUnfolderBase]: 1760/3861 cut-off events. [2025-01-10 06:33:09,873 INFO L125 PetriNetUnfolderBase]: For 3408/3410 co-relation queries the response was YES. [2025-01-10 06:33:09,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10474 conditions, 3861 events. 1760/3861 cut-off events. For 3408/3410 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 24257 event pairs, 308 based on Foata normal form. 36/3771 useless extension candidates. Maximal degree in co-relation 9608. Up to 1776 conditions per place. [2025-01-10 06:33:09,889 INFO L140 encePairwiseOnDemand]: 73/83 looper letters, 108 selfloop transitions, 9 changer transitions 2/143 dead transitions. [2025-01-10 06:33:09,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 143 transitions, 835 flow [2025-01-10 06:33:09,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 06:33:09,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 06:33:09,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 356 transitions. [2025-01-10 06:33:09,890 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.536144578313253 [2025-01-10 06:33:09,890 INFO L175 Difference]: Start difference. First operand has 98 places, 78 transitions, 305 flow. Second operand 8 states and 356 transitions. [2025-01-10 06:33:09,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 143 transitions, 835 flow [2025-01-10 06:33:09,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 143 transitions, 819 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:33:09,897 INFO L231 Difference]: Finished difference. Result has 103 places, 77 transitions, 306 flow [2025-01-10 06:33:09,897 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=306, PETRI_PLACES=103, PETRI_TRANSITIONS=77} [2025-01-10 06:33:09,897 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 26 predicate places. [2025-01-10 06:33:09,898 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 77 transitions, 306 flow [2025-01-10 06:33:09,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 35.125) internal successors, (281), 8 states have internal predecessors, (281), 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:09,898 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:09,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] [2025-01-10 06:33:09,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 06:33:09,898 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-01-10 06:33:09,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:09,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1529546222, now seen corresponding path program 1 times [2025-01-10 06:33:09,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:09,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132504733] [2025-01-10 06:33:09,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:09,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:09,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 06:33:10,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 06:33:10,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:10,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:11,413 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:11,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:11,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132504733] [2025-01-10 06:33:11,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132504733] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:11,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:11,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 06:33:11,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822959731] [2025-01-10 06:33:11,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:11,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:33:11,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:11,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:33:11,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:33:11,462 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 83 [2025-01-10 06:33:11,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 77 transitions, 306 flow. Second operand has 10 states, 10 states have (on average 31.7) internal successors, (317), 10 states have internal predecessors, (317), 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:11,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:11,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 83 [2025-01-10 06:33:11,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:12,370 INFO L124 PetriNetUnfolderBase]: 2162/4613 cut-off events. [2025-01-10 06:33:12,370 INFO L125 PetriNetUnfolderBase]: For 4148/4150 co-relation queries the response was YES. [2025-01-10 06:33:12,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12441 conditions, 4613 events. 2162/4613 cut-off events. For 4148/4150 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 29210 event pairs, 213 based on Foata normal form. 0/4477 useless extension candidates. Maximal degree in co-relation 11480. Up to 1544 conditions per place. [2025-01-10 06:33:12,391 INFO L140 encePairwiseOnDemand]: 72/83 looper letters, 146 selfloop transitions, 12 changer transitions 2/181 dead transitions. [2025-01-10 06:33:12,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 181 transitions, 1073 flow [2025-01-10 06:33:12,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 06:33:12,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 06:33:12,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 454 transitions. [2025-01-10 06:33:12,393 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49726177437020813 [2025-01-10 06:33:12,394 INFO L175 Difference]: Start difference. First operand has 103 places, 77 transitions, 306 flow. Second operand 11 states and 454 transitions. [2025-01-10 06:33:12,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 181 transitions, 1073 flow [2025-01-10 06:33:12,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 181 transitions, 1057 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 06:33:12,401 INFO L231 Difference]: Finished difference. Result has 111 places, 82 transitions, 352 flow [2025-01-10 06:33:12,401 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=352, PETRI_PLACES=111, PETRI_TRANSITIONS=82} [2025-01-10 06:33:12,401 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 34 predicate places. [2025-01-10 06:33:12,401 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 82 transitions, 352 flow [2025-01-10 06:33:12,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 31.7) internal successors, (317), 10 states have internal predecessors, (317), 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:12,401 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:12,401 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] [2025-01-10 06:33:12,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 06:33:12,402 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-01-10 06:33:12,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:12,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1290008455, now seen corresponding path program 1 times [2025-01-10 06:33:12,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:12,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208322681] [2025-01-10 06:33:12,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:12,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:12,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 06:33:12,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 06:33:12,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:12,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:12,519 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:12,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:12,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208322681] [2025-01-10 06:33:12,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208322681] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:12,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:12,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:33:12,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457253866] [2025-01-10 06:33:12,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:12,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:33:12,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:12,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:33:12,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:33:12,649 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 83 [2025-01-10 06:33:12,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 82 transitions, 352 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:33:12,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:12,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 83 [2025-01-10 06:33:12,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:13,153 INFO L124 PetriNetUnfolderBase]: 1680/3795 cut-off events. [2025-01-10 06:33:13,154 INFO L125 PetriNetUnfolderBase]: For 4008/4014 co-relation queries the response was YES. [2025-01-10 06:33:13,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10257 conditions, 3795 events. 1680/3795 cut-off events. For 4008/4014 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 23386 event pairs, 1011 based on Foata normal form. 30/3735 useless extension candidates. Maximal degree in co-relation 9508. Up to 1854 conditions per place. [2025-01-10 06:33:13,171 INFO L140 encePairwiseOnDemand]: 80/83 looper letters, 70 selfloop transitions, 2 changer transitions 0/99 dead transitions. [2025-01-10 06:33:13,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 99 transitions, 566 flow [2025-01-10 06:33:13,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:33:13,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:33:13,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2025-01-10 06:33:13,173 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6626506024096386 [2025-01-10 06:33:13,173 INFO L175 Difference]: Start difference. First operand has 111 places, 82 transitions, 352 flow. Second operand 3 states and 165 transitions. [2025-01-10 06:33:13,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 99 transitions, 566 flow [2025-01-10 06:33:13,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 99 transitions, 551 flow, removed 1 selfloop flow, removed 6 redundant places. [2025-01-10 06:33:13,181 INFO L231 Difference]: Finished difference. Result has 108 places, 80 transitions, 333 flow [2025-01-10 06:33:13,182 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=333, PETRI_PLACES=108, PETRI_TRANSITIONS=80} [2025-01-10 06:33:13,183 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 31 predicate places. [2025-01-10 06:33:13,184 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 80 transitions, 333 flow [2025-01-10 06:33:13,184 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:33:13,184 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:13,184 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:33:13,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 06:33:13,184 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:33:13,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:13,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1192004575, now seen corresponding path program 1 times [2025-01-10 06:33:13,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:13,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485679287] [2025-01-10 06:33:13,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:13,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:13,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-10 06:33:13,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 06:33:13,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:13,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:15,476 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:15,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:15,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485679287] [2025-01-10 06:33:15,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485679287] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:15,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:15,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 06:33:15,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426601851] [2025-01-10 06:33:15,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:15,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 06:33:15,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:15,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 06:33:15,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-10 06:33:15,564 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 83 [2025-01-10 06:33:15,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 80 transitions, 333 flow. Second operand has 12 states, 12 states have (on average 28.25) internal successors, (339), 12 states have internal predecessors, (339), 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:15,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:15,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 83 [2025-01-10 06:33:15,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:16,998 INFO L124 PetriNetUnfolderBase]: 2033/4374 cut-off events. [2025-01-10 06:33:16,998 INFO L125 PetriNetUnfolderBase]: For 4184/4184 co-relation queries the response was YES. [2025-01-10 06:33:17,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11920 conditions, 4374 events. 2033/4374 cut-off events. For 4184/4184 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 26791 event pairs, 285 based on Foata normal form. 26/4286 useless extension candidates. Maximal degree in co-relation 11181. Up to 1141 conditions per place. [2025-01-10 06:33:17,013 INFO L140 encePairwiseOnDemand]: 68/83 looper letters, 160 selfloop transitions, 15 changer transitions 11/207 dead transitions. [2025-01-10 06:33:17,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 207 transitions, 1267 flow [2025-01-10 06:33:17,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 06:33:17,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-10 06:33:17,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 520 transitions. [2025-01-10 06:33:17,014 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4475043029259897 [2025-01-10 06:33:17,014 INFO L175 Difference]: Start difference. First operand has 108 places, 80 transitions, 333 flow. Second operand 14 states and 520 transitions. [2025-01-10 06:33:17,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 207 transitions, 1267 flow [2025-01-10 06:33:17,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 207 transitions, 1259 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:33:17,021 INFO L231 Difference]: Finished difference. Result has 121 places, 82 transitions, 382 flow [2025-01-10 06:33:17,021 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=382, PETRI_PLACES=121, PETRI_TRANSITIONS=82} [2025-01-10 06:33:17,021 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 44 predicate places. [2025-01-10 06:33:17,021 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 82 transitions, 382 flow [2025-01-10 06:33:17,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 28.25) internal successors, (339), 12 states have internal predecessors, (339), 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:17,022 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:17,022 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] [2025-01-10 06:33:17,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 06:33:17,022 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-01-10 06:33:17,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:17,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1401073998, now seen corresponding path program 1 times [2025-01-10 06:33:17,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:17,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121975346] [2025-01-10 06:33:17,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:17,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:17,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-10 06:33:17,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 06:33:17,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:17,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:18,252 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:18,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:18,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121975346] [2025-01-10 06:33:18,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121975346] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:18,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:18,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:33:18,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291879589] [2025-01-10 06:33:18,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:18,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:33:18,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:18,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:33:18,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:33:18,259 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 83 [2025-01-10 06:33:18,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 82 transitions, 382 flow. Second operand has 9 states, 9 states have (on average 36.22222222222222) internal successors, (326), 9 states have internal predecessors, (326), 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:18,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:18,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 83 [2025-01-10 06:33:18,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:19,118 INFO L124 PetriNetUnfolderBase]: 2044/4344 cut-off events. [2025-01-10 06:33:19,118 INFO L125 PetriNetUnfolderBase]: For 5076/5080 co-relation queries the response was YES. [2025-01-10 06:33:19,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12271 conditions, 4344 events. 2044/4344 cut-off events. For 5076/5080 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 26416 event pairs, 316 based on Foata normal form. 0/4279 useless extension candidates. Maximal degree in co-relation 11507. Up to 1461 conditions per place. [2025-01-10 06:33:19,144 INFO L140 encePairwiseOnDemand]: 74/83 looper letters, 101 selfloop transitions, 14 changer transitions 5/144 dead transitions. [2025-01-10 06:33:19,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 144 transitions, 897 flow [2025-01-10 06:33:19,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 06:33:19,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 06:33:19,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 391 transitions. [2025-01-10 06:33:19,150 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5234270414993306 [2025-01-10 06:33:19,150 INFO L175 Difference]: Start difference. First operand has 121 places, 82 transitions, 382 flow. Second operand 9 states and 391 transitions. [2025-01-10 06:33:19,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 144 transitions, 897 flow [2025-01-10 06:33:19,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 144 transitions, 871 flow, removed 2 selfloop flow, removed 11 redundant places. [2025-01-10 06:33:19,160 INFO L231 Difference]: Finished difference. Result has 117 places, 82 transitions, 386 flow [2025-01-10 06:33:19,160 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=386, PETRI_PLACES=117, PETRI_TRANSITIONS=82} [2025-01-10 06:33:19,161 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 40 predicate places. [2025-01-10 06:33:19,161 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 82 transitions, 386 flow [2025-01-10 06:33:19,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 36.22222222222222) internal successors, (326), 9 states have internal predecessors, (326), 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:19,161 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:19,161 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:33:19,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 06:33:19,161 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-01-10 06:33:19,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:19,162 INFO L85 PathProgramCache]: Analyzing trace with hash 221076838, now seen corresponding path program 1 times [2025-01-10 06:33:19,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:19,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243423668] [2025-01-10 06:33:19,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:19,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:19,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-10 06:33:19,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-10 06:33:19,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:19,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:20,626 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:20,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:20,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243423668] [2025-01-10 06:33:20,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243423668] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:20,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:20,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 06:33:20,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688577636] [2025-01-10 06:33:20,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:20,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:33:20,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:20,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:33:20,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:33:20,650 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 83 [2025-01-10 06:33:20,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 82 transitions, 386 flow. Second operand has 10 states, 10 states have (on average 32.9) internal successors, (329), 10 states have internal predecessors, (329), 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:20,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:20,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 83 [2025-01-10 06:33:20,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:21,585 INFO L124 PetriNetUnfolderBase]: 2012/4284 cut-off events. [2025-01-10 06:33:21,585 INFO L125 PetriNetUnfolderBase]: For 4861/4863 co-relation queries the response was YES. [2025-01-10 06:33:21,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12143 conditions, 4284 events. 2012/4284 cut-off events. For 4861/4863 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 25824 event pairs, 280 based on Foata normal form. 26/4270 useless extension candidates. Maximal degree in co-relation 11389. Up to 1301 conditions per place. [2025-01-10 06:33:21,606 INFO L140 encePairwiseOnDemand]: 69/83 looper letters, 137 selfloop transitions, 13 changer transitions 16/189 dead transitions. [2025-01-10 06:33:21,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 189 transitions, 1190 flow [2025-01-10 06:33:21,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 06:33:21,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 06:33:21,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 496 transitions. [2025-01-10 06:33:21,607 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4979919678714859 [2025-01-10 06:33:21,607 INFO L175 Difference]: Start difference. First operand has 117 places, 82 transitions, 386 flow. Second operand 12 states and 496 transitions. [2025-01-10 06:33:21,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 189 transitions, 1190 flow [2025-01-10 06:33:21,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 189 transitions, 1173 flow, removed 1 selfloop flow, removed 6 redundant places. [2025-01-10 06:33:21,616 INFO L231 Difference]: Finished difference. Result has 125 places, 85 transitions, 422 flow [2025-01-10 06:33:21,616 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=369, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=422, PETRI_PLACES=125, PETRI_TRANSITIONS=85} [2025-01-10 06:33:21,616 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 48 predicate places. [2025-01-10 06:33:21,616 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 85 transitions, 422 flow [2025-01-10 06:33:21,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 32.9) internal successors, (329), 10 states have internal predecessors, (329), 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:21,617 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:21,617 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] [2025-01-10 06:33:21,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-10 06:33:21,617 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-01-10 06:33:21,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:21,617 INFO L85 PathProgramCache]: Analyzing trace with hash 96357162, now seen corresponding path program 1 times [2025-01-10 06:33:21,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:21,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101780194] [2025-01-10 06:33:21,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:21,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:21,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-10 06:33:21,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 06:33:21,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:21,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:23,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:33:23,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:23,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101780194] [2025-01-10 06:33:23,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101780194] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:23,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:23,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 06:33:23,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428680676] [2025-01-10 06:33:23,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:23,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 06:33:23,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:23,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 06:33:23,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-10 06:33:23,278 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2025-01-10 06:33:23,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 85 transitions, 422 flow. Second operand has 11 states, 11 states have (on average 35.09090909090909) internal successors, (386), 11 states have internal predecessors, (386), 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:23,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:23,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2025-01-10 06:33:23,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:24,405 INFO L124 PetriNetUnfolderBase]: 1748/3791 cut-off events. [2025-01-10 06:33:24,405 INFO L125 PetriNetUnfolderBase]: For 4856/4858 co-relation queries the response was YES. [2025-01-10 06:33:24,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11021 conditions, 3791 events. 1748/3791 cut-off events. For 4856/4858 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 22096 event pairs, 265 based on Foata normal form. 26/3779 useless extension candidates. Maximal degree in co-relation 10257. Up to 946 conditions per place. [2025-01-10 06:33:24,428 INFO L140 encePairwiseOnDemand]: 69/83 looper letters, 137 selfloop transitions, 13 changer transitions 15/189 dead transitions. [2025-01-10 06:33:24,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 189 transitions, 1207 flow [2025-01-10 06:33:24,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 06:33:24,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 06:33:24,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 519 transitions. [2025-01-10 06:33:24,429 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5210843373493976 [2025-01-10 06:33:24,429 INFO L175 Difference]: Start difference. First operand has 125 places, 85 transitions, 422 flow. Second operand 12 states and 519 transitions. [2025-01-10 06:33:24,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 189 transitions, 1207 flow [2025-01-10 06:33:24,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 189 transitions, 1185 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-01-10 06:33:24,439 INFO L231 Difference]: Finished difference. Result has 127 places, 83 transitions, 411 flow [2025-01-10 06:33:24,439 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=411, PETRI_PLACES=127, PETRI_TRANSITIONS=83} [2025-01-10 06:33:24,439 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 50 predicate places. [2025-01-10 06:33:24,440 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 83 transitions, 411 flow [2025-01-10 06:33:24,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 35.09090909090909) internal successors, (386), 11 states have internal predecessors, (386), 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:24,440 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:24,440 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] [2025-01-10 06:33:24,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-10 06:33:24,440 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-01-10 06:33:24,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:24,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1444492661, now seen corresponding path program 1 times [2025-01-10 06:33:24,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:24,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944565482] [2025-01-10 06:33:24,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:24,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:24,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-10 06:33:24,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 06:33:24,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:24,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:25,040 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:25,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:25,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944565482] [2025-01-10 06:33:25,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944565482] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:25,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:25,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 06:33:25,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851458668] [2025-01-10 06:33:25,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:25,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:33:25,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:25,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:33:25,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:33:25,056 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 83 [2025-01-10 06:33:25,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 83 transitions, 411 flow. Second operand has 7 states, 7 states have (on average 32.57142857142857) internal successors, (228), 7 states have internal predecessors, (228), 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:25,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:25,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 83 [2025-01-10 06:33:25,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:25,746 INFO L124 PetriNetUnfolderBase]: 2054/4305 cut-off events. [2025-01-10 06:33:25,746 INFO L125 PetriNetUnfolderBase]: For 4993/4993 co-relation queries the response was YES. [2025-01-10 06:33:25,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12575 conditions, 4305 events. 2054/4305 cut-off events. For 4993/4993 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 25078 event pairs, 438 based on Foata normal form. 12/4293 useless extension candidates. Maximal degree in co-relation 11789. Up to 1845 conditions per place. [2025-01-10 06:33:25,767 INFO L140 encePairwiseOnDemand]: 70/83 looper letters, 112 selfloop transitions, 21 changer transitions 1/152 dead transitions. [2025-01-10 06:33:25,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 152 transitions, 981 flow [2025-01-10 06:33:25,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 06:33:25,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 06:33:25,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 352 transitions. [2025-01-10 06:33:25,768 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47121820615796517 [2025-01-10 06:33:25,768 INFO L175 Difference]: Start difference. First operand has 127 places, 83 transitions, 411 flow. Second operand 9 states and 352 transitions. [2025-01-10 06:33:25,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 152 transitions, 981 flow [2025-01-10 06:33:25,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 152 transitions, 953 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-01-10 06:33:25,776 INFO L231 Difference]: Finished difference. Result has 122 places, 86 transitions, 448 flow [2025-01-10 06:33:25,776 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=448, PETRI_PLACES=122, PETRI_TRANSITIONS=86} [2025-01-10 06:33:25,777 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 45 predicate places. [2025-01-10 06:33:25,777 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 86 transitions, 448 flow [2025-01-10 06:33:25,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 32.57142857142857) internal successors, (228), 7 states have internal predecessors, (228), 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:25,777 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:25,777 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, 1] [2025-01-10 06:33:25,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-10 06:33:25,777 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-01-10 06:33:25,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:25,778 INFO L85 PathProgramCache]: Analyzing trace with hash 153062, now seen corresponding path program 1 times [2025-01-10 06:33:25,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:25,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315787169] [2025-01-10 06:33:25,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:25,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:25,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-10 06:33:25,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-10 06:33:25,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:25,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:28,150 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:28,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:28,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315787169] [2025-01-10 06:33:28,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315787169] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:28,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:28,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-10 06:33:28,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294763849] [2025-01-10 06:33:28,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:28,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 06:33:28,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:28,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 06:33:28,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-01-10 06:33:28,256 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 83 [2025-01-10 06:33:28,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 86 transitions, 448 flow. Second operand has 15 states, 15 states have (on average 28.4) internal successors, (426), 15 states have internal predecessors, (426), 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:28,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:28,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 83 [2025-01-10 06:33:28,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:29,681 INFO L124 PetriNetUnfolderBase]: 2296/4926 cut-off events. [2025-01-10 06:33:29,682 INFO L125 PetriNetUnfolderBase]: For 6012/6012 co-relation queries the response was YES. [2025-01-10 06:33:29,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14264 conditions, 4926 events. 2296/4926 cut-off events. For 6012/6012 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 28365 event pairs, 425 based on Foata normal form. 21/4911 useless extension candidates. Maximal degree in co-relation 13510. Up to 1014 conditions per place. [2025-01-10 06:33:29,706 INFO L140 encePairwiseOnDemand]: 68/83 looper letters, 192 selfloop transitions, 20 changer transitions 12/246 dead transitions. [2025-01-10 06:33:29,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 246 transitions, 1642 flow [2025-01-10 06:33:29,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-10 06:33:29,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-01-10 06:33:29,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 595 transitions. [2025-01-10 06:33:29,707 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4480421686746988 [2025-01-10 06:33:29,707 INFO L175 Difference]: Start difference. First operand has 122 places, 86 transitions, 448 flow. Second operand 16 states and 595 transitions. [2025-01-10 06:33:29,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 246 transitions, 1642 flow [2025-01-10 06:33:29,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 246 transitions, 1622 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-01-10 06:33:29,719 INFO L231 Difference]: Finished difference. Result has 140 places, 93 transitions, 565 flow [2025-01-10 06:33:29,719 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=565, PETRI_PLACES=140, PETRI_TRANSITIONS=93} [2025-01-10 06:33:29,719 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 63 predicate places. [2025-01-10 06:33:29,719 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 93 transitions, 565 flow [2025-01-10 06:33:29,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 28.4) internal successors, (426), 15 states have internal predecessors, (426), 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,719 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:29,719 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] [2025-01-10 06:33:29,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-10 06:33:29,720 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:29,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:29,720 INFO L85 PathProgramCache]: Analyzing trace with hash -2051089567, now seen corresponding path program 1 times [2025-01-10 06:33:29,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:29,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886462785] [2025-01-10 06:33:29,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:29,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:29,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-10 06:33:29,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-10 06:33:29,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:29,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:31,222 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:31,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:31,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886462785] [2025-01-10 06:33:31,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886462785] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:31,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:31,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 06:33:31,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269942842] [2025-01-10 06:33:31,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:31,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 06:33:31,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:31,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 06:33:31,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-01-10 06:33:31,239 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 83 [2025-01-10 06:33:31,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 93 transitions, 565 flow. Second operand has 12 states, 12 states have (on average 33.333333333333336) internal successors, (400), 12 states have internal predecessors, (400), 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,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:31,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 83 [2025-01-10 06:33:31,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:32,509 INFO L124 PetriNetUnfolderBase]: 2465/5216 cut-off events. [2025-01-10 06:33:32,509 INFO L125 PetriNetUnfolderBase]: For 7745/7750 co-relation queries the response was YES. [2025-01-10 06:33:32,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15628 conditions, 5216 events. 2465/5216 cut-off events. For 7745/7750 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 30124 event pairs, 430 based on Foata normal form. 12/5188 useless extension candidates. Maximal degree in co-relation 14826. Up to 1318 conditions per place. [2025-01-10 06:33:32,536 INFO L140 encePairwiseOnDemand]: 69/83 looper letters, 159 selfloop transitions, 20 changer transitions 12/214 dead transitions. [2025-01-10 06:33:32,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 214 transitions, 1500 flow [2025-01-10 06:33:32,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 06:33:32,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-10 06:33:32,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 573 transitions. [2025-01-10 06:33:32,537 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49311531841652323 [2025-01-10 06:33:32,537 INFO L175 Difference]: Start difference. First operand has 140 places, 93 transitions, 565 flow. Second operand 14 states and 573 transitions. [2025-01-10 06:33:32,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 214 transitions, 1500 flow [2025-01-10 06:33:32,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 214 transitions, 1469 flow, removed 4 selfloop flow, removed 11 redundant places. [2025-01-10 06:33:32,552 INFO L231 Difference]: Finished difference. Result has 146 places, 98 transitions, 638 flow [2025-01-10 06:33:32,552 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=638, PETRI_PLACES=146, PETRI_TRANSITIONS=98} [2025-01-10 06:33:32,552 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 69 predicate places. [2025-01-10 06:33:32,552 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 98 transitions, 638 flow [2025-01-10 06:33:32,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 33.333333333333336) internal successors, (400), 12 states have internal predecessors, (400), 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:32,553 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:32,553 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 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] [2025-01-10 06:33:32,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-10 06:33:32,553 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-01-10 06:33:32,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:32,553 INFO L85 PathProgramCache]: Analyzing trace with hash -253939505, now seen corresponding path program 1 times [2025-01-10 06:33:32,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:32,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996913206] [2025-01-10 06:33:32,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:32,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:32,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-10 06:33:32,619 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,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:32,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:34,184 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:34,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:34,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996913206] [2025-01-10 06:33:34,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996913206] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:33:34,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659157743] [2025-01-10 06:33:34,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:34,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:33:34,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:33:34,187 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:34,188 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:34,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-10 06:33:34,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-10 06:33:34,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:34,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:34,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 1986 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-01-10 06:33:34,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:33:34,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2025-01-10 06:33:34,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 06:33:34,527 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-10 06:33:34,547 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2025-01-10 06:33:34,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 47 [2025-01-10 06:33:34,592 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-10 06:33:34,593 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 38 treesize of output 31 [2025-01-10 06:33:34,650 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 29 treesize of output 3 [2025-01-10 06:33:34,688 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-10 06:33:34,695 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-01-10 06:33:34,696 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:34,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 06:33:34,728 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:34,770 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:34,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 06:33:34,844 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:34,860 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 29 treesize of output 13 [2025-01-10 06:33:34,889 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-01-10 06:33:34,890 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 45 treesize of output 35 [2025-01-10 06:33:34,914 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 29 treesize of output 13 [2025-01-10 06:33:34,927 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 19 treesize of output 7 [2025-01-10 06:33:34,932 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:34,932 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:33:35,849 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:35,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659157743] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:33:35,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:33:35,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 13] total 33 [2025-01-10 06:33:35,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75918438] [2025-01-10 06:33:35,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:33:35,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-01-10 06:33:35,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:35,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-01-10 06:33:35,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=924, Unknown=0, NotChecked=0, Total=1190 [2025-01-10 06:33:35,940 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2025-01-10 06:33:35,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 98 transitions, 638 flow. Second operand has 35 states, 35 states have (on average 35.22857142857143) internal successors, (1233), 35 states have internal predecessors, (1233), 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:35,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:35,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2025-01-10 06:33:35,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:42,604 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:47,551 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:49,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:33:54,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:33:58,685 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]