./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_91-arrayloop2_racefree.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/goblint-regression/28-race_reach_91-arrayloop2_racefree.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 ac583c9331a2ad916f4c22969f16915d9226d22c75c23a992e6ef02ec672d4b3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:47:56,977 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:47:57,039 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:47:57,044 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:47:57,045 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:47:57,073 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:47:57,074 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:47:57,074 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:47:57,074 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:47:57,074 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:47:57,074 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:47:57,074 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:47:57,074 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:47:57,075 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:47:57,075 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:47:57,075 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:47:57,075 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:47:57,075 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:47:57,075 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:47:57,075 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:47:57,075 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:47:57,075 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:47:57,075 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:47:57,075 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:47:57,075 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:47:57,075 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:47:57,075 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:47:57,075 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:47:57,075 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:47:57,075 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:47:57,075 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:47:57,075 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:47:57,075 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:47:57,075 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:47:57,076 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:47:57,076 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:47:57,076 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:47:57,076 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:47:57,076 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:47:57,076 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:47:57,076 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:47:57,076 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:47:57,076 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:47:57,076 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:47:57,076 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:47:57,076 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:47:57,076 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:47:57,076 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:47:57,076 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:47:57,076 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:47:57,076 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 -> ac583c9331a2ad916f4c22969f16915d9226d22c75c23a992e6ef02ec672d4b3 [2025-01-10 06:47:57,359 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:47:57,370 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:47:57,371 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:47:57,372 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:47:57,373 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:47:57,374 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_91-arrayloop2_racefree.i [2025-01-10 06:47:58,626 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0b9f45df8/e7ef0d0a28994eda98013f509e017c9e/FLAGb52e41507 [2025-01-10 06:47:58,955 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:47:58,956 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_91-arrayloop2_racefree.i [2025-01-10 06:47:58,972 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0b9f45df8/e7ef0d0a28994eda98013f509e017c9e/FLAGb52e41507 [2025-01-10 06:47:58,988 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0b9f45df8/e7ef0d0a28994eda98013f509e017c9e [2025-01-10 06:47:58,990 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:47:58,994 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:47:58,995 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:47:58,995 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:47:58,999 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:47:59,000 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:47:58" (1/1) ... [2025-01-10 06:47:59,000 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a317b05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:59, skipping insertion in model container [2025-01-10 06:47:59,000 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:47:58" (1/1) ... [2025-01-10 06:47:59,038 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:47:59,391 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-10 06:47:59,392 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-10 06:47:59,392 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-10 06:47:59,392 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-10 06:47:59,409 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:47:59,441 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:47:59,488 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-10 06:47:59,493 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-10 06:47:59,493 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-10 06:47:59,493 WARN L1731 CHandler]: Possible shadowing of function new [2025-01-10 06:47:59,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:47:59,556 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:47:59,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:59 WrapperNode [2025-01-10 06:47:59,558 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:47:59,559 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:47:59,559 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:47:59,559 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:47:59,564 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:47:59" (1/1) ... [2025-01-10 06:47:59,582 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:47:59" (1/1) ... [2025-01-10 06:47:59,610 INFO L138 Inliner]: procedures = 279, calls = 120, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 258 [2025-01-10 06:47:59,612 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:47:59,613 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:47:59,613 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:47:59,613 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:47:59,619 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:59" (1/1) ... [2025-01-10 06:47:59,620 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:59" (1/1) ... [2025-01-10 06:47:59,623 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:59" (1/1) ... [2025-01-10 06:47:59,650 INFO L175 MemorySlicer]: Split 96 memory accesses to 4 slices as follows [2, 5, 2, 87]. 91 percent of accesses are in the largest equivalence class. The 77 initializations are split as follows [2, 5, 0, 70]. The 12 writes are split as follows [0, 0, 1, 11]. [2025-01-10 06:47:59,652 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:59" (1/1) ... [2025-01-10 06:47:59,652 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:59" (1/1) ... [2025-01-10 06:47:59,665 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:59" (1/1) ... [2025-01-10 06:47:59,671 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:59" (1/1) ... [2025-01-10 06:47:59,673 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:59" (1/1) ... [2025-01-10 06:47:59,678 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:59" (1/1) ... [2025-01-10 06:47:59,679 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:59" (1/1) ... [2025-01-10 06:47:59,683 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:47:59,684 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:47:59,684 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:47:59,684 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:47:59,686 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:59" (1/1) ... [2025-01-10 06:47:59,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:47:59,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:47:59,714 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:47:59,716 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:47:59,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 06:47:59,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 06:47:59,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 06:47:59,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-10 06:47:59,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-10 06:47:59,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 06:47:59,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-10 06:47:59,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-10 06:47:59,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-10 06:47:59,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-01-10 06:47:59,733 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 06:47:59,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:47:59,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:47:59,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 06:47:59,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 06:47:59,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:47:59,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:47:59,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 06:47:59,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 06:47:59,734 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 06:47:59,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 06:47:59,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:47:59,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 06:47:59,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 06:47:59,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-10 06:47:59,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-10 06:47:59,735 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-10 06:47:59,735 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-10 06:47:59,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:47:59,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:47:59,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 06:47:59,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 06:47:59,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:47:59,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:47:59,736 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:47:59,887 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:47:59,888 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:48:00,218 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:48:00,219 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:48:00,615 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:48:00,615 INFO L312 CfgBuilder]: Removed 5 assume(true) statements. [2025-01-10 06:48:00,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:48:00 BoogieIcfgContainer [2025-01-10 06:48:00,615 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:48:00,617 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:48:00,617 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:48:00,621 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:48:00,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:47:58" (1/3) ... [2025-01-10 06:48:00,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@577412b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:48:00, skipping insertion in model container [2025-01-10 06:48:00,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:59" (2/3) ... [2025-01-10 06:48:00,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@577412b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:48:00, skipping insertion in model container [2025-01-10 06:48:00,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:48:00" (3/3) ... [2025-01-10 06:48:00,624 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_91-arrayloop2_racefree.i [2025-01-10 06:48:00,636 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:48:00,639 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_91-arrayloop2_racefree.i that has 2 procedures, 71 locations, 1 initial locations, 11 loop locations, and 16 error locations. [2025-01-10 06:48:00,639 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:48:00,695 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-10 06:48:00,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 87 transitions, 181 flow [2025-01-10 06:48:00,765 INFO L124 PetriNetUnfolderBase]: 16/91 cut-off events. [2025-01-10 06:48:00,768 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 06:48:00,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 91 events. 16/91 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 260 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 62. Up to 4 conditions per place. [2025-01-10 06:48:00,772 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 87 transitions, 181 flow [2025-01-10 06:48:00,775 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 86 transitions, 179 flow [2025-01-10 06:48:00,784 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:48:00,793 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;@75f61d2d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:48:00,793 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-01-10 06:48:00,799 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:48:00,799 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-01-10 06:48:00,799 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:48:00,799 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:48:00,800 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 06:48:00,800 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-01-10 06:48:00,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:48:00,804 INFO L85 PathProgramCache]: Analyzing trace with hash 21389087, now seen corresponding path program 1 times [2025-01-10 06:48:00,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:48:00,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745925168] [2025-01-10 06:48:00,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:48:00,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:48:00,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:48:00,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:48:00,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:48:00,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 06:48:00,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [68008922] [2025-01-10 06:48:00,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:48:00,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:48:00,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:48:00,932 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:48:00,934 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:48:01,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:48:01,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:48:01,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:48:01,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:48:01,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:48:01,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:48:01,066 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:48:01,067 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:48:01,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:48:01,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745925168] [2025-01-10 06:48:01,067 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 06:48:01,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68008922] [2025-01-10 06:48:01,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68008922] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:48:01,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:48:01,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:48:01,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532791634] [2025-01-10 06:48:01,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:48:01,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:48:01,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:48:01,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:48:01,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:48:01,110 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 87 [2025-01-10 06:48:01,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 86 transitions, 179 flow. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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:48:01,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:48:01,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 87 [2025-01-10 06:48:01,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:48:01,367 INFO L124 PetriNetUnfolderBase]: 121/408 cut-off events. [2025-01-10 06:48:01,368 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 06:48:01,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 671 conditions, 408 events. 121/408 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1874 event pairs, 100 based on Foata normal form. 37/362 useless extension candidates. Maximal degree in co-relation 604. Up to 253 conditions per place. [2025-01-10 06:48:01,374 INFO L140 encePairwiseOnDemand]: 72/87 looper letters, 41 selfloop transitions, 2 changer transitions 0/81 dead transitions. [2025-01-10 06:48:01,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 81 transitions, 255 flow [2025-01-10 06:48:01,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:48:01,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:48:01,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 170 transitions. [2025-01-10 06:48:01,386 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6513409961685823 [2025-01-10 06:48:01,388 INFO L175 Difference]: Start difference. First operand has 74 places, 86 transitions, 179 flow. Second operand 3 states and 170 transitions. [2025-01-10 06:48:01,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 81 transitions, 255 flow [2025-01-10 06:48:01,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 81 transitions, 255 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:48:01,394 INFO L231 Difference]: Finished difference. Result has 77 places, 77 transitions, 175 flow [2025-01-10 06:48:01,395 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=175, PETRI_PLACES=77, PETRI_TRANSITIONS=77} [2025-01-10 06:48:01,397 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 3 predicate places. [2025-01-10 06:48:01,397 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 77 transitions, 175 flow [2025-01-10 06:48:01,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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:48:01,398 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:48:01,398 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 06:48:01,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 06:48:01,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-10 06:48:01,599 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-01-10 06:48:01,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:48:01,600 INFO L85 PathProgramCache]: Analyzing trace with hash 21389102, now seen corresponding path program 1 times [2025-01-10 06:48:01,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:48:01,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284467380] [2025-01-10 06:48:01,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:48:01,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:48:01,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:48:01,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:48:01,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:48:01,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:48:01,770 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:48:01,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:48:01,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284467380] [2025-01-10 06:48:01,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284467380] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:48:01,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:48:01,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:48:01,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166592981] [2025-01-10 06:48:01,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:48:01,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:48:01,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:48:01,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:48:01,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:48:01,781 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 87 [2025-01-10 06:48:01,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 77 transitions, 175 flow. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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:48:01,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:48:01,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 87 [2025-01-10 06:48:01,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:48:01,961 INFO L124 PetriNetUnfolderBase]: 121/422 cut-off events. [2025-01-10 06:48:01,961 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-10 06:48:01,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 698 conditions, 422 events. 121/422 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1941 event pairs, 100 based on Foata normal form. 4/343 useless extension candidates. Maximal degree in co-relation 661. Up to 258 conditions per place. [2025-01-10 06:48:01,964 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 39 selfloop transitions, 2 changer transitions 0/79 dead transitions. [2025-01-10 06:48:01,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 79 transitions, 261 flow [2025-01-10 06:48:01,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:48:01,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:48:01,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 157 transitions. [2025-01-10 06:48:01,965 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6015325670498084 [2025-01-10 06:48:01,965 INFO L175 Difference]: Start difference. First operand has 77 places, 77 transitions, 175 flow. Second operand 3 states and 157 transitions. [2025-01-10 06:48:01,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 79 transitions, 261 flow [2025-01-10 06:48:01,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 79 transitions, 259 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:48:01,970 INFO L231 Difference]: Finished difference. Result has 79 places, 78 transitions, 189 flow [2025-01-10 06:48:01,970 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=189, PETRI_PLACES=79, PETRI_TRANSITIONS=78} [2025-01-10 06:48:01,971 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 5 predicate places. [2025-01-10 06:48:01,971 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 78 transitions, 189 flow [2025-01-10 06:48:01,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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:48:01,971 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:48:01,971 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 06:48:01,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:48:01,972 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-01-10 06:48:01,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:48:01,972 INFO L85 PathProgramCache]: Analyzing trace with hash -919900384, now seen corresponding path program 1 times [2025-01-10 06:48:01,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:48:01,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359382542] [2025-01-10 06:48:01,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:48:01,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:48:02,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:48:02,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:48:02,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:48:02,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:48:02,163 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:48:02,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:48:02,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359382542] [2025-01-10 06:48:02,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359382542] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:48:02,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:48:02,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:48:02,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703832884] [2025-01-10 06:48:02,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:48:02,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:48:02,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:48:02,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:48:02,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:48:02,177 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 87 [2025-01-10 06:48:02,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 78 transitions, 189 flow. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:48:02,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:48:02,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 87 [2025-01-10 06:48:02,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:48:02,489 INFO L124 PetriNetUnfolderBase]: 121/418 cut-off events. [2025-01-10 06:48:02,489 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-01-10 06:48:02,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 710 conditions, 418 events. 121/418 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1931 event pairs, 100 based on Foata normal form. 4/343 useless extension candidates. Maximal degree in co-relation 648. Up to 262 conditions per place. [2025-01-10 06:48:02,492 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 40 selfloop transitions, 3 changer transitions 0/79 dead transitions. [2025-01-10 06:48:02,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 79 transitions, 277 flow [2025-01-10 06:48:02,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:48:02,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:48:02,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 188 transitions. [2025-01-10 06:48:02,494 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5402298850574713 [2025-01-10 06:48:02,494 INFO L175 Difference]: Start difference. First operand has 79 places, 78 transitions, 189 flow. Second operand 4 states and 188 transitions. [2025-01-10 06:48:02,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 79 transitions, 277 flow [2025-01-10 06:48:02,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 79 transitions, 275 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:48:02,496 INFO L231 Difference]: Finished difference. Result has 83 places, 79 transitions, 205 flow [2025-01-10 06:48:02,496 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=205, PETRI_PLACES=83, PETRI_TRANSITIONS=79} [2025-01-10 06:48:02,497 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 9 predicate places. [2025-01-10 06:48:02,497 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 79 transitions, 205 flow [2025-01-10 06:48:02,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:48:02,497 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:48:02,497 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:48:02,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:48:02,497 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-01-10 06:48:02,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:48:02,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1434658467, now seen corresponding path program 1 times [2025-01-10 06:48:02,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:48:02,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619830273] [2025-01-10 06:48:02,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:48:02,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:48:02,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:48:02,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:48:02,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:48:02,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:48:02,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:48:02,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:48:02,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619830273] [2025-01-10 06:48:02,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619830273] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:48:02,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:48:02,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:48:02,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617453548] [2025-01-10 06:48:02,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:48:02,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:48:02,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:48:02,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:48:02,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:48:02,661 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 87 [2025-01-10 06:48:02,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 79 transitions, 205 flow. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 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:48:02,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:48:02,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 87 [2025-01-10 06:48:02,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:48:02,883 INFO L124 PetriNetUnfolderBase]: 121/416 cut-off events. [2025-01-10 06:48:02,883 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-01-10 06:48:02,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 722 conditions, 416 events. 121/416 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1919 event pairs, 100 based on Foata normal form. 2/341 useless extension candidates. Maximal degree in co-relation 649. Up to 257 conditions per place. [2025-01-10 06:48:02,888 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 46 selfloop transitions, 3 changer transitions 0/85 dead transitions. [2025-01-10 06:48:02,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 85 transitions, 335 flow [2025-01-10 06:48:02,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:48:02,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:48:02,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 191 transitions. [2025-01-10 06:48:02,891 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5488505747126436 [2025-01-10 06:48:02,891 INFO L175 Difference]: Start difference. First operand has 83 places, 79 transitions, 205 flow. Second operand 4 states and 191 transitions. [2025-01-10 06:48:02,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 85 transitions, 335 flow [2025-01-10 06:48:02,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 85 transitions, 327 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:48:02,895 INFO L231 Difference]: Finished difference. Result has 86 places, 80 transitions, 221 flow [2025-01-10 06:48:02,896 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=221, PETRI_PLACES=86, PETRI_TRANSITIONS=80} [2025-01-10 06:48:02,898 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 12 predicate places. [2025-01-10 06:48:02,898 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 80 transitions, 221 flow [2025-01-10 06:48:02,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 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:48:02,898 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:48:02,898 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 06:48:02,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:48:02,898 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-01-10 06:48:02,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:48:02,899 INFO L85 PathProgramCache]: Analyzing trace with hash 22293845, now seen corresponding path program 1 times [2025-01-10 06:48:02,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:48:02,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399381083] [2025-01-10 06:48:02,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:48:02,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:48:02,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:48:02,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:48:02,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:48:02,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:48:03,148 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:48:03,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:48:03,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399381083] [2025-01-10 06:48:03,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399381083] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:48:03,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129817324] [2025-01-10 06:48:03,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:48:03,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:48:03,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:48:03,155 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:48:03,156 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:48:03,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:48:03,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:48:03,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:48:03,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:48:03,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:48:03,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:48:03,379 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:48:03,379 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:48:03,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129817324] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:48:03,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:48:03,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-10 06:48:03,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227752675] [2025-01-10 06:48:03,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:48:03,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:48:03,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:48:03,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:48:03,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:48:03,407 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 87 [2025-01-10 06:48:03,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 80 transitions, 221 flow. Second operand has 6 states, 6 states have (on average 37.0) internal successors, (222), 6 states have internal predecessors, (222), 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:48:03,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:48:03,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 87 [2025-01-10 06:48:03,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:48:03,753 INFO L124 PetriNetUnfolderBase]: 121/414 cut-off events. [2025-01-10 06:48:03,753 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-01-10 06:48:03,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 724 conditions, 414 events. 121/414 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1903 event pairs, 100 based on Foata normal form. 2/339 useless extension candidates. Maximal degree in co-relation 673. Up to 250 conditions per place. [2025-01-10 06:48:03,755 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 36 selfloop transitions, 7 changer transitions 0/79 dead transitions. [2025-01-10 06:48:03,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 79 transitions, 303 flow [2025-01-10 06:48:03,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:48:03,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:48:03,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 258 transitions. [2025-01-10 06:48:03,758 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4942528735632184 [2025-01-10 06:48:03,758 INFO L175 Difference]: Start difference. First operand has 86 places, 80 transitions, 221 flow. Second operand 6 states and 258 transitions. [2025-01-10 06:48:03,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 79 transitions, 303 flow [2025-01-10 06:48:03,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 79 transitions, 299 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:48:03,759 INFO L231 Difference]: Finished difference. Result has 88 places, 79 transitions, 227 flow [2025-01-10 06:48:03,760 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=227, PETRI_PLACES=88, PETRI_TRANSITIONS=79} [2025-01-10 06:48:03,760 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 14 predicate places. [2025-01-10 06:48:03,760 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 79 transitions, 227 flow [2025-01-10 06:48:03,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.0) internal successors, (222), 6 states have internal predecessors, (222), 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:48:03,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:48:03,761 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1] [2025-01-10 06:48:03,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 06:48:03,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:48:03,962 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-01-10 06:48:03,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:48:03,962 INFO L85 PathProgramCache]: Analyzing trace with hash 691109881, now seen corresponding path program 1 times [2025-01-10 06:48:03,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:48:03,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416411158] [2025-01-10 06:48:03,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:48:03,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:48:03,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:48:03,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:48:03,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:48:03,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:48:04,051 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:48:04,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:48:04,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416411158] [2025-01-10 06:48:04,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416411158] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:48:04,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:48:04,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:48:04,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286375026] [2025-01-10 06:48:04,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:48:04,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:48:04,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:48:04,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:48:04,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:48:04,064 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 87 [2025-01-10 06:48:04,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 79 transitions, 227 flow. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 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:48:04,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:48:04,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 87 [2025-01-10 06:48:04,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:48:04,205 INFO L124 PetriNetUnfolderBase]: 121/412 cut-off events. [2025-01-10 06:48:04,205 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-01-10 06:48:04,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 730 conditions, 412 events. 121/412 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1893 event pairs, 100 based on Foata normal form. 2/337 useless extension candidates. Maximal degree in co-relation 672. Up to 254 conditions per place. [2025-01-10 06:48:04,208 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 36 selfloop transitions, 6 changer transitions 0/79 dead transitions. [2025-01-10 06:48:04,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 79 transitions, 309 flow [2025-01-10 06:48:04,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:48:04,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:48:04,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2025-01-10 06:48:04,210 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5373563218390804 [2025-01-10 06:48:04,210 INFO L175 Difference]: Start difference. First operand has 88 places, 79 transitions, 227 flow. Second operand 4 states and 187 transitions. [2025-01-10 06:48:04,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 79 transitions, 309 flow [2025-01-10 06:48:04,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 79 transitions, 294 flow, removed 2 selfloop flow, removed 5 redundant places. [2025-01-10 06:48:04,214 INFO L231 Difference]: Finished difference. Result has 86 places, 79 transitions, 228 flow [2025-01-10 06:48:04,215 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=228, PETRI_PLACES=86, PETRI_TRANSITIONS=79} [2025-01-10 06:48:04,215 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 12 predicate places. [2025-01-10 06:48:04,218 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 79 transitions, 228 flow [2025-01-10 06:48:04,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 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:48:04,218 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:48:04,218 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:48:04,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:48:04,219 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-01-10 06:48:04,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:48:04,219 INFO L85 PathProgramCache]: Analyzing trace with hash -2036766691, now seen corresponding path program 1 times [2025-01-10 06:48:04,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:48:04,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771161174] [2025-01-10 06:48:04,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:48:04,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:48:04,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 06:48:04,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 06:48:04,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:48:04,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:48:04,321 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:48:04,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:48:04,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771161174] [2025-01-10 06:48:04,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771161174] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:48:04,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345466381] [2025-01-10 06:48:04,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:48:04,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:48:04,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:48:04,323 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:48:04,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 06:48:04,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 06:48:04,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 06:48:04,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:48:04,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:48:04,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:48:04,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:48:04,506 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:48:04,506 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:48:04,533 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:48:04,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345466381] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:48:04,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:48:04,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-10 06:48:04,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63097738] [2025-01-10 06:48:04,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:48:04,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:48:04,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:48:04,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:48:04,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:48:04,557 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 87 [2025-01-10 06:48:04,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 79 transitions, 228 flow. Second operand has 10 states, 10 states have (on average 36.9) internal successors, (369), 10 states have internal predecessors, (369), 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:48:04,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:48:04,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 87 [2025-01-10 06:48:04,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:48:04,959 INFO L124 PetriNetUnfolderBase]: 121/426 cut-off events. [2025-01-10 06:48:04,959 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2025-01-10 06:48:04,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 778 conditions, 426 events. 121/426 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1973 event pairs, 100 based on Foata normal form. 4/353 useless extension candidates. Maximal degree in co-relation 702. Up to 252 conditions per place. [2025-01-10 06:48:04,961 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 43 selfloop transitions, 7 changer transitions 0/85 dead transitions. [2025-01-10 06:48:04,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 85 transitions, 363 flow [2025-01-10 06:48:04,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:48:04,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 06:48:04,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 295 transitions. [2025-01-10 06:48:04,963 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48440065681444994 [2025-01-10 06:48:04,963 INFO L175 Difference]: Start difference. First operand has 86 places, 79 transitions, 228 flow. Second operand 7 states and 295 transitions. [2025-01-10 06:48:04,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 85 transitions, 363 flow [2025-01-10 06:48:04,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 85 transitions, 350 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:48:04,965 INFO L231 Difference]: Finished difference. Result has 93 places, 82 transitions, 268 flow [2025-01-10 06:48:04,966 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=268, PETRI_PLACES=93, PETRI_TRANSITIONS=82} [2025-01-10 06:48:04,966 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 19 predicate places. [2025-01-10 06:48:04,966 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 82 transitions, 268 flow [2025-01-10 06:48:04,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 36.9) internal successors, (369), 10 states have internal predecessors, (369), 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:48:04,967 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:48:04,967 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:48:04,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 06:48:05,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:48:05,168 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-01-10 06:48:05,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:48:05,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1443631869, now seen corresponding path program 2 times [2025-01-10 06:48:05,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:48:05,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304942427] [2025-01-10 06:48:05,169 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:48:05,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:48:05,223 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-01-10 06:48:05,226 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 25 statements. [2025-01-10 06:48:05,226 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:48:05,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:48:05,259 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-10 06:48:05,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:48:05,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304942427] [2025-01-10 06:48:05,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304942427] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:48:05,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:48:05,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:48:05,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545200028] [2025-01-10 06:48:05,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:48:05,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:48:05,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:48:05,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:48:05,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:48:05,267 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 87 [2025-01-10 06:48:05,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 82 transitions, 268 flow. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 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:48:05,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:48:05,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 87 [2025-01-10 06:48:05,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:48:05,513 INFO L124 PetriNetUnfolderBase]: 139/400 cut-off events. [2025-01-10 06:48:05,513 INFO L125 PetriNetUnfolderBase]: For 100/100 co-relation queries the response was YES. [2025-01-10 06:48:05,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 801 conditions, 400 events. 139/400 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1848 event pairs, 0 based on Foata normal form. 21/361 useless extension candidates. Maximal degree in co-relation 717. Up to 236 conditions per place. [2025-01-10 06:48:05,515 INFO L140 encePairwiseOnDemand]: 81/87 looper letters, 85 selfloop transitions, 3 changer transitions 0/125 dead transitions. [2025-01-10 06:48:05,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 125 transitions, 530 flow [2025-01-10 06:48:05,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:48:05,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:48:05,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 233 transitions. [2025-01-10 06:48:05,516 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6695402298850575 [2025-01-10 06:48:05,517 INFO L175 Difference]: Start difference. First operand has 93 places, 82 transitions, 268 flow. Second operand 4 states and 233 transitions. [2025-01-10 06:48:05,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 125 transitions, 530 flow [2025-01-10 06:48:05,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 125 transitions, 526 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:48:05,522 INFO L231 Difference]: Finished difference. Result has 93 places, 80 transitions, 270 flow [2025-01-10 06:48:05,522 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=270, PETRI_PLACES=93, PETRI_TRANSITIONS=80} [2025-01-10 06:48:05,523 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 19 predicate places. [2025-01-10 06:48:05,523 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 80 transitions, 270 flow [2025-01-10 06:48:05,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 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:48:05,523 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:48:05,523 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1] [2025-01-10 06:48:05,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:48:05,524 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-01-10 06:48:05,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:48:05,524 INFO L85 PathProgramCache]: Analyzing trace with hash 689660782, now seen corresponding path program 1 times [2025-01-10 06:48:05,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:48:05,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782791150] [2025-01-10 06:48:05,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:48:05,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:48:05,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 06:48:05,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 06:48:05,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:48:05,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:48:05,791 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:48:05,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:48:05,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782791150] [2025-01-10 06:48:05,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782791150] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:48:05,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037064557] [2025-01-10 06:48:05,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:48:05,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:48:05,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:48:05,793 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:48:05,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 06:48:05,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 06:48:06,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 06:48:06,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:48:06,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:48:06,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 06:48:06,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:48:06,074 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:48:06,074 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:48:06,151 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:48:06,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037064557] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:48:06,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:48:06,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-01-10 06:48:06,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866511874] [2025-01-10 06:48:06,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:48:06,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 06:48:06,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:48:06,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 06:48:06,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-01-10 06:48:06,193 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 87 [2025-01-10 06:48:06,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 80 transitions, 270 flow. Second operand has 18 states, 18 states have (on average 36.833333333333336) internal successors, (663), 18 states have internal predecessors, (663), 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:48:06,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:48:06,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 87 [2025-01-10 06:48:06,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:48:07,087 INFO L124 PetriNetUnfolderBase]: 121/460 cut-off events. [2025-01-10 06:48:07,087 INFO L125 PetriNetUnfolderBase]: For 290/290 co-relation queries the response was YES. [2025-01-10 06:48:07,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 993 conditions, 460 events. 121/460 cut-off events. For 290/290 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2036 event pairs, 100 based on Foata normal form. 8/415 useless extension candidates. Maximal degree in co-relation 837. Up to 249 conditions per place. [2025-01-10 06:48:07,090 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 55 selfloop transitions, 15 changer transitions 0/103 dead transitions. [2025-01-10 06:48:07,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 103 transitions, 572 flow [2025-01-10 06:48:07,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 06:48:07,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-10 06:48:07,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 597 transitions. [2025-01-10 06:48:07,095 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4574712643678161 [2025-01-10 06:48:07,095 INFO L175 Difference]: Start difference. First operand has 93 places, 80 transitions, 270 flow. Second operand 15 states and 597 transitions. [2025-01-10 06:48:07,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 103 transitions, 572 flow [2025-01-10 06:48:07,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 103 transitions, 566 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:48:07,099 INFO L231 Difference]: Finished difference. Result has 109 places, 89 transitions, 398 flow [2025-01-10 06:48:07,099 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=398, PETRI_PLACES=109, PETRI_TRANSITIONS=89} [2025-01-10 06:48:07,100 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 35 predicate places. [2025-01-10 06:48:07,100 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 89 transitions, 398 flow [2025-01-10 06:48:07,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 36.833333333333336) internal successors, (663), 18 states have internal predecessors, (663), 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:48:07,100 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:48:07,100 INFO L206 CegarLoopForPetriNet]: trace histogram [9, 8, 8, 8, 8, 2, 1, 1, 1, 1, 1] [2025-01-10 06:48:07,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 06:48:07,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-01-10 06:48:07,302 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-01-10 06:48:07,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:48:07,302 INFO L85 PathProgramCache]: Analyzing trace with hash -412582482, now seen corresponding path program 2 times [2025-01-10 06:48:07,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:48:07,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020741142] [2025-01-10 06:48:07,302 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:48:07,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:48:07,373 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-01-10 06:48:07,403 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 06:48:07,403 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:48:07,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:48:07,923 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 52 proven. 112 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:48:07,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:48:07,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020741142] [2025-01-10 06:48:07,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020741142] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:48:07,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898944468] [2025-01-10 06:48:07,924 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:48:07,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:48:07,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:48:07,926 INFO L229 MonitoredProcess]: Starting monitored process 6 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:48:07,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 06:48:08,110 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-01-10 06:48:08,218 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 06:48:08,218 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:48:08,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:48:08,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 1032 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 06:48:08,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:48:08,295 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 52 proven. 112 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:48:08,296 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:48:08,503 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 52 proven. 112 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:48:08,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898944468] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:48:08,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:48:08,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2025-01-10 06:48:08,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295454158] [2025-01-10 06:48:08,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:48:08,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-01-10 06:48:08,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:48:08,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-01-10 06:48:08,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2025-01-10 06:48:08,608 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 87 [2025-01-10 06:48:08,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 89 transitions, 398 flow. Second operand has 34 states, 34 states have (on average 36.6764705882353) internal successors, (1247), 34 states have internal predecessors, (1247), 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:48:08,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:48:08,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 87 [2025-01-10 06:48:08,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:48:10,084 INFO L124 PetriNetUnfolderBase]: 121/558 cut-off events. [2025-01-10 06:48:10,085 INFO L125 PetriNetUnfolderBase]: For 1185/1185 co-relation queries the response was YES. [2025-01-10 06:48:10,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1452 conditions, 558 events. 121/558 cut-off events. For 1185/1185 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2087 event pairs, 100 based on Foata normal form. 16/519 useless extension candidates. Maximal degree in co-relation 1086. Up to 249 conditions per place. [2025-01-10 06:48:10,087 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 79 selfloop transitions, 31 changer transitions 0/143 dead transitions. [2025-01-10 06:48:10,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 143 transitions, 1082 flow [2025-01-10 06:48:10,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-01-10 06:48:10,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-01-10 06:48:10,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1201 transitions. [2025-01-10 06:48:10,091 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4453096032628847 [2025-01-10 06:48:10,091 INFO L175 Difference]: Start difference. First operand has 109 places, 89 transitions, 398 flow. Second operand 31 states and 1201 transitions. [2025-01-10 06:48:10,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 143 transitions, 1082 flow [2025-01-10 06:48:10,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 143 transitions, 1048 flow, removed 13 selfloop flow, removed 4 redundant places. [2025-01-10 06:48:10,096 INFO L231 Difference]: Finished difference. Result has 144 places, 106 transitions, 670 flow [2025-01-10 06:48:10,096 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=670, PETRI_PLACES=144, PETRI_TRANSITIONS=106} [2025-01-10 06:48:10,096 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 70 predicate places. [2025-01-10 06:48:10,097 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 106 transitions, 670 flow [2025-01-10 06:48:10,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 36.6764705882353) internal successors, (1247), 34 states have internal predecessors, (1247), 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:48:10,097 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:48:10,097 INFO L206 CegarLoopForPetriNet]: trace histogram [17, 16, 16, 16, 16, 2, 1, 1, 1, 1, 1] [2025-01-10 06:48:10,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 06:48:10,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-10 06:48:10,298 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-01-10 06:48:10,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:48:10,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1175966254, now seen corresponding path program 3 times [2025-01-10 06:48:10,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:48:10,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299827262] [2025-01-10 06:48:10,299 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:48:10,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:48:10,421 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 88 statements into 17 equivalence classes. [2025-01-10 06:48:16,088 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) and asserted 88 of 88 statements. [2025-01-10 06:48:16,088 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2025-01-10 06:48:16,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:48:17,851 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 108 proven. 540 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:48:17,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:48:17,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299827262] [2025-01-10 06:48:17,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299827262] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:48:17,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357925858] [2025-01-10 06:48:17,852 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:48:17,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:48:17,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:48:17,853 INFO L229 MonitoredProcess]: Starting monitored process 7 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:48:17,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 06:48:18,140 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 88 statements into 17 equivalence classes. [2025-01-10 06:48:18,186 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 13 of 88 statements. [2025-01-10 06:48:18,187 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 06:48:18,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:48:18,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 06:48:18,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:48:18,332 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2025-01-10 06:48:18,333 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:48:18,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357925858] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:48:18,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:48:18,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [34] total 40 [2025-01-10 06:48:18,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864421877] [2025-01-10 06:48:18,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:48:18,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:48:18,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:48:18,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:48:18,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=1327, Unknown=0, NotChecked=0, Total=1640 [2025-01-10 06:48:18,367 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 87 [2025-01-10 06:48:18,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 106 transitions, 670 flow. Second operand has 8 states, 8 states have (on average 35.25) internal successors, (282), 8 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:48:18,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:48:18,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 87 [2025-01-10 06:48:18,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:48:18,930 INFO L124 PetriNetUnfolderBase]: 121/543 cut-off events. [2025-01-10 06:48:18,931 INFO L125 PetriNetUnfolderBase]: For 1393/1393 co-relation queries the response was YES. [2025-01-10 06:48:18,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1454 conditions, 543 events. 121/543 cut-off events. For 1393/1393 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2003 event pairs, 100 based on Foata normal form. 15/503 useless extension candidates. Maximal degree in co-relation 1055. Up to 242 conditions per place. [2025-01-10 06:48:18,933 INFO L140 encePairwiseOnDemand]: 78/87 looper letters, 62 selfloop transitions, 37 changer transitions 0/135 dead transitions. [2025-01-10 06:48:18,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 135 transitions, 1237 flow [2025-01-10 06:48:18,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:48:18,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:48:18,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 387 transitions. [2025-01-10 06:48:18,935 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44482758620689655 [2025-01-10 06:48:18,936 INFO L175 Difference]: Start difference. First operand has 144 places, 106 transitions, 670 flow. Second operand 10 states and 387 transitions. [2025-01-10 06:48:18,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 135 transitions, 1237 flow [2025-01-10 06:48:18,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 135 transitions, 1185 flow, removed 2 selfloop flow, removed 12 redundant places. [2025-01-10 06:48:18,944 INFO L231 Difference]: Finished difference. Result has 144 places, 135 transitions, 1189 flow [2025-01-10 06:48:18,944 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=634, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1189, PETRI_PLACES=144, PETRI_TRANSITIONS=135} [2025-01-10 06:48:18,945 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 70 predicate places. [2025-01-10 06:48:18,945 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 135 transitions, 1189 flow [2025-01-10 06:48:18,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 35.25) internal successors, (282), 8 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:48:18,945 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:48:18,945 INFO L206 CegarLoopForPetriNet]: trace histogram [15, 15, 15, 15, 15, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:48:18,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 06:48:19,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-10 06:48:19,146 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-01-10 06:48:19,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:48:19,147 INFO L85 PathProgramCache]: Analyzing trace with hash -2078518167, now seen corresponding path program 1 times [2025-01-10 06:48:19,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:48:19,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015305419] [2025-01-10 06:48:19,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:48:19,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:48:19,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-10 06:48:19,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-10 06:48:19,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:48:19,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:48:19,500 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2025-01-10 06:48:19,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:48:19,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015305419] [2025-01-10 06:48:19,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015305419] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:48:19,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704093658] [2025-01-10 06:48:19,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:48:19,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:48:19,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:48:19,502 INFO L229 MonitoredProcess]: Starting monitored process 8 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:48:19,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 06:48:19,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-10 06:48:20,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-10 06:48:20,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:48:20,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:48:20,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 1716 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-10 06:48:20,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:48:20,429 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 1 proven. 540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:48:20,429 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:48:21,104 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 1 proven. 540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:48:21,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704093658] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:48:21,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:48:21,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 33, 33] total 64 [2025-01-10 06:48:21,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951260048] [2025-01-10 06:48:21,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:48:21,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2025-01-10 06:48:21,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:48:21,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2025-01-10 06:48:21,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=967, Invalid=3065, Unknown=0, NotChecked=0, Total=4032 [2025-01-10 06:48:21,285 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 87 [2025-01-10 06:48:21,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 135 transitions, 1189 flow. Second operand has 64 states, 64 states have (on average 34.640625) internal successors, (2217), 64 states have internal predecessors, (2217), 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:48:21,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:48:21,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 87 [2025-01-10 06:48:21,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:48:26,959 INFO L124 PetriNetUnfolderBase]: 137/893 cut-off events. [2025-01-10 06:48:26,959 INFO L125 PetriNetUnfolderBase]: For 9744/9744 co-relation queries the response was YES. [2025-01-10 06:48:26,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3499 conditions, 893 events. 137/893 cut-off events. For 9744/9744 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2056 event pairs, 100 based on Foata normal form. 46/884 useless extension candidates. Maximal degree in co-relation 2838. Up to 247 conditions per place. [2025-01-10 06:48:26,963 INFO L140 encePairwiseOnDemand]: 78/87 looper letters, 157 selfloop transitions, 216 changer transitions 0/404 dead transitions. [2025-01-10 06:48:26,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 404 transitions, 5495 flow [2025-01-10 06:48:26,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2025-01-10 06:48:26,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2025-01-10 06:48:26,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 6425 transitions. [2025-01-10 06:48:26,974 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4057723885310092 [2025-01-10 06:48:26,974 INFO L175 Difference]: Start difference. First operand has 144 places, 135 transitions, 1189 flow. Second operand 182 states and 6425 transitions. [2025-01-10 06:48:26,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 404 transitions, 5495 flow [2025-01-10 06:48:26,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 404 transitions, 5477 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-01-10 06:48:26,995 INFO L231 Difference]: Finished difference. Result has 368 places, 289 transitions, 4049 flow [2025-01-10 06:48:26,995 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=1175, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=182, PETRI_FLOW=4049, PETRI_PLACES=368, PETRI_TRANSITIONS=289} [2025-01-10 06:48:26,996 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 294 predicate places. [2025-01-10 06:48:26,996 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 289 transitions, 4049 flow [2025-01-10 06:48:26,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 34.640625) internal successors, (2217), 64 states have internal predecessors, (2217), 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:48:26,997 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:48:26,997 INFO L206 CegarLoopForPetriNet]: trace histogram [32, 32, 31, 31, 31, 2, 1, 1, 1, 1, 1] [2025-01-10 06:48:27,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-10 06:48:27,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:48:27,197 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-01-10 06:48:27,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:48:27,198 INFO L85 PathProgramCache]: Analyzing trace with hash -255391236, now seen corresponding path program 1 times [2025-01-10 06:48:27,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:48:27,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955808074] [2025-01-10 06:48:27,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:48:27,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:48:27,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-10 06:49:18,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-10 06:49:18,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:49:18,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 06:49:18,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [457377042] [2025-01-10 06:49:18,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:49:18,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:49:18,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:49:18,160 INFO L229 MonitoredProcess]: Starting monitored process 9 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:49:18,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 06:49:18,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-10 06:49:21,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-10 06:49:21,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:49:21,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:49:21,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 3172 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:49:21,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:49:21,920 INFO L134 CoverageAnalysis]: Checked inductivity of 2451 backedges. 245 proven. 0 refuted. 0 times theorem prover too weak. 2206 trivial. 0 not checked. [2025-01-10 06:49:21,920 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:49:21,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:49:21,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955808074] [2025-01-10 06:49:21,920 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 06:49:21,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457377042] [2025-01-10 06:49:21,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457377042] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:49:21,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:49:21,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:49:21,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955835034] [2025-01-10 06:49:21,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:49:21,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:49:21,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:49:21,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:49:21,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:49:21,942 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 87 [2025-01-10 06:49:21,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 289 transitions, 4049 flow. Second operand has 6 states, 6 states have (on average 37.166666666666664) internal successors, (223), 6 states have internal predecessors, (223), 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:49:21,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:49:21,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 87 [2025-01-10 06:49:21,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:49:22,412 INFO L124 PetriNetUnfolderBase]: 122/835 cut-off events. [2025-01-10 06:49:22,412 INFO L125 PetriNetUnfolderBase]: For 23765/23765 co-relation queries the response was YES. [2025-01-10 06:49:22,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3741 conditions, 835 events. 122/835 cut-off events. For 23765/23765 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1968 event pairs, 100 based on Foata normal form. 58/838 useless extension candidates. Maximal degree in co-relation 3035. Up to 249 conditions per place. [2025-01-10 06:49:22,420 INFO L140 encePairwiseOnDemand]: 81/87 looper letters, 35 selfloop transitions, 192 changer transitions 0/259 dead transitions. [2025-01-10 06:49:22,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 259 transitions, 4178 flow [2025-01-10 06:49:22,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:49:22,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 06:49:22,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 286 transitions. [2025-01-10 06:49:22,421 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4696223316912972 [2025-01-10 06:49:22,421 INFO L175 Difference]: Start difference. First operand has 368 places, 289 transitions, 4049 flow. Second operand 7 states and 286 transitions. [2025-01-10 06:49:22,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 259 transitions, 4178 flow [2025-01-10 06:49:22,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 259 transitions, 3553 flow, removed 80 selfloop flow, removed 53 redundant places. [2025-01-10 06:49:22,486 INFO L231 Difference]: Finished difference. Result has 320 places, 259 transitions, 3483 flow [2025-01-10 06:49:22,486 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=3099, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=192, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3483, PETRI_PLACES=320, PETRI_TRANSITIONS=259} [2025-01-10 06:49:22,487 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 246 predicate places. [2025-01-10 06:49:22,487 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 259 transitions, 3483 flow [2025-01-10 06:49:22,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.166666666666664) internal successors, (223), 6 states have internal predecessors, (223), 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:49:22,487 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:49:22,487 INFO L206 CegarLoopForPetriNet]: trace histogram [60, 60, 60, 60, 60, 2, 2, 2, 1, 1, 1] [2025-01-10 06:49:22,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-10 06:49:22,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:49:22,688 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-01-10 06:49:22,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:49:22,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1857717931, now seen corresponding path program 1 times [2025-01-10 06:49:22,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:49:22,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567594021] [2025-01-10 06:49:22,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:49:22,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:49:23,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-01-10 06:49:23,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-01-10 06:49:23,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:49:23,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:49:23,712 INFO L134 CoverageAnalysis]: Checked inductivity of 8974 backedges. 4563 proven. 0 refuted. 0 times theorem prover too weak. 4411 trivial. 0 not checked. [2025-01-10 06:49:23,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:49:23,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567594021] [2025-01-10 06:49:23,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567594021] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:49:23,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:49:23,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:49:23,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456143740] [2025-01-10 06:49:23,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:49:23,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:49:23,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:49:23,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:49:23,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:49:23,721 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 87 [2025-01-10 06:49:23,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 259 transitions, 3483 flow. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 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:49:23,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:49:23,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 87 [2025-01-10 06:49:23,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:49:24,028 INFO L124 PetriNetUnfolderBase]: 122/833 cut-off events. [2025-01-10 06:49:24,028 INFO L125 PetriNetUnfolderBase]: For 8214/8214 co-relation queries the response was YES. [2025-01-10 06:49:24,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3586 conditions, 833 events. 122/833 cut-off events. For 8214/8214 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1956 event pairs, 100 based on Foata normal form. 2/780 useless extension candidates. Maximal degree in co-relation 2900. Up to 245 conditions per place. [2025-01-10 06:49:24,034 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 211 selfloop transitions, 8 changer transitions 0/258 dead transitions. [2025-01-10 06:49:24,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 258 transitions, 3917 flow [2025-01-10 06:49:24,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:49:24,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:49:24,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 190 transitions. [2025-01-10 06:49:24,035 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5459770114942529 [2025-01-10 06:49:24,035 INFO L175 Difference]: Start difference. First operand has 320 places, 259 transitions, 3483 flow. Second operand 4 states and 190 transitions. [2025-01-10 06:49:24,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 258 transitions, 3917 flow [2025-01-10 06:49:24,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 258 transitions, 3445 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-01-10 06:49:24,075 INFO L231 Difference]: Finished difference. Result has 315 places, 258 transitions, 3023 flow [2025-01-10 06:49:24,075 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=3007, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=3023, PETRI_PLACES=315, PETRI_TRANSITIONS=258} [2025-01-10 06:49:24,075 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 241 predicate places. [2025-01-10 06:49:24,076 INFO L471 AbstractCegarLoop]: Abstraction has has 315 places, 258 transitions, 3023 flow [2025-01-10 06:49:24,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 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:49:24,076 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:49:24,076 INFO L206 CegarLoopForPetriNet]: trace histogram [60, 60, 60, 60, 60, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:49:24,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 06:49:24,076 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-01-10 06:49:24,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:49:24,077 INFO L85 PathProgramCache]: Analyzing trace with hash 489922925, now seen corresponding path program 2 times [2025-01-10 06:49:24,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:49:24,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593635250] [2025-01-10 06:49:24,078 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:49:24,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:49:24,464 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 317 statements into 2 equivalence classes. [2025-01-10 06:49:24,709 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 317 of 317 statements. [2025-01-10 06:49:24,710 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:49:24,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:49:25,512 INFO L134 CoverageAnalysis]: Checked inductivity of 8976 backedges. 0 proven. 4566 refuted. 0 times theorem prover too weak. 4410 trivial. 0 not checked. [2025-01-10 06:49:25,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:49:25,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593635250] [2025-01-10 06:49:25,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593635250] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:49:25,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963882155] [2025-01-10 06:49:25,513 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:49:25,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:49:25,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:49:25,515 INFO L229 MonitoredProcess]: Starting monitored process 10 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:49:25,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 06:49:26,474 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 317 statements into 2 equivalence classes. [2025-01-10 06:49:27,031 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 317 of 317 statements. [2025-01-10 06:49:27,031 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:49:27,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:49:27,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 5935 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:49:27,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:49:27,278 INFO L134 CoverageAnalysis]: Checked inductivity of 8976 backedges. 0 proven. 4566 refuted. 0 times theorem prover too weak. 4410 trivial. 0 not checked. [2025-01-10 06:49:27,279 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:49:27,530 INFO L134 CoverageAnalysis]: Checked inductivity of 8976 backedges. 0 proven. 4566 refuted. 0 times theorem prover too weak. 4410 trivial. 0 not checked. [2025-01-10 06:49:27,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963882155] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:49:27,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:49:27,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-01-10 06:49:27,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210443487] [2025-01-10 06:49:27,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:49:27,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 06:49:27,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:49:27,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 06:49:27,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-01-10 06:49:27,563 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 87 [2025-01-10 06:49:27,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 258 transitions, 3023 flow. Second operand has 14 states, 14 states have (on average 38.357142857142854) internal successors, (537), 14 states have internal predecessors, (537), 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:49:27,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:49:27,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 87 [2025-01-10 06:49:27,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:49:28,311 INFO L124 PetriNetUnfolderBase]: 124/1144 cut-off events. [2025-01-10 06:49:28,311 INFO L125 PetriNetUnfolderBase]: For 12486/12486 co-relation queries the response was YES. [2025-01-10 06:49:28,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5151 conditions, 1144 events. 124/1144 cut-off events. For 12486/12486 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1717 event pairs, 100 based on Foata normal form. 3/1092 useless extension candidates. Maximal degree in co-relation 4467. Up to 243 conditions per place. [2025-01-10 06:49:28,316 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 336 selfloop transitions, 11 changer transitions 0/386 dead transitions. [2025-01-10 06:49:28,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 386 transitions, 5885 flow [2025-01-10 06:49:28,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 06:49:28,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 06:49:28,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 456 transitions. [2025-01-10 06:49:28,317 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47648902821316613 [2025-01-10 06:49:28,317 INFO L175 Difference]: Start difference. First operand has 315 places, 258 transitions, 3023 flow. Second operand 11 states and 456 transitions. [2025-01-10 06:49:28,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 386 transitions, 5885 flow [2025-01-10 06:49:28,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 386 transitions, 5853 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:49:28,360 INFO L231 Difference]: Finished difference. Result has 326 places, 264 transitions, 3353 flow [2025-01-10 06:49:28,361 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=3007, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3353, PETRI_PLACES=326, PETRI_TRANSITIONS=264} [2025-01-10 06:49:28,361 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 252 predicate places. [2025-01-10 06:49:28,361 INFO L471 AbstractCegarLoop]: Abstraction has has 326 places, 264 transitions, 3353 flow [2025-01-10 06:49:28,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 38.357142857142854) internal successors, (537), 14 states have internal predecessors, (537), 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:49:28,362 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:49:28,362 INFO L206 CegarLoopForPetriNet]: trace histogram [150, 150, 150, 150, 150, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:49:28,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-10 06:49:28,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:49:28,563 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-01-10 06:49:28,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:49:28,566 INFO L85 PathProgramCache]: Analyzing trace with hash -2110386502, now seen corresponding path program 3 times [2025-01-10 06:49:28,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:49:28,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349935283] [2025-01-10 06:49:28,566 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:49:28,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms