./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/popl20-min-max-inc.wvr.c --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/weaver/popl20-min-max-inc.wvr.c -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 341ac5a9697f243416924cef7ae19a5e9bc693a5982154ab196fb2faacf237d5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:53:46,899 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:53:46,968 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:53:46,976 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:53:46,976 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:53:47,006 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:53:47,007 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:53:47,007 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:53:47,008 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:53:47,008 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:53:47,009 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:53:47,009 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:53:47,009 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:53:47,010 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:53:47,010 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:53:47,010 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:53:47,010 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:53:47,010 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:53:47,010 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:53:47,010 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:53:47,010 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:53:47,010 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:53:47,010 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:53:47,010 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:53:47,011 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:53:47,011 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:53:47,011 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:53:47,011 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:53:47,011 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:53:47,011 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:53:47,011 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:53:47,011 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:53:47,011 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:53:47,011 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:53:47,011 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:53:47,011 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:53:47,011 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:53:47,011 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:53:47,011 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:53:47,012 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:53:47,012 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:53:47,012 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:53:47,012 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:53:47,012 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:53:47,012 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:53:47,012 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:53:47,012 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:53:47,012 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:53:47,012 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:53:47,012 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:53:47,012 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 -> 341ac5a9697f243416924cef7ae19a5e9bc693a5982154ab196fb2faacf237d5 [2025-01-10 06:53:47,261 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:53:47,272 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:53:47,274 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:53:47,275 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:53:47,275 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:53:47,276 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-min-max-inc.wvr.c [2025-01-10 06:53:48,504 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2143f9e03/fc5adfc196de4d5596fbea9969498a5c/FLAGf15c23051 [2025-01-10 06:53:48,759 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:53:48,760 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-min-max-inc.wvr.c [2025-01-10 06:53:48,771 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2143f9e03/fc5adfc196de4d5596fbea9969498a5c/FLAGf15c23051 [2025-01-10 06:53:48,792 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2143f9e03/fc5adfc196de4d5596fbea9969498a5c [2025-01-10 06:53:48,794 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:53:48,797 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:53:48,799 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:53:48,799 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:53:48,803 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:53:48,804 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:53:48" (1/1) ... [2025-01-10 06:53:48,806 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@413ec881 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:48, skipping insertion in model container [2025-01-10 06:53:48,806 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:53:48" (1/1) ... [2025-01-10 06:53:48,826 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:53:48,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:53:49,004 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:53:49,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:53:49,043 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:53:49,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:49 WrapperNode [2025-01-10 06:53:49,044 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:53:49,045 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:53:49,045 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:53:49,045 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:53:49,052 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:53:49" (1/1) ... [2025-01-10 06:53:49,059 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:53:49" (1/1) ... [2025-01-10 06:53:49,084 INFO L138 Inliner]: procedures = 23, calls = 26, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 120 [2025-01-10 06:53:49,088 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:53:49,089 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:53:49,089 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:53:49,090 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:53:49,098 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:49" (1/1) ... [2025-01-10 06:53:49,098 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:49" (1/1) ... [2025-01-10 06:53:49,105 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:49" (1/1) ... [2025-01-10 06:53:49,126 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-01-10 06:53:49,126 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:49" (1/1) ... [2025-01-10 06:53:49,126 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:49" (1/1) ... [2025-01-10 06:53:49,140 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:49" (1/1) ... [2025-01-10 06:53:49,143 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:49" (1/1) ... [2025-01-10 06:53:49,146 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:49" (1/1) ... [2025-01-10 06:53:49,151 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:49" (1/1) ... [2025-01-10 06:53:49,152 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:49" (1/1) ... [2025-01-10 06:53:49,153 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:53:49,154 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:53:49,154 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:53:49,154 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:53:49,160 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:49" (1/1) ... [2025-01-10 06:53:49,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:53:49,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:53:49,197 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:53:49,204 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:53:49,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:53:49,225 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 06:53:49,225 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 06:53:49,225 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 06:53:49,225 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 06:53:49,225 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-10 06:53:49,225 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-10 06:53:49,225 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-01-10 06:53:49,225 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-01-10 06:53:49,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:53:49,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:53:49,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:53:49,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:53:49,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 06:53:49,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:53:49,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:53:49,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:53:49,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:53:49,227 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:53:49,331 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:53:49,332 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:53:49,686 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:53:49,686 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:53:49,872 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:53:49,872 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 06:53:49,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:53:49 BoogieIcfgContainer [2025-01-10 06:53:49,873 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:53:49,875 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:53:49,875 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:53:49,879 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:53:49,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:53:48" (1/3) ... [2025-01-10 06:53:49,879 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b27c664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:53:49, skipping insertion in model container [2025-01-10 06:53:49,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:49" (2/3) ... [2025-01-10 06:53:49,880 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b27c664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:53:49, skipping insertion in model container [2025-01-10 06:53:49,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:53:49" (3/3) ... [2025-01-10 06:53:49,881 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-min-max-inc.wvr.c [2025-01-10 06:53:49,894 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:53:49,896 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-min-max-inc.wvr.c that has 5 procedures, 78 locations, 1 initial locations, 4 loop locations, and 12 error locations. [2025-01-10 06:53:49,896 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:53:49,975 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-10 06:53:50,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 84 transitions, 196 flow [2025-01-10 06:53:50,057 INFO L124 PetriNetUnfolderBase]: 7/80 cut-off events. [2025-01-10 06:53:50,059 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-10 06:53:50,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 80 events. 7/80 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 233 event pairs, 0 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2025-01-10 06:53:50,064 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 84 transitions, 196 flow [2025-01-10 06:53:50,067 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 78 transitions, 177 flow [2025-01-10 06:53:50,083 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:53:50,093 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;@76108d86, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:53:50,093 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-01-10 06:53:50,097 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:53:50,097 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-01-10 06:53:50,097 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:53:50,097 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:53:50,098 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:53:50,098 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-01-10 06:53:50,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:53:50,103 INFO L85 PathProgramCache]: Analyzing trace with hash 483931456, now seen corresponding path program 1 times [2025-01-10 06:53:50,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:53:50,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77033353] [2025-01-10 06:53:50,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:53:50,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:53:50,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:53:50,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:53:50,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:53:50,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:53:50,354 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:53:50,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:53:50,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77033353] [2025-01-10 06:53:50,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77033353] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:53:50,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:53:50,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:53:50,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279127081] [2025-01-10 06:53:50,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:53:50,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:53:50,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:53:50,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:53:50,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:53:50,397 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 84 [2025-01-10 06:53:50,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 78 transitions, 177 flow. Second operand has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 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:53:50,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:53:50,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 84 [2025-01-10 06:53:50,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:53:53,370 INFO L124 PetriNetUnfolderBase]: 17917/29110 cut-off events. [2025-01-10 06:53:53,371 INFO L125 PetriNetUnfolderBase]: For 1129/1129 co-relation queries the response was YES. [2025-01-10 06:53:53,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52252 conditions, 29110 events. 17917/29110 cut-off events. For 1129/1129 co-relation queries the response was YES. Maximal size of possible extension queue 1440. Compared 241657 event pairs, 12969 based on Foata normal form. 1/24947 useless extension candidates. Maximal degree in co-relation 49607. Up to 21847 conditions per place. [2025-01-10 06:53:53,699 INFO L140 encePairwiseOnDemand]: 78/84 looper letters, 41 selfloop transitions, 4 changer transitions 0/81 dead transitions. [2025-01-10 06:53:53,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 81 transitions, 273 flow [2025-01-10 06:53:53,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:53:53,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:53:53,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 207 transitions. [2025-01-10 06:53:53,716 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6160714285714286 [2025-01-10 06:53:53,718 INFO L175 Difference]: Start difference. First operand has 84 places, 78 transitions, 177 flow. Second operand 4 states and 207 transitions. [2025-01-10 06:53:53,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 81 transitions, 273 flow [2025-01-10 06:53:53,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 81 transitions, 260 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-01-10 06:53:53,764 INFO L231 Difference]: Finished difference. Result has 82 places, 81 transitions, 193 flow [2025-01-10 06:53:53,767 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=193, PETRI_PLACES=82, PETRI_TRANSITIONS=81} [2025-01-10 06:53:53,772 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, -2 predicate places. [2025-01-10 06:53:53,772 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 81 transitions, 193 flow [2025-01-10 06:53:53,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 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:53:53,773 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:53:53,773 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:53:53,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:53:53,774 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-01-10 06:53:53,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:53:53,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1402735400, now seen corresponding path program 1 times [2025-01-10 06:53:53,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:53:53,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44674770] [2025-01-10 06:53:53,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:53:53,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:53:53,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:53:53,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:53:53,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:53:53,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:53:53,946 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:53:53,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:53:53,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44674770] [2025-01-10 06:53:53,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44674770] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:53:53,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698851272] [2025-01-10 06:53:53,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:53:53,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:53:53,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:53:53,960 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:53:53,967 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:53:54,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:53:54,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:53:54,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:53:54,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:53:54,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:53:54,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:53:54,099 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:53:54,099 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:53:54,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698851272] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:53:54,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:53:54,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-10 06:53:54,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710664095] [2025-01-10 06:53:54,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:53:54,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:53:54,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:53:54,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:53:54,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:53:54,111 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 84 [2025-01-10 06:53:54,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 81 transitions, 193 flow. Second operand has 6 states, 6 states have (on average 41.0) internal successors, (246), 6 states have internal predecessors, (246), 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:53:54,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:53:54,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 84 [2025-01-10 06:53:54,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:53:56,495 INFO L124 PetriNetUnfolderBase]: 17917/29109 cut-off events. [2025-01-10 06:53:56,496 INFO L125 PetriNetUnfolderBase]: For 209/209 co-relation queries the response was YES. [2025-01-10 06:53:56,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51911 conditions, 29109 events. 17917/29109 cut-off events. For 209/209 co-relation queries the response was YES. Maximal size of possible extension queue 1440. Compared 241633 event pairs, 12969 based on Foata normal form. 1/24947 useless extension candidates. Maximal degree in co-relation 51884. Up to 21842 conditions per place. [2025-01-10 06:53:56,723 INFO L140 encePairwiseOnDemand]: 79/84 looper letters, 37 selfloop transitions, 7 changer transitions 0/80 dead transitions. [2025-01-10 06:53:56,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 80 transitions, 277 flow [2025-01-10 06:53:56,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:53:56,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:53:56,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 285 transitions. [2025-01-10 06:53:56,731 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5654761904761905 [2025-01-10 06:53:56,731 INFO L175 Difference]: Start difference. First operand has 82 places, 81 transitions, 193 flow. Second operand 6 states and 285 transitions. [2025-01-10 06:53:56,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 80 transitions, 277 flow [2025-01-10 06:53:56,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 80 transitions, 274 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:53:56,735 INFO L231 Difference]: Finished difference. Result has 85 places, 80 transitions, 200 flow [2025-01-10 06:53:56,735 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=200, PETRI_PLACES=85, PETRI_TRANSITIONS=80} [2025-01-10 06:53:56,736 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 1 predicate places. [2025-01-10 06:53:56,736 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 80 transitions, 200 flow [2025-01-10 06:53:56,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 41.0) internal successors, (246), 6 states have internal predecessors, (246), 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:53:56,737 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:53:56,737 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2025-01-10 06:53:56,746 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:53:56,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:53:56,942 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-01-10 06:53:56,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:53:56,943 INFO L85 PathProgramCache]: Analyzing trace with hash -535123966, now seen corresponding path program 1 times [2025-01-10 06:53:56,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:53:56,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453852376] [2025-01-10 06:53:56,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:53:56,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:53:56,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:53:56,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:53:56,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:53:56,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:53:57,067 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:53:57,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:53:57,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453852376] [2025-01-10 06:53:57,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453852376] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:53:57,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087705141] [2025-01-10 06:53:57,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:53:57,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:53:57,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:53:57,070 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:53:57,071 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:53:57,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:53:57,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:53:57,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:53:57,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:53:57,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:53:57,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:53:57,291 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:53:57,291 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:53:57,337 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:53:57,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087705141] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:53:57,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:53:57,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-10 06:53:57,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380787589] [2025-01-10 06:53:57,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:53:57,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 06:53:57,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:53:57,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 06:53:57,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 06:53:57,354 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 84 [2025-01-10 06:53:57,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 80 transitions, 200 flow. Second operand has 12 states, 12 states have (on average 41.166666666666664) internal successors, (494), 12 states have internal predecessors, (494), 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:53:57,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:53:57,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 84 [2025-01-10 06:53:57,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:53:59,150 INFO L124 PetriNetUnfolderBase]: 17920/29121 cut-off events. [2025-01-10 06:53:59,150 INFO L125 PetriNetUnfolderBase]: For 226/226 co-relation queries the response was YES. [2025-01-10 06:53:59,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51955 conditions, 29121 events. 17920/29121 cut-off events. For 226/226 co-relation queries the response was YES. Maximal size of possible extension queue 1440. Compared 241912 event pairs, 12969 based on Foata normal form. 3/24959 useless extension candidates. Maximal degree in co-relation 51885. Up to 21849 conditions per place. [2025-01-10 06:53:59,467 INFO L140 encePairwiseOnDemand]: 79/84 looper letters, 40 selfloop transitions, 13 changer transitions 0/89 dead transitions. [2025-01-10 06:53:59,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 89 transitions, 360 flow [2025-01-10 06:53:59,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:53:59,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:53:59,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 456 transitions. [2025-01-10 06:53:59,471 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2025-01-10 06:53:59,471 INFO L175 Difference]: Start difference. First operand has 85 places, 80 transitions, 200 flow. Second operand 10 states and 456 transitions. [2025-01-10 06:53:59,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 89 transitions, 360 flow [2025-01-10 06:53:59,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 89 transitions, 314 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-01-10 06:53:59,477 INFO L231 Difference]: Finished difference. Result has 92 places, 89 transitions, 252 flow [2025-01-10 06:53:59,477 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=252, PETRI_PLACES=92, PETRI_TRANSITIONS=89} [2025-01-10 06:53:59,478 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 8 predicate places. [2025-01-10 06:53:59,478 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 89 transitions, 252 flow [2025-01-10 06:53:59,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 41.166666666666664) internal successors, (494), 12 states have internal predecessors, (494), 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:53:59,479 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:53:59,480 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:53:59,487 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:53:59,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:53:59,684 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-01-10 06:53:59,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:53:59,685 INFO L85 PathProgramCache]: Analyzing trace with hash 379623563, now seen corresponding path program 1 times [2025-01-10 06:53:59,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:53:59,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806479491] [2025-01-10 06:53:59,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:53:59,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:53:59,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:53:59,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:53:59,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:53:59,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:53:59,762 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:53:59,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:53:59,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806479491] [2025-01-10 06:53:59,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806479491] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:53:59,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:53:59,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:53:59,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981361172] [2025-01-10 06:53:59,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:53:59,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:53:59,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:53:59,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:53:59,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:53:59,765 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 84 [2025-01-10 06:53:59,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 89 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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:53:59,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:53:59,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 84 [2025-01-10 06:53:59,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:54:01,434 INFO L124 PetriNetUnfolderBase]: 17919/29120 cut-off events. [2025-01-10 06:54:01,434 INFO L125 PetriNetUnfolderBase]: For 238/238 co-relation queries the response was YES. [2025-01-10 06:54:01,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51952 conditions, 29120 events. 17919/29120 cut-off events. For 238/238 co-relation queries the response was YES. Maximal size of possible extension queue 1440. Compared 241878 event pairs, 12969 based on Foata normal form. 1/24959 useless extension candidates. Maximal degree in co-relation 51918. Up to 21853 conditions per place. [2025-01-10 06:54:01,617 INFO L140 encePairwiseOnDemand]: 81/84 looper letters, 49 selfloop transitions, 2 changer transitions 0/88 dead transitions. [2025-01-10 06:54:01,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 88 transitions, 350 flow [2025-01-10 06:54:01,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:54:01,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:54:01,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 169 transitions. [2025-01-10 06:54:01,619 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6706349206349206 [2025-01-10 06:54:01,619 INFO L175 Difference]: Start difference. First operand has 92 places, 89 transitions, 252 flow. Second operand 3 states and 169 transitions. [2025-01-10 06:54:01,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 88 transitions, 350 flow [2025-01-10 06:54:01,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 88 transitions, 340 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-01-10 06:54:01,622 INFO L231 Difference]: Finished difference. Result has 92 places, 88 transitions, 242 flow [2025-01-10 06:54:01,622 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=242, PETRI_PLACES=92, PETRI_TRANSITIONS=88} [2025-01-10 06:54:01,623 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 8 predicate places. [2025-01-10 06:54:01,623 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 88 transitions, 242 flow [2025-01-10 06:54:01,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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:54:01,623 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:54:01,624 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:54:01,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:54:01,624 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-01-10 06:54:01,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:54:01,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1435048973, now seen corresponding path program 1 times [2025-01-10 06:54:01,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:54:01,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873201074] [2025-01-10 06:54:01,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:54:01,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:54:01,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:54:01,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:54:01,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:54:01,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:54:02,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:54:02,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:54:02,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873201074] [2025-01-10 06:54:02,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873201074] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:54:02,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915914696] [2025-01-10 06:54:02,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:54:02,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:54:02,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:54:02,076 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:54:02,079 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:54:02,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:54:02,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:54:02,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:54:02,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:54:02,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-10 06:54:02,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:54:02,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 06:54:02,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:54:02,315 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:54:02,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2025-01-10 06:54:02,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-01-10 06:54:02,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:54:02,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915914696] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:54:02,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:54:02,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 12 [2025-01-10 06:54:02,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579563748] [2025-01-10 06:54:02,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:54:02,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 06:54:02,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:54:02,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 06:54:02,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-01-10 06:54:02,451 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 84 [2025-01-10 06:54:02,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 88 transitions, 242 flow. Second operand has 13 states, 13 states have (on average 44.38461538461539) internal successors, (577), 13 states have internal predecessors, (577), 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:54:02,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:54:02,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 84 [2025-01-10 06:54:02,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:54:05,157 INFO L124 PetriNetUnfolderBase]: 30027/46664 cut-off events. [2025-01-10 06:54:05,157 INFO L125 PetriNetUnfolderBase]: For 439/439 co-relation queries the response was YES. [2025-01-10 06:54:05,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85148 conditions, 46664 events. 30027/46664 cut-off events. For 439/439 co-relation queries the response was YES. Maximal size of possible extension queue 1964. Compared 383116 event pairs, 9415 based on Foata normal form. 0/41803 useless extension candidates. Maximal degree in co-relation 85125. Up to 15108 conditions per place. [2025-01-10 06:54:05,588 INFO L140 encePairwiseOnDemand]: 72/84 looper letters, 103 selfloop transitions, 15 changer transitions 0/155 dead transitions. [2025-01-10 06:54:05,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 155 transitions, 624 flow [2025-01-10 06:54:05,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 06:54:05,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 06:54:05,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 488 transitions. [2025-01-10 06:54:05,591 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6455026455026455 [2025-01-10 06:54:05,591 INFO L175 Difference]: Start difference. First operand has 92 places, 88 transitions, 242 flow. Second operand 9 states and 488 transitions. [2025-01-10 06:54:05,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 155 transitions, 624 flow [2025-01-10 06:54:05,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 155 transitions, 620 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:54:05,595 INFO L231 Difference]: Finished difference. Result has 101 places, 94 transitions, 309 flow [2025-01-10 06:54:05,595 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=309, PETRI_PLACES=101, PETRI_TRANSITIONS=94} [2025-01-10 06:54:05,596 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 17 predicate places. [2025-01-10 06:54:05,596 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 94 transitions, 309 flow [2025-01-10 06:54:05,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 44.38461538461539) internal successors, (577), 13 states have internal predecessors, (577), 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:54:05,597 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:54:05,597 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:54:05,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 06:54:05,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:54:05,798 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-01-10 06:54:05,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:54:05,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1435048972, now seen corresponding path program 1 times [2025-01-10 06:54:05,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:54:05,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413756172] [2025-01-10 06:54:05,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:54:05,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:54:05,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:54:05,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:54:05,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:54:05,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:54:05,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:54:05,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:54:05,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413756172] [2025-01-10 06:54:05,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413756172] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:54:05,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:54:05,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:54:05,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987181644] [2025-01-10 06:54:05,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:54:05,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:54:05,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:54:05,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:54:05,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:54:05,895 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 84 [2025-01-10 06:54:05,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 94 transitions, 309 flow. Second operand has 4 states, 4 states have (on average 45.5) internal successors, (182), 4 states have internal predecessors, (182), 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:54:05,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:54:05,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 84 [2025-01-10 06:54:05,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:54:08,322 INFO L124 PetriNetUnfolderBase]: 25927/39644 cut-off events. [2025-01-10 06:54:08,323 INFO L125 PetriNetUnfolderBase]: For 8732/8732 co-relation queries the response was YES. [2025-01-10 06:54:08,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82392 conditions, 39644 events. 25927/39644 cut-off events. For 8732/8732 co-relation queries the response was YES. Maximal size of possible extension queue 1645. Compared 312765 event pairs, 11461 based on Foata normal form. 0/36831 useless extension candidates. Maximal degree in co-relation 82356. Up to 19969 conditions per place. [2025-01-10 06:54:08,541 INFO L140 encePairwiseOnDemand]: 80/84 looper letters, 89 selfloop transitions, 6 changer transitions 0/132 dead transitions. [2025-01-10 06:54:08,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 132 transitions, 578 flow [2025-01-10 06:54:08,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:54:08,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:54:08,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 248 transitions. [2025-01-10 06:54:08,543 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7380952380952381 [2025-01-10 06:54:08,543 INFO L175 Difference]: Start difference. First operand has 101 places, 94 transitions, 309 flow. Second operand 4 states and 248 transitions. [2025-01-10 06:54:08,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 132 transitions, 578 flow [2025-01-10 06:54:08,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 132 transitions, 568 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 06:54:08,563 INFO L231 Difference]: Finished difference. Result has 99 places, 92 transitions, 302 flow [2025-01-10 06:54:08,563 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=302, PETRI_PLACES=99, PETRI_TRANSITIONS=92} [2025-01-10 06:54:08,564 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 15 predicate places. [2025-01-10 06:54:08,564 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 92 transitions, 302 flow [2025-01-10 06:54:08,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.5) internal successors, (182), 4 states have internal predecessors, (182), 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:54:08,564 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:54:08,564 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:54:08,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:54:08,565 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread4Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-01-10 06:54:08,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:54:08,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1481304433, now seen corresponding path program 1 times [2025-01-10 06:54:08,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:54:08,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141477301] [2025-01-10 06:54:08,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:54:08,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:54:08,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:54:08,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:54:08,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:54:08,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:54:08,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:54:08,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:54:08,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141477301] [2025-01-10 06:54:08,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141477301] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:54:08,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:54:08,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:54:08,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532037297] [2025-01-10 06:54:08,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:54:08,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:54:08,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:54:08,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:54:08,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:54:08,640 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 84 [2025-01-10 06:54:08,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 92 transitions, 302 flow. Second operand has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 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:54:08,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:54:08,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 84 [2025-01-10 06:54:08,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:54:12,918 INFO L124 PetriNetUnfolderBase]: 47172/78478 cut-off events. [2025-01-10 06:54:12,919 INFO L125 PetriNetUnfolderBase]: For 35500/35500 co-relation queries the response was YES. [2025-01-10 06:54:13,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161593 conditions, 78478 events. 47172/78478 cut-off events. For 35500/35500 co-relation queries the response was YES. Maximal size of possible extension queue 2945. Compared 732784 event pairs, 6511 based on Foata normal form. 1379/72552 useless extension candidates. Maximal degree in co-relation 161560. Up to 37128 conditions per place. [2025-01-10 06:54:13,587 INFO L140 encePairwiseOnDemand]: 79/84 looper letters, 136 selfloop transitions, 4 changer transitions 1/174 dead transitions. [2025-01-10 06:54:13,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 174 transitions, 900 flow [2025-01-10 06:54:13,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:54:13,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:54:13,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 304 transitions. [2025-01-10 06:54:13,589 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7238095238095238 [2025-01-10 06:54:13,589 INFO L175 Difference]: Start difference. First operand has 99 places, 92 transitions, 302 flow. Second operand 5 states and 304 transitions. [2025-01-10 06:54:13,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 174 transitions, 900 flow [2025-01-10 06:54:13,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 174 transitions, 852 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:54:13,612 INFO L231 Difference]: Finished difference. Result has 103 places, 94 transitions, 318 flow [2025-01-10 06:54:13,613 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=318, PETRI_PLACES=103, PETRI_TRANSITIONS=94} [2025-01-10 06:54:13,613 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 19 predicate places. [2025-01-10 06:54:13,613 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 94 transitions, 318 flow [2025-01-10 06:54:13,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 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:54:13,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:54:13,614 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1] [2025-01-10 06:54:13,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:54:13,614 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-01-10 06:54:13,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:54:13,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1052638566, now seen corresponding path program 2 times [2025-01-10 06:54:13,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:54:13,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309302588] [2025-01-10 06:54:13,615 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:54:13,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:54:13,625 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-01-10 06:54:13,630 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-01-10 06:54:13,630 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:54:13,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:54:13,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:54:13,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:54:13,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309302588] [2025-01-10 06:54:13,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309302588] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:54:13,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820622393] [2025-01-10 06:54:13,676 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:54:13,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:54:13,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:54:13,679 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:54:13,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 06:54:13,733 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-01-10 06:54:13,742 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-01-10 06:54:13,743 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:54:13,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:54:13,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 06:54:13,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:54:13,779 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:54:13,779 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:54:13,824 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:54:13,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820622393] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:54:13,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:54:13,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2025-01-10 06:54:13,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629322477] [2025-01-10 06:54:13,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:54:13,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:54:13,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:54:13,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:54:13,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:54:13,850 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 84 [2025-01-10 06:54:13,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 94 transitions, 318 flow. Second operand has 6 states, 6 states have (on average 40.166666666666664) internal successors, (241), 6 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:54:13,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:54:13,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 84 [2025-01-10 06:54:13,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:54:18,101 INFO L124 PetriNetUnfolderBase]: 39347/62392 cut-off events. [2025-01-10 06:54:18,101 INFO L125 PetriNetUnfolderBase]: For 18966/18982 co-relation queries the response was YES. [2025-01-10 06:54:18,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128882 conditions, 62392 events. 39347/62392 cut-off events. For 18966/18982 co-relation queries the response was YES. Maximal size of possible extension queue 2628. Compared 546955 event pairs, 28247 based on Foata normal form. 17/57680 useless extension candidates. Maximal degree in co-relation 128849. Up to 48424 conditions per place. [2025-01-10 06:54:18,525 INFO L140 encePairwiseOnDemand]: 78/84 looper letters, 41 selfloop transitions, 16 changer transitions 0/93 dead transitions. [2025-01-10 06:54:18,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 93 transitions, 422 flow [2025-01-10 06:54:18,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:54:18,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:54:18,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 275 transitions. [2025-01-10 06:54:18,527 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5456349206349206 [2025-01-10 06:54:18,527 INFO L175 Difference]: Start difference. First operand has 103 places, 94 transitions, 318 flow. Second operand 6 states and 275 transitions. [2025-01-10 06:54:18,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 93 transitions, 422 flow [2025-01-10 06:54:18,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 93 transitions, 410 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-01-10 06:54:18,562 INFO L231 Difference]: Finished difference. Result has 102 places, 93 transitions, 328 flow [2025-01-10 06:54:18,562 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=328, PETRI_PLACES=102, PETRI_TRANSITIONS=93} [2025-01-10 06:54:18,563 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 18 predicate places. [2025-01-10 06:54:18,563 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 93 transitions, 328 flow [2025-01-10 06:54:18,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.166666666666664) internal successors, (241), 6 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:54:18,563 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:54:18,564 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:54:18,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 06:54:18,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-01-10 06:54:18,764 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-01-10 06:54:18,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:54:18,765 INFO L85 PathProgramCache]: Analyzing trace with hash -397541226, now seen corresponding path program 1 times [2025-01-10 06:54:18,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:54:18,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961534502] [2025-01-10 06:54:18,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:54:18,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:54:18,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 06:54:18,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 06:54:18,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:54:18,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:54:18,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:54:18,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:54:18,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961534502] [2025-01-10 06:54:18,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961534502] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:54:18,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:54:18,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:54:18,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392010260] [2025-01-10 06:54:18,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:54:18,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:54:18,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:54:18,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:54:18,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:54:18,822 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 84 [2025-01-10 06:54:18,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 93 transitions, 328 flow. Second operand has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 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:54:18,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:54:18,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 84 [2025-01-10 06:54:18,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:54:22,705 INFO L124 PetriNetUnfolderBase]: 45564/68740 cut-off events. [2025-01-10 06:54:22,705 INFO L125 PetriNetUnfolderBase]: For 20314/20330 co-relation queries the response was YES. [2025-01-10 06:54:22,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143434 conditions, 68740 events. 45564/68740 cut-off events. For 20314/20330 co-relation queries the response was YES. Maximal size of possible extension queue 2791. Compared 572382 event pairs, 19214 based on Foata normal form. 1606/66710 useless extension candidates. Maximal degree in co-relation 143347. Up to 37484 conditions per place. [2025-01-10 06:54:23,388 INFO L140 encePairwiseOnDemand]: 78/84 looper letters, 97 selfloop transitions, 4 changer transitions 0/136 dead transitions. [2025-01-10 06:54:23,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 136 transitions, 636 flow [2025-01-10 06:54:23,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:54:23,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:54:23,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 249 transitions. [2025-01-10 06:54:23,390 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7410714285714286 [2025-01-10 06:54:23,390 INFO L175 Difference]: Start difference. First operand has 102 places, 93 transitions, 328 flow. Second operand 4 states and 249 transitions. [2025-01-10 06:54:23,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 136 transitions, 636 flow [2025-01-10 06:54:23,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 136 transitions, 608 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 06:54:23,428 INFO L231 Difference]: Finished difference. Result has 103 places, 94 transitions, 321 flow [2025-01-10 06:54:23,428 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=321, PETRI_PLACES=103, PETRI_TRANSITIONS=94} [2025-01-10 06:54:23,429 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 19 predicate places. [2025-01-10 06:54:23,429 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 94 transitions, 321 flow [2025-01-10 06:54:23,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 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:54:23,429 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:54:23,429 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:54:23,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 06:54:23,430 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-01-10 06:54:23,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:54:23,430 INFO L85 PathProgramCache]: Analyzing trace with hash 943862539, now seen corresponding path program 1 times [2025-01-10 06:54:23,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:54:23,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117054430] [2025-01-10 06:54:23,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:54:23,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:54:23,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 06:54:23,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 06:54:23,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:54:23,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:54:23,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:54:23,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:54:23,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117054430] [2025-01-10 06:54:23,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117054430] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:54:23,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:54:23,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:54:23,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285674498] [2025-01-10 06:54:23,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:54:23,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:54:23,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:54:23,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:54:23,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:54:23,502 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 84 [2025-01-10 06:54:23,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 94 transitions, 321 flow. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:54:23,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:54:23,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 84 [2025-01-10 06:54:23,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:54:30,136 INFO L124 PetriNetUnfolderBase]: 72100/108464 cut-off events. [2025-01-10 06:54:30,136 INFO L125 PetriNetUnfolderBase]: For 59251/59271 co-relation queries the response was YES. [2025-01-10 06:54:30,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241263 conditions, 108464 events. 72100/108464 cut-off events. For 59251/59271 co-relation queries the response was YES. Maximal size of possible extension queue 3419. Compared 904922 event pairs, 36724 based on Foata normal form. 1414/103593 useless extension candidates. Maximal degree in co-relation 241186. Up to 61703 conditions per place. [2025-01-10 06:54:31,116 INFO L140 encePairwiseOnDemand]: 78/84 looper letters, 123 selfloop transitions, 4 changer transitions 0/161 dead transitions. [2025-01-10 06:54:31,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 161 transitions, 831 flow [2025-01-10 06:54:31,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:54:31,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:54:31,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 253 transitions. [2025-01-10 06:54:31,117 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7529761904761905 [2025-01-10 06:54:31,118 INFO L175 Difference]: Start difference. First operand has 103 places, 94 transitions, 321 flow. Second operand 4 states and 253 transitions. [2025-01-10 06:54:31,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 161 transitions, 831 flow [2025-01-10 06:54:31,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 161 transitions, 822 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:54:31,189 INFO L231 Difference]: Finished difference. Result has 107 places, 97 transitions, 347 flow [2025-01-10 06:54:31,189 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=347, PETRI_PLACES=107, PETRI_TRANSITIONS=97} [2025-01-10 06:54:31,189 INFO L279 CegarLoopForPetriNet]: 84 programPoint places, 23 predicate places. [2025-01-10 06:54:31,190 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 97 transitions, 347 flow [2025-01-10 06:54:31,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:54:31,190 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:54:31,190 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:54:31,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:54:31,190 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread4Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-01-10 06:54:31,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:54:31,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1451558119, now seen corresponding path program 1 times [2025-01-10 06:54:31,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:54:31,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154998655] [2025-01-10 06:54:31,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:54:31,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:54:31,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 06:54:31,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 06:54:31,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:54:31,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:54:31,552 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:54:31,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:54:31,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154998655] [2025-01-10 06:54:31,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154998655] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:54:31,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:54:31,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:54:31,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453790318] [2025-01-10 06:54:31,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:54:31,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:54:31,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:54:31,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:54:31,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:54:31,559 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 84 [2025-01-10 06:54:31,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 97 transitions, 347 flow. Second operand has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 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:54:31,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:54:31,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 84 [2025-01-10 06:54:31,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:54:38,829 INFO L124 PetriNetUnfolderBase]: 72613/116553 cut-off events. [2025-01-10 06:54:38,829 INFO L125 PetriNetUnfolderBase]: For 77058/82474 co-relation queries the response was YES. [2025-01-10 06:54:39,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 271464 conditions, 116553 events. 72613/116553 cut-off events. For 77058/82474 co-relation queries the response was YES. Maximal size of possible extension queue 3546. Compared 1062887 event pairs, 8292 based on Foata normal form. 1882/111644 useless extension candidates. Maximal degree in co-relation 271385. Up to 50061 conditions per place. [2025-01-10 06:54:39,664 INFO L140 encePairwiseOnDemand]: 78/84 looper letters, 147 selfloop transitions, 8 changer transitions 1/190 dead transitions. [2025-01-10 06:54:39,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 190 transitions, 1047 flow [2025-01-10 06:54:39,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:54:39,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:54:39,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 305 transitions. [2025-01-10 06:54:39,665 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7261904761904762 [2025-01-10 06:54:39,665 INFO L175 Difference]: Start difference. First operand has 107 places, 97 transitions, 347 flow. Second operand 5 states and 305 transitions. [2025-01-10 06:54:39,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 190 transitions, 1047 flow