./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread-theta/unwind1-100.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-theta/unwind1-100.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 d866fedd3df666b1282e36d0ae87b17d0a587658c87dddd4d2314d9586432757 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:57:38,603 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:57:38,655 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:57:38,662 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:57:38,663 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:57:38,686 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:57:38,687 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:57:38,687 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:57:38,688 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:57:38,688 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:57:38,689 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:57:38,689 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:57:38,689 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:57:38,689 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:57:38,689 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:57:38,689 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:57:38,689 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:57:38,689 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:57:38,689 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:57:38,690 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:57:38,690 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:57:38,690 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:57:38,690 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:57:38,690 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:57:38,690 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:57:38,690 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:57:38,690 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:57:38,690 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:57:38,690 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:57:38,690 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:57:38,690 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:57:38,690 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:57:38,690 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:57:38,690 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:57:38,690 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:57:38,690 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:57:38,690 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:57:38,690 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:57:38,690 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:57:38,690 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:57:38,690 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:57:38,691 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:57:38,691 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:57:38,691 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:57:38,691 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:57:38,691 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:57:38,691 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:57:38,691 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:57:38,691 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:57:38,691 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:57:38,691 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 -> d866fedd3df666b1282e36d0ae87b17d0a587658c87dddd4d2314d9586432757 [2025-01-10 06:57:38,929 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:57:38,937 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:57:38,940 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:57:38,941 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:57:38,941 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:57:38,943 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind1-100.i [2025-01-10 06:57:40,112 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b2bfb3278/b6a7bc75c9f840d9bc0974148c27bdea/FLAGd7f3c3d8d [2025-01-10 06:57:40,374 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:57:40,375 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind1-100.i [2025-01-10 06:57:40,390 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b2bfb3278/b6a7bc75c9f840d9bc0974148c27bdea/FLAGd7f3c3d8d [2025-01-10 06:57:40,674 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b2bfb3278/b6a7bc75c9f840d9bc0974148c27bdea [2025-01-10 06:57:40,676 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:57:40,677 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:57:40,678 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:57:40,678 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:57:40,681 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:57:40,682 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:57:40" (1/1) ... [2025-01-10 06:57:40,682 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58c17987 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:40, skipping insertion in model container [2025-01-10 06:57:40,683 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:57:40" (1/1) ... [2025-01-10 06:57:40,710 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:57:40,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:57:40,971 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:57:41,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:57:41,036 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:57:41,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:41 WrapperNode [2025-01-10 06:57:41,036 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:57:41,037 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:57:41,037 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:57:41,037 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:57:41,041 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:57:41" (1/1) ... [2025-01-10 06:57:41,049 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:57:41" (1/1) ... [2025-01-10 06:57:41,061 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 55 [2025-01-10 06:57:41,062 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:57:41,062 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:57:41,062 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:57:41,062 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:57:41,067 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:41" (1/1) ... [2025-01-10 06:57:41,067 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:41" (1/1) ... [2025-01-10 06:57:41,069 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:41" (1/1) ... [2025-01-10 06:57:41,077 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 06:57:41,077 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:41" (1/1) ... [2025-01-10 06:57:41,077 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:41" (1/1) ... [2025-01-10 06:57:41,080 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:41" (1/1) ... [2025-01-10 06:57:41,081 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:41" (1/1) ... [2025-01-10 06:57:41,082 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:41" (1/1) ... [2025-01-10 06:57:41,083 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:41" (1/1) ... [2025-01-10 06:57:41,084 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:41" (1/1) ... [2025-01-10 06:57:41,085 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:57:41,085 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:57:41,085 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:57:41,085 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:57:41,086 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:41" (1/1) ... [2025-01-10 06:57:41,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:57:41,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:57:41,119 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:57:41,121 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:57:41,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:57:41,139 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-01-10 06:57:41,139 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-01-10 06:57:41,139 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-01-10 06:57:41,139 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-01-10 06:57:41,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:57:41,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:57:41,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:57:41,140 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:57:41,242 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:57:41,243 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:57:41,368 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:57:41,368 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:57:41,452 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:57:41,452 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 06:57:41,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:57:41 BoogieIcfgContainer [2025-01-10 06:57:41,453 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:57:41,455 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:57:41,455 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:57:41,458 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:57:41,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:57:40" (1/3) ... [2025-01-10 06:57:41,459 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@176820f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:57:41, skipping insertion in model container [2025-01-10 06:57:41,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:57:41" (2/3) ... [2025-01-10 06:57:41,459 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@176820f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:57:41, skipping insertion in model container [2025-01-10 06:57:41,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:57:41" (3/3) ... [2025-01-10 06:57:41,460 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind1-100.i [2025-01-10 06:57:41,471 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:57:41,472 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind1-100.i that has 3 procedures, 26 locations, 1 initial locations, 1 loop locations, and 4 error locations. [2025-01-10 06:57:41,473 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:57:41,515 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 06:57:41,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 27 transitions, 68 flow [2025-01-10 06:57:41,561 INFO L124 PetriNetUnfolderBase]: 2/25 cut-off events. [2025-01-10 06:57:41,564 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 06:57:41,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 25 events. 2/25 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 54 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 22. Up to 2 conditions per place. [2025-01-10 06:57:41,568 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 27 transitions, 68 flow [2025-01-10 06:57:41,570 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 28 places, 23 transitions, 55 flow [2025-01-10 06:57:41,577 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:57:41,589 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;@786215e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:57:41,590 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-01-10 06:57:41,597 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:57:41,597 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-01-10 06:57:41,597 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:57:41,597 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:41,598 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:57:41,598 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-01-10 06:57:41,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:41,602 INFO L85 PathProgramCache]: Analyzing trace with hash 207772424, now seen corresponding path program 1 times [2025-01-10 06:57:41,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:41,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824478232] [2025-01-10 06:57:41,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:41,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:41,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:57:41,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:57:41,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:41,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:41,782 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:57:41,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:41,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824478232] [2025-01-10 06:57:41,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824478232] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:41,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:41,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:57:41,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802137587] [2025-01-10 06:57:41,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:41,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:57:41,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:41,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:57:41,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:57:41,825 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2025-01-10 06:57:41,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 23 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:57:41,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:41,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2025-01-10 06:57:41,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:41,893 INFO L124 PetriNetUnfolderBase]: 81/188 cut-off events. [2025-01-10 06:57:41,895 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-01-10 06:57:41,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 354 conditions, 188 events. 81/188 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 799 event pairs, 66 based on Foata normal form. 10/161 useless extension candidates. Maximal degree in co-relation 324. Up to 144 conditions per place. [2025-01-10 06:57:41,899 INFO L140 encePairwiseOnDemand]: 25/27 looper letters, 14 selfloop transitions, 1 changer transitions 0/22 dead transitions. [2025-01-10 06:57:41,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 22 transitions, 83 flow [2025-01-10 06:57:41,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:57:41,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:57:41,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2025-01-10 06:57:41,909 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5308641975308642 [2025-01-10 06:57:41,910 INFO L175 Difference]: Start difference. First operand has 28 places, 23 transitions, 55 flow. Second operand 3 states and 43 transitions. [2025-01-10 06:57:41,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 22 transitions, 83 flow [2025-01-10 06:57:41,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 22 transitions, 78 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:57:41,914 INFO L231 Difference]: Finished difference. Result has 26 places, 22 transitions, 50 flow [2025-01-10 06:57:41,918 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=26, PETRI_TRANSITIONS=22} [2025-01-10 06:57:41,921 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, -2 predicate places. [2025-01-10 06:57:41,922 INFO L471 AbstractCegarLoop]: Abstraction has has 26 places, 22 transitions, 50 flow [2025-01-10 06:57:41,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:57:41,922 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:41,922 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 06:57:41,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:57:41,923 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-01-10 06:57:41,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:41,923 INFO L85 PathProgramCache]: Analyzing trace with hash 2145978076, now seen corresponding path program 1 times [2025-01-10 06:57:41,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:41,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643998677] [2025-01-10 06:57:41,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:41,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:41,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:57:41,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:57:41,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:41,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:41,980 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:57:41,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:41,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643998677] [2025-01-10 06:57:41,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643998677] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:41,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:41,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:57:41,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025959623] [2025-01-10 06:57:41,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:41,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:57:41,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:41,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:57:41,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:57:41,995 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2025-01-10 06:57:41,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 22 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:57:41,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:41,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2025-01-10 06:57:41,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:42,045 INFO L124 PetriNetUnfolderBase]: 67/158 cut-off events. [2025-01-10 06:57:42,046 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 06:57:42,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 293 conditions, 158 events. 67/158 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 622 event pairs, 54 based on Foata normal form. 9/135 useless extension candidates. Maximal degree in co-relation 287. Up to 120 conditions per place. [2025-01-10 06:57:42,047 INFO L140 encePairwiseOnDemand]: 25/27 looper letters, 13 selfloop transitions, 1 changer transitions 0/21 dead transitions. [2025-01-10 06:57:42,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 21 transitions, 76 flow [2025-01-10 06:57:42,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:57:42,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:57:42,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2025-01-10 06:57:42,048 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2025-01-10 06:57:42,048 INFO L175 Difference]: Start difference. First operand has 26 places, 22 transitions, 50 flow. Second operand 3 states and 42 transitions. [2025-01-10 06:57:42,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 21 transitions, 76 flow [2025-01-10 06:57:42,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 21 transitions, 75 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:57:42,049 INFO L231 Difference]: Finished difference. Result has 26 places, 21 transitions, 49 flow [2025-01-10 06:57:42,049 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=47, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=49, PETRI_PLACES=26, PETRI_TRANSITIONS=21} [2025-01-10 06:57:42,049 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, -2 predicate places. [2025-01-10 06:57:42,050 INFO L471 AbstractCegarLoop]: Abstraction has has 26 places, 21 transitions, 49 flow [2025-01-10 06:57:42,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:57:42,050 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:42,050 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:42,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:57:42,050 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-01-10 06:57:42,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:42,050 INFO L85 PathProgramCache]: Analyzing trace with hash 2097598620, now seen corresponding path program 1 times [2025-01-10 06:57:42,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:42,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777499349] [2025-01-10 06:57:42,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:42,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:42,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:57:42,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:57:42,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:42,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:42,148 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:57:42,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:42,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777499349] [2025-01-10 06:57:42,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777499349] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:42,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:42,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:57:42,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126594274] [2025-01-10 06:57:42,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:42,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:57:42,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:42,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:57:42,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:57:42,159 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2025-01-10 06:57:42,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 21 transitions, 49 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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:57:42,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:42,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2025-01-10 06:57:42,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:42,253 INFO L124 PetriNetUnfolderBase]: 72/155 cut-off events. [2025-01-10 06:57:42,253 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 06:57:42,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 155 events. 72/155 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 515 event pairs, 18 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 305. Up to 55 conditions per place. [2025-01-10 06:57:42,258 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 15 selfloop transitions, 3 changer transitions 13/36 dead transitions. [2025-01-10 06:57:42,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 36 transitions, 144 flow [2025-01-10 06:57:42,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:57:42,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:57:42,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2025-01-10 06:57:42,259 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5777777777777777 [2025-01-10 06:57:42,260 INFO L175 Difference]: Start difference. First operand has 26 places, 21 transitions, 49 flow. Second operand 5 states and 78 transitions. [2025-01-10 06:57:42,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 36 transitions, 144 flow [2025-01-10 06:57:42,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 36 transitions, 143 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:57:42,261 INFO L231 Difference]: Finished difference. Result has 32 places, 20 transitions, 61 flow [2025-01-10 06:57:42,261 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=61, PETRI_PLACES=32, PETRI_TRANSITIONS=20} [2025-01-10 06:57:42,262 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 4 predicate places. [2025-01-10 06:57:42,262 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 20 transitions, 61 flow [2025-01-10 06:57:42,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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:57:42,262 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:42,262 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:42,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:57:42,262 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-01-10 06:57:42,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:42,263 INFO L85 PathProgramCache]: Analyzing trace with hash -2133903122, now seen corresponding path program 1 times [2025-01-10 06:57:42,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:42,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854627852] [2025-01-10 06:57:42,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:42,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:42,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:57:42,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:57:42,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:42,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:42,335 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:57:42,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:42,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854627852] [2025-01-10 06:57:42,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854627852] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:42,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:57:42,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:57:42,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004865933] [2025-01-10 06:57:42,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:42,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:57:42,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:42,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:57:42,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:57:42,347 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2025-01-10 06:57:42,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 20 transitions, 61 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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:57:42,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:42,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2025-01-10 06:57:42,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:42,409 INFO L124 PetriNetUnfolderBase]: 49/117 cut-off events. [2025-01-10 06:57:42,410 INFO L125 PetriNetUnfolderBase]: For 22/23 co-relation queries the response was YES. [2025-01-10 06:57:42,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 117 events. 49/117 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 321 event pairs, 32 based on Foata normal form. 5/112 useless extension candidates. Maximal degree in co-relation 258. Up to 80 conditions per place. [2025-01-10 06:57:42,411 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 20 selfloop transitions, 3 changer transitions 0/28 dead transitions. [2025-01-10 06:57:42,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 28 transitions, 129 flow [2025-01-10 06:57:42,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:57:42,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:57:42,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2025-01-10 06:57:42,414 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5648148148148148 [2025-01-10 06:57:42,414 INFO L175 Difference]: Start difference. First operand has 32 places, 20 transitions, 61 flow. Second operand 4 states and 61 transitions. [2025-01-10 06:57:42,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 28 transitions, 129 flow [2025-01-10 06:57:42,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 28 transitions, 115 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-01-10 06:57:42,415 INFO L231 Difference]: Finished difference. Result has 30 places, 22 transitions, 73 flow [2025-01-10 06:57:42,415 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=51, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=73, PETRI_PLACES=30, PETRI_TRANSITIONS=22} [2025-01-10 06:57:42,416 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 2 predicate places. [2025-01-10 06:57:42,416 INFO L471 AbstractCegarLoop]: Abstraction has has 30 places, 22 transitions, 73 flow [2025-01-10 06:57:42,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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:57:42,416 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:42,416 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:42,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:57:42,416 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-01-10 06:57:42,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:42,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1296725215, now seen corresponding path program 1 times [2025-01-10 06:57:42,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:42,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749902893] [2025-01-10 06:57:42,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:42,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:42,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:57:42,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:57:42,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:42,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:42,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:42,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:42,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749902893] [2025-01-10 06:57:42,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749902893] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:57:42,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844221790] [2025-01-10 06:57:42,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:42,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:57:42,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:57:42,501 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:57:42,502 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:57:42,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:57:42,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:57:42,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:42,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:42,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:57:42,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:57:42,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:42,597 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:57:42,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844221790] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:57:42,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:57:42,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-10 06:57:42,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017334542] [2025-01-10 06:57:42,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:57:42,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:57:42,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:42,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:57:42,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:57:42,609 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2025-01-10 06:57:42,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 22 transitions, 73 flow. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:57:42,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:42,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2025-01-10 06:57:42,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:42,690 INFO L124 PetriNetUnfolderBase]: 44/107 cut-off events. [2025-01-10 06:57:42,690 INFO L125 PetriNetUnfolderBase]: For 43/44 co-relation queries the response was YES. [2025-01-10 06:57:42,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 107 events. 44/107 cut-off events. For 43/44 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 280 event pairs, 12 based on Foata normal form. 5/102 useless extension candidates. Maximal degree in co-relation 254. Up to 35 conditions per place. [2025-01-10 06:57:42,692 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 23 selfloop transitions, 5 changer transitions 0/33 dead transitions. [2025-01-10 06:57:42,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 33 transitions, 153 flow [2025-01-10 06:57:42,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:57:42,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:57:42,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2025-01-10 06:57:42,693 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5123456790123457 [2025-01-10 06:57:42,693 INFO L175 Difference]: Start difference. First operand has 30 places, 22 transitions, 73 flow. Second operand 6 states and 83 transitions. [2025-01-10 06:57:42,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 33 transitions, 153 flow [2025-01-10 06:57:42,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 33 transitions, 151 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:57:42,694 INFO L231 Difference]: Finished difference. Result has 33 places, 21 transitions, 77 flow [2025-01-10 06:57:42,694 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=77, PETRI_PLACES=33, PETRI_TRANSITIONS=21} [2025-01-10 06:57:42,694 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 5 predicate places. [2025-01-10 06:57:42,694 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 21 transitions, 77 flow [2025-01-10 06:57:42,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:57:42,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:42,695 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:42,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 06:57:42,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:57:42,899 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-01-10 06:57:42,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:42,900 INFO L85 PathProgramCache]: Analyzing trace with hash 170588653, now seen corresponding path program 1 times [2025-01-10 06:57:42,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:42,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509689121] [2025-01-10 06:57:42,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:42,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:42,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:57:42,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:57:42,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:42,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:42,972 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:42,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:42,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509689121] [2025-01-10 06:57:42,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509689121] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:57:42,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453194503] [2025-01-10 06:57:42,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:57:42,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:57:42,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:57:42,976 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:57:42,977 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:57:43,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:57:43,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:57:43,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:57:43,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:43,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:57:43,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:57:43,063 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:43,063 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:57:43,098 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:57:43,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453194503] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:57:43,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:57:43,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-10 06:57:43,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860809661] [2025-01-10 06:57:43,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:57:43,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 06:57:43,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:43,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 06:57:43,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 06:57:43,112 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2025-01-10 06:57:43,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 21 transitions, 77 flow. Second operand has 12 states, 12 states have (on average 10.583333333333334) internal successors, (127), 12 states have internal predecessors, (127), 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:57:43,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:43,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2025-01-10 06:57:43,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:43,253 INFO L124 PetriNetUnfolderBase]: 74/182 cut-off events. [2025-01-10 06:57:43,254 INFO L125 PetriNetUnfolderBase]: For 137/138 co-relation queries the response was YES. [2025-01-10 06:57:43,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 479 conditions, 182 events. 74/182 cut-off events. For 137/138 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 475 event pairs, 27 based on Foata normal form. 15/192 useless extension candidates. Maximal degree in co-relation 469. Up to 70 conditions per place. [2025-01-10 06:57:43,257 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 37 selfloop transitions, 9 changer transitions 0/51 dead transitions. [2025-01-10 06:57:43,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 51 transitions, 261 flow [2025-01-10 06:57:43,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:57:43,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:57:43,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 139 transitions. [2025-01-10 06:57:43,260 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5148148148148148 [2025-01-10 06:57:43,260 INFO L175 Difference]: Start difference. First operand has 33 places, 21 transitions, 77 flow. Second operand 10 states and 139 transitions. [2025-01-10 06:57:43,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 51 transitions, 261 flow [2025-01-10 06:57:43,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 51 transitions, 235 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-01-10 06:57:43,261 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 121 flow [2025-01-10 06:57:43,261 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=121, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2025-01-10 06:57:43,262 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 12 predicate places. [2025-01-10 06:57:43,262 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 121 flow [2025-01-10 06:57:43,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.583333333333334) internal successors, (127), 12 states have internal predecessors, (127), 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:57:43,262 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:57:43,262 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:57:43,269 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:57:43,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:57:43,468 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-01-10 06:57:43,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:57:43,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1970039228, now seen corresponding path program 2 times [2025-01-10 06:57:43,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:57:43,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812101886] [2025-01-10 06:57:43,469 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:57:43,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:57:43,474 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-01-10 06:57:43,476 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 23 statements. [2025-01-10 06:57:43,477 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:57:43,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:43,519 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:57:43,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:57:43,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812101886] [2025-01-10 06:57:43,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812101886] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:57:43,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29176124] [2025-01-10 06:57:43,520 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:57:43,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:57:43,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:57:43,522 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:57:43,523 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:57:43,558 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-01-10 06:57:43,566 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 23 statements. [2025-01-10 06:57:43,566 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:57:43,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:57:43,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:57:43,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:57:43,610 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:57:43,610 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:57:43,675 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:57:43,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [29176124] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:57:43,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:57:43,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-01-10 06:57:43,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647039174] [2025-01-10 06:57:43,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:57:43,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:57:43,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:57:43,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:57:43,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:57:43,715 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2025-01-10 06:57:43,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 121 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 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:57:43,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:57:43,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2025-01-10 06:57:43,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:57:43,828 INFO L124 PetriNetUnfolderBase]: 134/325 cut-off events. [2025-01-10 06:57:43,829 INFO L125 PetriNetUnfolderBase]: For 414/414 co-relation queries the response was YES. [2025-01-10 06:57:43,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 885 conditions, 325 events. 134/325 cut-off events. For 414/414 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1156 event pairs, 18 based on Foata normal form. 10/330 useless extension candidates. Maximal degree in co-relation 873. Up to 55 conditions per place. [2025-01-10 06:57:43,830 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 0 selfloop transitions, 0 changer transitions 54/54 dead transitions. [2025-01-10 06:57:43,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 54 transitions, 328 flow [2025-01-10 06:57:43,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 06:57:43,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 06:57:43,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 70 transitions. [2025-01-10 06:57:43,831 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32407407407407407 [2025-01-10 06:57:43,831 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 121 flow. Second operand 8 states and 70 transitions. [2025-01-10 06:57:43,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 54 transitions, 328 flow [2025-01-10 06:57:43,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 54 transitions, 288 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-01-10 06:57:43,834 INFO L231 Difference]: Finished difference. Result has 40 places, 0 transitions, 0 flow [2025-01-10 06:57:43,834 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=0, PETRI_PLACES=40, PETRI_TRANSITIONS=0} [2025-01-10 06:57:43,834 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 12 predicate places. [2025-01-10 06:57:43,834 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 0 transitions, 0 flow [2025-01-10 06:57:43,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 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:57:43,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-01-10 06:57:43,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 10 remaining) [2025-01-10 06:57:43,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2025-01-10 06:57:43,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2025-01-10 06:57:43,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2025-01-10 06:57:43,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2025-01-10 06:57:43,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2025-01-10 06:57:43,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2025-01-10 06:57:43,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2025-01-10 06:57:43,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2025-01-10 06:57:43,844 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:57:44,042 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:57:44,042 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2025-01-10 06:57:44,046 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 06:57:44,046 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 06:57:44,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 06:57:44 BasicIcfg [2025-01-10 06:57:44,049 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 06:57:44,050 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 06:57:44,050 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 06:57:44,050 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 06:57:44,050 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:57:41" (3/4) ... [2025-01-10 06:57:44,051 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 06:57:44,053 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure f1 [2025-01-10 06:57:44,053 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure f2 [2025-01-10 06:57:44,055 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 32 nodes and edges [2025-01-10 06:57:44,055 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-01-10 06:57:44,055 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-01-10 06:57:44,055 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 06:57:44,109 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 06:57:44,109 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 06:57:44,109 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 06:57:44,110 INFO L158 Benchmark]: Toolchain (without parser) took 3432.31ms. Allocated memory is still 167.8MB. Free memory was 131.4MB in the beginning and 78.5MB in the end (delta: 52.9MB). Peak memory consumption was 50.2MB. Max. memory is 16.1GB. [2025-01-10 06:57:44,110 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:57:44,110 INFO L158 Benchmark]: CACSL2BoogieTranslator took 358.25ms. Allocated memory is still 167.8MB. Free memory was 131.4MB in the beginning and 111.5MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 06:57:44,110 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.67ms. Allocated memory is still 167.8MB. Free memory was 111.5MB in the beginning and 110.0MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 06:57:44,110 INFO L158 Benchmark]: Boogie Preprocessor took 22.59ms. Allocated memory is still 167.8MB. Free memory was 110.0MB in the beginning and 108.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:57:44,111 INFO L158 Benchmark]: RCFGBuilder took 367.60ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 88.7MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 06:57:44,111 INFO L158 Benchmark]: TraceAbstraction took 2594.94ms. Allocated memory is still 167.8MB. Free memory was 88.2MB in the beginning and 83.9MB in the end (delta: 4.4MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. [2025-01-10 06:57:44,111 INFO L158 Benchmark]: Witness Printer took 59.27ms. Allocated memory is still 167.8MB. Free memory was 83.9MB in the beginning and 78.5MB in the end (delta: 5.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:57:44,112 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 358.25ms. Allocated memory is still 167.8MB. Free memory was 131.4MB in the beginning and 111.5MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.67ms. Allocated memory is still 167.8MB. Free memory was 111.5MB in the beginning and 110.0MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.59ms. Allocated memory is still 167.8MB. Free memory was 110.0MB in the beginning and 108.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 367.60ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 88.7MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2594.94ms. Allocated memory is still 167.8MB. Free memory was 88.2MB in the beginning and 83.9MB in the end (delta: 4.4MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. * Witness Printer took 59.27ms. Allocated memory is still 167.8MB. Free memory was 83.9MB in the beginning and 78.5MB in the end (delta: 5.3MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 760]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 760]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 767]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 767]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 45 locations, 10 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.5s, OverallIterations: 7, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 272 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 233 mSDsluCounter, 95 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 83 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 540 IncrementalHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 12 mSDtfsCounter, 540 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 118 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=121occurred in iteration=6, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 128 NumberOfCodeBlocks, 104 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 153 ConstructedInterpolants, 0 QuantifiedInterpolants, 377 SizeOfPredicates, 9 NumberOfNonLiveVariables, 235 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 12 InterpolantComputations, 5 PerfectInterpolantSequences, 68/103 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-10 06:57:44,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE