./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread/queue_ok_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_ok_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 f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:32:45,322 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:32:45,358 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:45,362 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:32:45,362 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:32:45,376 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:32:45,377 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:32:45,377 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:32:45,377 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:32:45,377 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:32:45,377 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:32:45,377 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:32:45,378 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:32:45,378 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:32:45,378 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:32:45,378 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:32:45,378 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:32:45,378 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:32:45,378 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:32:45,378 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:32:45,378 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:32:45,378 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:32:45,379 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:32:45,379 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:32:45,379 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:32:45,379 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:32:45,379 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:32:45,379 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:32:45,379 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:32:45,379 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:32:45,379 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:32:45,379 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:32:45,380 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:32:45,380 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:32:45,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:32:45,380 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:32:45,380 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:32:45,380 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:32:45,380 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:32:45,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:32:45,380 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:32:45,380 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:32:45,380 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:32:45,380 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:32:45,381 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:32:45,381 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:32:45,381 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:32:45,381 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:32:45,381 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:32:45,381 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:32:45,381 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 -> f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a [2025-01-10 06:32:45,568 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:32:45,577 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:32:45,579 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:32:45,580 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:32:45,580 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:32:45,581 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/queue_ok_longer.i [2025-01-10 06:32:46,801 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/df0474351/858d4a207a464bdd86a0f1e1d05f4dc7/FLAGae8ecf038 [2025-01-10 06:32:47,151 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:32:47,154 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/queue_ok_longer.i [2025-01-10 06:32:47,173 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/df0474351/858d4a207a464bdd86a0f1e1d05f4dc7/FLAGae8ecf038 [2025-01-10 06:32:47,386 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/df0474351/858d4a207a464bdd86a0f1e1d05f4dc7 [2025-01-10 06:32:47,388 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:32:47,390 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:32:47,392 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:32:47,393 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:32:47,397 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:32:47,400 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:32:47" (1/1) ... [2025-01-10 06:32:47,400 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45f0b043 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:32:47, skipping insertion in model container [2025-01-10 06:32:47,401 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:32:47" (1/1) ... [2025-01-10 06:32:47,423 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:32:47,819 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:32:47,864 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:32:47,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:32:48,007 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:32:48,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:32:48 WrapperNode [2025-01-10 06:32:48,009 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:32:48,010 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:32:48,010 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:32:48,010 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:32:48,016 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:48" (1/1) ... [2025-01-10 06:32:48,043 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:48" (1/1) ... [2025-01-10 06:32:48,095 INFO L138 Inliner]: procedures = 274, calls = 854, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 1007 [2025-01-10 06:32:48,095 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:32:48,096 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:32:48,096 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:32:48,096 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:32:48,103 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:48" (1/1) ... [2025-01-10 06:32:48,104 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:48" (1/1) ... [2025-01-10 06:32:48,115 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:48" (1/1) ... [2025-01-10 06:32:48,152 INFO L175 MemorySlicer]: Split 835 memory accesses to 4 slices as follows [2, 5, 402, 426]. 51 percent of accesses are in the largest equivalence class. The 810 initializations are split as follows [2, 5, 400, 403]. The 11 writes are split as follows [0, 0, 1, 10]. [2025-01-10 06:32:48,153 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:48" (1/1) ... [2025-01-10 06:32:48,153 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:48" (1/1) ... [2025-01-10 06:32:48,180 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:48" (1/1) ... [2025-01-10 06:32:48,183 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:48" (1/1) ... [2025-01-10 06:32:48,185 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:48" (1/1) ... [2025-01-10 06:32:48,188 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:48" (1/1) ... [2025-01-10 06:32:48,195 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:48" (1/1) ... [2025-01-10 06:32:48,204 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:32:48,205 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:32:48,205 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:32:48,205 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:32:48,206 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:32:48" (1/1) ... [2025-01-10 06:32:48,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:32:48,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:32:48,237 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:48,246 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:48,261 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-01-10 06:32:48,262 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-01-10 06:32:48,262 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-01-10 06:32:48,262 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-01-10 06:32:48,262 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 06:32:48,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:32:48,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:32:48,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 06:32:48,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 06:32:48,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:32:48,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:32:48,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 06:32:48,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 06:32:48,263 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 06:32:48,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:32:48,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:32:48,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:32:48,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 06:32:48,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 06:32:48,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:32:48,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:32:48,266 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:48,386 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:32:48,388 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:32:49,370 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:32:49,370 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:32:55,044 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:32:55,044 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 06:32:55,045 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:32:55 BoogieIcfgContainer [2025-01-10 06:32:55,045 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:32:55,046 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:32:55,047 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:32:55,050 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:32:55,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:32:47" (1/3) ... [2025-01-10 06:32:55,051 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43e88379 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:32:55, skipping insertion in model container [2025-01-10 06:32:55,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:32:48" (2/3) ... [2025-01-10 06:32:55,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43e88379 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:32:55, skipping insertion in model container [2025-01-10 06:32:55,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:32:55" (3/3) ... [2025-01-10 06:32:55,054 INFO L128 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2025-01-10 06:32:55,069 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:32:55,071 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG queue_ok_longer.i that has 3 procedures, 55 locations, 1 initial locations, 2 loop locations, and 12 error locations. [2025-01-10 06:32:55,071 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:32:55,151 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 06:32:55,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 61 transitions, 136 flow [2025-01-10 06:32:55,251 INFO L124 PetriNetUnfolderBase]: 7/59 cut-off events. [2025-01-10 06:32:55,254 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 06:32:55,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 59 events. 7/59 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 171 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2025-01-10 06:32:55,258 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 61 transitions, 136 flow [2025-01-10 06:32:55,261 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 57 transitions, 123 flow [2025-01-10 06:32:55,269 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:32:55,279 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;@48ae0c31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:32:55,279 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-01-10 06:32:55,316 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:32:55,316 INFO L124 PetriNetUnfolderBase]: 2/20 cut-off events. [2025-01-10 06:32:55,316 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 06:32:55,316 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:32:55,317 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:32:55,317 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-01-10 06:32:55,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:32:55,323 INFO L85 PathProgramCache]: Analyzing trace with hash -974504223, now seen corresponding path program 1 times [2025-01-10 06:32:55,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:32:55,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323924046] [2025-01-10 06:32:55,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:55,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:32:55,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:32:55,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:32:55,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:55,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:32:56,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:32:56,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:32:56,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323924046] [2025-01-10 06:32:56,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323924046] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:32:56,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:32:56,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:32:56,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152763170] [2025-01-10 06:32:56,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:32:56,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:32:56,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:32:56,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:32:56,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:32:56,899 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-01-10 06:32:56,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 57 transitions, 123 flow. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:32:56,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-01-10 06:32:56,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:32:57,367 INFO L124 PetriNetUnfolderBase]: 1024/2065 cut-off events. [2025-01-10 06:32:57,368 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2025-01-10 06:32:57,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3716 conditions, 2065 events. 1024/2065 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 13322 event pairs, 211 based on Foata normal form. 28/1697 useless extension candidates. Maximal degree in co-relation 3574. Up to 1033 conditions per place. [2025-01-10 06:32:57,399 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 73 selfloop transitions, 5 changer transitions 0/99 dead transitions. [2025-01-10 06:32:57,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 99 transitions, 372 flow [2025-01-10 06:32:57,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:32:57,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:32:57,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2025-01-10 06:32:57,408 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7008196721311475 [2025-01-10 06:32:57,409 INFO L175 Difference]: Start difference. First operand has 57 places, 57 transitions, 123 flow. Second operand 4 states and 171 transitions. [2025-01-10 06:32:57,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 99 transitions, 372 flow [2025-01-10 06:32:57,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 99 transitions, 363 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:32:57,416 INFO L231 Difference]: Finished difference. Result has 60 places, 61 transitions, 156 flow [2025-01-10 06:32:57,418 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=156, PETRI_PLACES=60, PETRI_TRANSITIONS=61} [2025-01-10 06:32:57,420 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 3 predicate places. [2025-01-10 06:32:57,420 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 61 transitions, 156 flow [2025-01-10 06:32:57,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:32:57,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:32:57,421 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:32:57,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:32:57,421 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-01-10 06:32:57,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:32:57,421 INFO L85 PathProgramCache]: Analyzing trace with hash -144857630, now seen corresponding path program 1 times [2025-01-10 06:32:57,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:32:57,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479362469] [2025-01-10 06:32:57,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:57,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:32:57,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:32:57,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:32:57,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:57,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:32:58,516 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,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:32:58,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479362469] [2025-01-10 06:32:58,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479362469] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:32:58,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:32:58,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:32:58,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262031610] [2025-01-10 06:32:58,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:32:58,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:32:58,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:32:58,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:32:58,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:32:58,521 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-01-10 06:32:58,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 61 transitions, 156 flow. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:32:58,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-01-10 06:32:58,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:32:59,148 INFO L124 PetriNetUnfolderBase]: 1019/2078 cut-off events. [2025-01-10 06:32:59,148 INFO L125 PetriNetUnfolderBase]: For 429/433 co-relation queries the response was YES. [2025-01-10 06:32:59,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4044 conditions, 2078 events. 1019/2078 cut-off events. For 429/433 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 13394 event pairs, 215 based on Foata normal form. 46/1828 useless extension candidates. Maximal degree in co-relation 2603. Up to 1122 conditions per place. [2025-01-10 06:32:59,162 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 81 selfloop transitions, 6 changer transitions 0/108 dead transitions. [2025-01-10 06:32:59,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 108 transitions, 435 flow [2025-01-10 06:32:59,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:32:59,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:32:59,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 204 transitions. [2025-01-10 06:32:59,168 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6688524590163935 [2025-01-10 06:32:59,169 INFO L175 Difference]: Start difference. First operand has 60 places, 61 transitions, 156 flow. Second operand 5 states and 204 transitions. [2025-01-10 06:32:59,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 108 transitions, 435 flow [2025-01-10 06:32:59,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 108 transitions, 430 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:32:59,173 INFO L231 Difference]: Finished difference. Result has 64 places, 62 transitions, 174 flow [2025-01-10 06:32:59,173 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=174, PETRI_PLACES=64, PETRI_TRANSITIONS=62} [2025-01-10 06:32:59,174 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 7 predicate places. [2025-01-10 06:32:59,174 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 62 transitions, 174 flow [2025-01-10 06:32:59,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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,174 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:32:59,174 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:32:59,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:32:59,174 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-01-10 06:32:59,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:32:59,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1769158171, now seen corresponding path program 1 times [2025-01-10 06:32:59,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:32:59,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562716755] [2025-01-10 06:32:59,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:32:59,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:32:59,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:32:59,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:32:59,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:32:59,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:32:59,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:32:59,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:32:59,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562716755] [2025-01-10 06:32:59,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562716755] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:32:59,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:32:59,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:32:59,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758024281] [2025-01-10 06:32:59,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:32:59,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:32:59,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:32:59,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:32:59,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:32:59,907 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-01-10 06:32:59,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 62 transitions, 174 flow. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:32:59,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-01-10 06:32:59,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:00,530 INFO L124 PetriNetUnfolderBase]: 1147/2320 cut-off events. [2025-01-10 06:33:00,530 INFO L125 PetriNetUnfolderBase]: For 539/547 co-relation queries the response was YES. [2025-01-10 06:33:00,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4598 conditions, 2320 events. 1147/2320 cut-off events. For 539/547 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 14845 event pairs, 209 based on Foata normal form. 50/2028 useless extension candidates. Maximal degree in co-relation 3108. Up to 1202 conditions per place. [2025-01-10 06:33:00,541 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 108 selfloop transitions, 11 changer transitions 0/140 dead transitions. [2025-01-10 06:33:00,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 140 transitions, 589 flow [2025-01-10 06:33:00,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:33:00,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 06:33:00,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 283 transitions. [2025-01-10 06:33:00,543 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6627634660421545 [2025-01-10 06:33:00,543 INFO L175 Difference]: Start difference. First operand has 64 places, 62 transitions, 174 flow. Second operand 7 states and 283 transitions. [2025-01-10 06:33:00,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 140 transitions, 589 flow [2025-01-10 06:33:00,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 140 transitions, 576 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-01-10 06:33:00,546 INFO L231 Difference]: Finished difference. Result has 70 places, 68 transitions, 230 flow [2025-01-10 06:33:00,546 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=230, PETRI_PLACES=70, PETRI_TRANSITIONS=68} [2025-01-10 06:33:00,547 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 13 predicate places. [2025-01-10 06:33:00,547 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 68 transitions, 230 flow [2025-01-10 06:33:00,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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,547 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:00,547 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:33:00,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:33:00,547 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-01-10 06:33:00,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:00,548 INFO L85 PathProgramCache]: Analyzing trace with hash -2070464555, now seen corresponding path program 1 times [2025-01-10 06:33:00,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:00,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458619101] [2025-01-10 06:33:00,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:00,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:00,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:33:00,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:33:00,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:00,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:00,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:00,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:00,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458619101] [2025-01-10 06:33:00,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458619101] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:00,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:00,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:33:00,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206943131] [2025-01-10 06:33:00,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:00,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:33:00,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:00,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:33:00,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:33:00,736 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 61 [2025-01-10 06:33:00,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 68 transitions, 230 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:33:00,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:00,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 61 [2025-01-10 06:33:00,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:00,982 INFO L124 PetriNetUnfolderBase]: 515/1161 cut-off events. [2025-01-10 06:33:00,982 INFO L125 PetriNetUnfolderBase]: For 370/370 co-relation queries the response was YES. [2025-01-10 06:33:00,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2431 conditions, 1161 events. 515/1161 cut-off events. For 370/370 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 6810 event pairs, 296 based on Foata normal form. 29/1084 useless extension candidates. Maximal degree in co-relation 2349. Up to 510 conditions per place. [2025-01-10 06:33:00,988 INFO L140 encePairwiseOnDemand]: 57/61 looper letters, 42 selfloop transitions, 2 changer transitions 6/73 dead transitions. [2025-01-10 06:33:00,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 73 transitions, 317 flow [2025-01-10 06:33:00,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:33:00,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:33:00,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2025-01-10 06:33:00,990 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6557377049180327 [2025-01-10 06:33:00,990 INFO L175 Difference]: Start difference. First operand has 70 places, 68 transitions, 230 flow. Second operand 3 states and 120 transitions. [2025-01-10 06:33:00,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 73 transitions, 317 flow [2025-01-10 06:33:00,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 73 transitions, 300 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-01-10 06:33:00,993 INFO L231 Difference]: Finished difference. Result has 67 places, 62 transitions, 183 flow [2025-01-10 06:33:00,994 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=183, PETRI_PLACES=67, PETRI_TRANSITIONS=62} [2025-01-10 06:33:00,994 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 10 predicate places. [2025-01-10 06:33:00,994 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 62 transitions, 183 flow [2025-01-10 06:33:00,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:33:00,995 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:00,995 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:33:00,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:33:00,995 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-01-10 06:33:00,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:00,995 INFO L85 PathProgramCache]: Analyzing trace with hash 990674759, now seen corresponding path program 1 times [2025-01-10 06:33:00,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:00,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923773670] [2025-01-10 06:33:00,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:00,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:01,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:33:01,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:33:01,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:01,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:01,138 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,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:01,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923773670] [2025-01-10 06:33:01,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923773670] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:01,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:01,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:33:01,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935061120] [2025-01-10 06:33:01,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:01,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:33:01,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:01,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:33:01,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:33:01,143 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-01-10 06:33:01,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 62 transitions, 183 flow. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:33:01,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:01,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-01-10 06:33:01,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:01,483 INFO L124 PetriNetUnfolderBase]: 440/978 cut-off events. [2025-01-10 06:33:01,483 INFO L125 PetriNetUnfolderBase]: For 136/136 co-relation queries the response was YES. [2025-01-10 06:33:01,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2065 conditions, 978 events. 440/978 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 5180 event pairs, 293 based on Foata normal form. 24/931 useless extension candidates. Maximal degree in co-relation 1867. Up to 591 conditions per place. [2025-01-10 06:33:01,489 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 53 selfloop transitions, 3 changer transitions 0/77 dead transitions. [2025-01-10 06:33:01,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 77 transitions, 325 flow [2025-01-10 06:33:01,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:33:01,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:33:01,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2025-01-10 06:33:01,491 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6188524590163934 [2025-01-10 06:33:01,491 INFO L175 Difference]: Start difference. First operand has 67 places, 62 transitions, 183 flow. Second operand 4 states and 151 transitions. [2025-01-10 06:33:01,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 77 transitions, 325 flow [2025-01-10 06:33:01,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 77 transitions, 319 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-10 06:33:01,494 INFO L231 Difference]: Finished difference. Result has 70 places, 63 transitions, 195 flow [2025-01-10 06:33:01,495 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=195, PETRI_PLACES=70, PETRI_TRANSITIONS=63} [2025-01-10 06:33:01,495 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 13 predicate places. [2025-01-10 06:33:01,495 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 63 transitions, 195 flow [2025-01-10 06:33:01,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:33:01,496 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:01,496 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:33:01,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:33:01,496 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-01-10 06:33:01,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:01,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1821306806, now seen corresponding path program 1 times [2025-01-10 06:33:01,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:01,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690594708] [2025-01-10 06:33:01,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:01,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:01,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 06:33:01,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 06:33:01,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:01,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:02,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:02,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:02,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690594708] [2025-01-10 06:33:02,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690594708] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:33:02,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:33:02,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:33:02,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14351410] [2025-01-10 06:33:02,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:33:02,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:33:02,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:02,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:33:02,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:33:02,392 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 61 [2025-01-10 06:33:02,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 63 transitions, 195 flow. Second operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 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,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:02,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 61 [2025-01-10 06:33:02,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:02,802 INFO L124 PetriNetUnfolderBase]: 398/936 cut-off events. [2025-01-10 06:33:02,803 INFO L125 PetriNetUnfolderBase]: For 201/201 co-relation queries the response was YES. [2025-01-10 06:33:02,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2031 conditions, 936 events. 398/936 cut-off events. For 201/201 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4984 event pairs, 118 based on Foata normal form. 12/895 useless extension candidates. Maximal degree in co-relation 1451. Up to 457 conditions per place. [2025-01-10 06:33:02,807 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 55 selfloop transitions, 5 changer transitions 3/86 dead transitions. [2025-01-10 06:33:02,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 86 transitions, 371 flow [2025-01-10 06:33:02,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:33:02,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:33:02,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 187 transitions. [2025-01-10 06:33:02,809 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6131147540983607 [2025-01-10 06:33:02,809 INFO L175 Difference]: Start difference. First operand has 70 places, 63 transitions, 195 flow. Second operand 5 states and 187 transitions. [2025-01-10 06:33:02,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 86 transitions, 371 flow [2025-01-10 06:33:02,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 86 transitions, 369 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:33:02,811 INFO L231 Difference]: Finished difference. Result has 73 places, 62 transitions, 198 flow [2025-01-10 06:33:02,812 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=198, PETRI_PLACES=73, PETRI_TRANSITIONS=62} [2025-01-10 06:33:02,812 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 16 predicate places. [2025-01-10 06:33:02,812 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 62 transitions, 198 flow [2025-01-10 06:33:02,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 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,812 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:02,813 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:33:02,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:33:02,813 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-01-10 06:33:02,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:02,813 INFO L85 PathProgramCache]: Analyzing trace with hash -621797080, now seen corresponding path program 1 times [2025-01-10 06:33:02,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:02,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690691018] [2025-01-10 06:33:02,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:02,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:02,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:33:02,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:33:02,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:02,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:04,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:04,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:04,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690691018] [2025-01-10 06:33:04,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690691018] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:33:04,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98310619] [2025-01-10 06:33:04,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:04,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:33:04,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:33:04,489 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:33:04,491 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:33:04,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:33:04,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:33:04,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:04,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:04,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 1791 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-10 06:33:04,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:33:04,863 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 19 treesize of output 1 [2025-01-10 06:33:04,913 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 31 treesize of output 15 [2025-01-10 06:33:04,986 INFO L349 Elim1Store]: treesize reduction 48, result has 39.2 percent of original size [2025-01-10 06:33:04,987 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 71 [2025-01-10 06:33:05,002 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:33:05,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 39 [2025-01-10 06:33:05,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:05,039 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:33:05,277 INFO L349 Elim1Store]: treesize reduction 45, result has 53.6 percent of original size [2025-01-10 06:33:05,278 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 3 case distinctions, treesize of input 196 treesize of output 181 [2025-01-10 06:33:05,305 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:33:05,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 142 [2025-01-10 06:33:05,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2025-01-10 06:33:05,422 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:33:05,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 184 treesize of output 180 [2025-01-10 06:33:05,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:05,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98310619] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:33:05,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:33:05,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2025-01-10 06:33:05,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262849859] [2025-01-10 06:33:05,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:33:05,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 06:33:05,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:05,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 06:33:05,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2025-01-10 06:33:05,750 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 61 [2025-01-10 06:33:05,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 62 transitions, 198 flow. Second operand has 19 states, 19 states have (on average 22.210526315789473) internal successors, (422), 19 states have internal predecessors, (422), 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,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:05,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 61 [2025-01-10 06:33:05,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:07,431 INFO L124 PetriNetUnfolderBase]: 769/1658 cut-off events. [2025-01-10 06:33:07,432 INFO L125 PetriNetUnfolderBase]: For 296/296 co-relation queries the response was YES. [2025-01-10 06:33:07,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3625 conditions, 1658 events. 769/1658 cut-off events. For 296/296 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 9254 event pairs, 123 based on Foata normal form. 24/1573 useless extension candidates. Maximal degree in co-relation 2834. Up to 250 conditions per place. [2025-01-10 06:33:07,443 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 128 selfloop transitions, 16 changer transitions 3/165 dead transitions. [2025-01-10 06:33:07,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 165 transitions, 744 flow [2025-01-10 06:33:07,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 06:33:07,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-10 06:33:07,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 427 transitions. [2025-01-10 06:33:07,446 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-01-10 06:33:07,446 INFO L175 Difference]: Start difference. First operand has 73 places, 62 transitions, 198 flow. Second operand 14 states and 427 transitions. [2025-01-10 06:33:07,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 165 transitions, 744 flow [2025-01-10 06:33:07,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 165 transitions, 734 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 06:33:07,450 INFO L231 Difference]: Finished difference. Result has 83 places, 68 transitions, 254 flow [2025-01-10 06:33:07,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=254, PETRI_PLACES=83, PETRI_TRANSITIONS=68} [2025-01-10 06:33:07,451 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 26 predicate places. [2025-01-10 06:33:07,451 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 68 transitions, 254 flow [2025-01-10 06:33:07,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 22.210526315789473) internal successors, (422), 19 states have internal predecessors, (422), 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,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:33:07,451 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:33:07,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 06:33:07,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:33:07,656 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-01-10 06:33:07,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:33:07,657 INFO L85 PathProgramCache]: Analyzing trace with hash -2095838085, now seen corresponding path program 1 times [2025-01-10 06:33:07,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:33:07,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024814793] [2025-01-10 06:33:07,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:07,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:33:07,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 06:33:07,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 06:33:07,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:07,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:08,872 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:08,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:33:08,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024814793] [2025-01-10 06:33:08,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024814793] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:33:08,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638292256] [2025-01-10 06:33:08,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:33:08,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:33:08,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:33:08,876 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:08,878 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:08,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 06:33:09,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 06:33:09,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:33:09,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:33:09,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 1792 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-01-10 06:33:09,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:33:09,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 1 [2025-01-10 06:33:09,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 06:33:09,204 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-10 06:33:09,222 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2025-01-10 06:33:09,223 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:09,276 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-10 06:33:09,277 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 42 [2025-01-10 06:33:09,379 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:33:09,379 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 1 case distinctions, treesize of input 55 treesize of output 27 [2025-01-10 06:33:09,427 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 41 treesize of output 33 [2025-01-10 06:33:09,433 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:33:09,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 23 [2025-01-10 06:33:09,438 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:09,438 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:33:18,336 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:33:18,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638292256] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:33:18,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:33:18,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2025-01-10 06:33:18,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606427868] [2025-01-10 06:33:18,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:33:18,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 06:33:18,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:33:18,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 06:33:18,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=260, Unknown=4, NotChecked=0, Total=342 [2025-01-10 06:33:19,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:33:19,712 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 61 [2025-01-10 06:33:19,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 68 transitions, 254 flow. Second operand has 19 states, 19 states have (on average 21.42105263157895) internal successors, (407), 19 states have internal predecessors, (407), 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,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:33:19,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 61 [2025-01-10 06:33:19,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:33:28,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:33:36,095 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:41,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:33:43,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:33:45,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:33:47,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:33:48,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:33:50,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:33:52,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:33:54,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:33:56,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:33:58,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:33:59,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:34:01,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:34:03,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:34:04,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:34:06,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:34:08,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:34:10,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:34:12,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:34:13,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:34:15,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:34:19,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]