./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/popl20-bad-dot-product.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-bad-dot-product.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 39e90898aa78f5642c5c7d6f9df6b2e15e069a046a9465d5d61576c4b07f46b8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:27:41,978 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:27:42,023 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:27:42,030 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:27:42,030 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:27:42,054 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:27:42,055 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:27:42,055 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:27:42,055 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:27:42,056 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:27:42,056 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:27:42,056 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:27:42,057 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:27:42,057 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:27:42,057 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:27:42,058 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:27:42,058 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:27:42,058 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:27:42,058 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:27:42,058 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:27:42,058 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:27:42,058 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:27:42,058 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:27:42,058 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:27:42,058 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:27:42,058 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:27:42,058 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:27:42,059 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:27:42,059 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:27:42,059 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:27:42,059 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:27:42,059 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:27:42,059 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:27:42,059 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:27:42,059 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:27:42,060 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:27:42,060 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:27:42,060 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:27:42,060 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:27:42,060 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:27:42,060 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:27:42,060 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:27:42,060 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:27:42,060 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:27:42,060 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:27:42,061 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/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 -> 39e90898aa78f5642c5c7d6f9df6b2e15e069a046a9465d5d61576c4b07f46b8 [2025-03-04 15:27:42,308 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:27:42,316 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:27:42,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:27:42,319 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:27:42,319 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:27:42,320 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-dot-product.wvr.c [2025-03-04 15:27:43,475 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d88544bd/56e2b5e228f249f586a5b25638fdb14a/FLAG222b2d181 [2025-03-04 15:27:43,751 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:27:43,752 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-dot-product.wvr.c [2025-03-04 15:27:43,759 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d88544bd/56e2b5e228f249f586a5b25638fdb14a/FLAG222b2d181 [2025-03-04 15:27:44,049 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d88544bd/56e2b5e228f249f586a5b25638fdb14a [2025-03-04 15:27:44,051 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:27:44,052 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:27:44,052 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:27:44,052 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:27:44,055 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:27:44,056 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:27:44" (1/1) ... [2025-03-04 15:27:44,056 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6679cd7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:44, skipping insertion in model container [2025-03-04 15:27:44,056 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:27:44" (1/1) ... [2025-03-04 15:27:44,067 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:27:44,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:27:44,200 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:27:44,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:27:44,238 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:27:44,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:44 WrapperNode [2025-03-04 15:27:44,239 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:27:44,239 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:27:44,239 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:27:44,240 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:27:44,243 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:44" (1/1) ... [2025-03-04 15:27:44,248 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:44" (1/1) ... [2025-03-04 15:27:44,269 INFO L138 Inliner]: procedures = 25, calls = 41, calls flagged for inlining = 17, calls inlined = 23, statements flattened = 314 [2025-03-04 15:27:44,269 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:27:44,269 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:27:44,269 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:27:44,269 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:27:44,275 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:44" (1/1) ... [2025-03-04 15:27:44,275 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:44" (1/1) ... [2025-03-04 15:27:44,278 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:44" (1/1) ... [2025-03-04 15:27:44,292 INFO L175 MemorySlicer]: Split 13 memory accesses to 2 slices as follows [2, 11]. 85 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-03-04 15:27:44,292 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:44" (1/1) ... [2025-03-04 15:27:44,292 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:44" (1/1) ... [2025-03-04 15:27:44,297 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:44" (1/1) ... [2025-03-04 15:27:44,298 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:44" (1/1) ... [2025-03-04 15:27:44,299 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:44" (1/1) ... [2025-03-04 15:27:44,300 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:44" (1/1) ... [2025-03-04 15:27:44,304 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:27:44,305 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:27:44,305 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:27:44,305 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:27:44,306 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:44" (1/1) ... [2025-03-04 15:27:44,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:27:44,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:27:44,329 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 15:27:44,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 15:27:44,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:27:44,346 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 15:27:44,346 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 15:27:44,346 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 15:27:44,346 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 15:27:44,346 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 15:27:44,346 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 15:27:44,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:27:44,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:27:44,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:27:44,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:27:44,346 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 15:27:44,346 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 15:27:44,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 15:27:44,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:27:44,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:27:44,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:27:44,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:27:44,347 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 15:27:44,421 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:27:44,422 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:27:44,803 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:27:44,803 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:27:45,053 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:27:45,053 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:27:45,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:27:45 BoogieIcfgContainer [2025-03-04 15:27:45,053 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:27:45,055 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:27:45,055 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:27:45,058 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:27:45,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:27:44" (1/3) ... [2025-03-04 15:27:45,058 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4acfb9e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:27:45, skipping insertion in model container [2025-03-04 15:27:45,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:44" (2/3) ... [2025-03-04 15:27:45,058 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4acfb9e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:27:45, skipping insertion in model container [2025-03-04 15:27:45,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:27:45" (3/3) ... [2025-03-04 15:27:45,059 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-dot-product.wvr.c [2025-03-04 15:27:45,070 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:27:45,071 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-dot-product.wvr.c that has 4 procedures, 88 locations, 1 initial locations, 8 loop locations, and 34 error locations. [2025-03-04 15:27:45,071 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:27:45,187 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 15:27:45,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 98 transitions, 217 flow [2025-03-04 15:27:45,242 INFO L124 PetriNetUnfolderBase]: 11/95 cut-off events. [2025-03-04 15:27:45,243 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 15:27:45,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 95 events. 11/95 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 378 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2025-03-04 15:27:45,250 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 98 transitions, 217 flow [2025-03-04 15:27:45,253 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 93 transitions, 201 flow [2025-03-04 15:27:45,260 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:27:45,271 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;@1bff08cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:27:45,271 INFO L334 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2025-03-04 15:27:45,274 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:27:45,274 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-04 15:27:45,274 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:27:45,274 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:45,274 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 15:27:45,275 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 64 more)] === [2025-03-04 15:27:45,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:45,278 INFO L85 PathProgramCache]: Analyzing trace with hash 933901, now seen corresponding path program 1 times [2025-03-04 15:27:45,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:45,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280624539] [2025-03-04 15:27:45,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:45,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:45,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:27:45,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:27:45,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:45,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:45,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:45,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:45,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280624539] [2025-03-04 15:27:45,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280624539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:45,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:45,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:27:45,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734225537] [2025-03-04 15:27:45,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:45,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:27:45,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:45,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:27:45,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:27:45,516 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 98 [2025-03-04 15:27:45,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 93 transitions, 201 flow. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 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-03-04 15:27:45,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:45,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 98 [2025-03-04 15:27:45,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:47,095 INFO L124 PetriNetUnfolderBase]: 10484/18005 cut-off events. [2025-03-04 15:27:47,096 INFO L125 PetriNetUnfolderBase]: For 580/580 co-relation queries the response was YES. [2025-03-04 15:27:47,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32901 conditions, 18005 events. 10484/18005 cut-off events. For 580/580 co-relation queries the response was YES. Maximal size of possible extension queue 1116. Compared 145776 event pairs, 8602 based on Foata normal form. 941/12064 useless extension candidates. Maximal degree in co-relation 31652. Up to 14417 conditions per place. [2025-03-04 15:27:47,224 INFO L140 encePairwiseOnDemand]: 78/98 looper letters, 57 selfloop transitions, 7 changer transitions 0/90 dead transitions. [2025-03-04 15:27:47,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 90 transitions, 323 flow [2025-03-04 15:27:47,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:27:47,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:27:47,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 193 transitions. [2025-03-04 15:27:47,234 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4923469387755102 [2025-03-04 15:27:47,238 INFO L175 Difference]: Start difference. First operand has 92 places, 93 transitions, 201 flow. Second operand 4 states and 193 transitions. [2025-03-04 15:27:47,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 90 transitions, 323 flow [2025-03-04 15:27:47,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 90 transitions, 314 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 15:27:47,259 INFO L231 Difference]: Finished difference. Result has 87 places, 90 transitions, 234 flow [2025-03-04 15:27:47,260 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=234, PETRI_PLACES=87, PETRI_TRANSITIONS=90} [2025-03-04 15:27:47,264 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, -5 predicate places. [2025-03-04 15:27:47,265 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 90 transitions, 234 flow [2025-03-04 15:27:47,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 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-03-04 15:27:47,265 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:47,265 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 15:27:47,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:27:47,266 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 64 more)] === [2025-03-04 15:27:47,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:47,266 INFO L85 PathProgramCache]: Analyzing trace with hash 2052841237, now seen corresponding path program 1 times [2025-03-04 15:27:47,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:47,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642325614] [2025-03-04 15:27:47,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:47,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:47,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:27:47,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:27:47,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:47,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:47,372 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:47,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:47,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642325614] [2025-03-04 15:27:47,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642325614] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:27:47,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618075455] [2025-03-04 15:27:47,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:47,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:27:47,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:27:47,375 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:27:47,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 15:27:47,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:27:47,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:27:47,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:47,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:47,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:27:47,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:27:47,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:47,485 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:27:47,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618075455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:47,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:27:47,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 15:27:47,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581962031] [2025-03-04 15:27:47,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:47,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:27:47,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:47,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:27:47,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:27:47,502 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 98 [2025-03-04 15:27:47,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 90 transitions, 234 flow. Second operand has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 states have internal predecessors, (179), 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-03-04 15:27:47,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:47,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 98 [2025-03-04 15:27:47,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:48,720 INFO L124 PetriNetUnfolderBase]: 10484/18003 cut-off events. [2025-03-04 15:27:48,721 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2025-03-04 15:27:48,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32750 conditions, 18003 events. 10484/18003 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 1119. Compared 145684 event pairs, 8602 based on Foata normal form. 2/11126 useless extension candidates. Maximal degree in co-relation 32700. Up to 14407 conditions per place. [2025-03-04 15:27:48,807 INFO L140 encePairwiseOnDemand]: 89/98 looper letters, 50 selfloop transitions, 12 changer transitions 0/88 dead transitions. [2025-03-04 15:27:48,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 88 transitions, 350 flow [2025-03-04 15:27:48,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:27:48,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:27:48,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 238 transitions. [2025-03-04 15:27:48,811 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2025-03-04 15:27:48,812 INFO L175 Difference]: Start difference. First operand has 87 places, 90 transitions, 234 flow. Second operand 6 states and 238 transitions. [2025-03-04 15:27:48,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 88 transitions, 350 flow [2025-03-04 15:27:48,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 88 transitions, 350 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:27:48,814 INFO L231 Difference]: Finished difference. Result has 90 places, 88 transitions, 250 flow [2025-03-04 15:27:48,814 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=250, PETRI_PLACES=90, PETRI_TRANSITIONS=88} [2025-03-04 15:27:48,816 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, -2 predicate places. [2025-03-04 15:27:48,816 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 88 transitions, 250 flow [2025-03-04 15:27:48,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 states have internal predecessors, (179), 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-03-04 15:27:48,816 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:48,816 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-04 15:27:48,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 15:27:49,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:27:49,021 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 64 more)] === [2025-03-04 15:27:49,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:49,022 INFO L85 PathProgramCache]: Analyzing trace with hash -786430291, now seen corresponding path program 1 times [2025-03-04 15:27:49,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:49,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604772454] [2025-03-04 15:27:49,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:49,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:49,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:27:49,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:27:49,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:49,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:49,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:49,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:49,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604772454] [2025-03-04 15:27:49,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604772454] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:27:49,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317410768] [2025-03-04 15:27:49,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:49,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:27:49,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:27:49,205 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:27:49,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 15:27:49,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:27:49,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:27:49,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:49,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:49,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:27:49,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:27:49,305 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:49,305 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:27:49,336 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:49,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317410768] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:27:49,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:27:49,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-04 15:27:49,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403174737] [2025-03-04 15:27:49,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:27:49,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 15:27:49,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:49,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:27:49,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:27:49,369 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 98 [2025-03-04 15:27:49,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 88 transitions, 250 flow. Second operand has 12 states, 12 states have (on average 30.083333333333332) internal successors, (361), 12 states have internal predecessors, (361), 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-03-04 15:27:49,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:49,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 98 [2025-03-04 15:27:49,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:50,717 INFO L124 PetriNetUnfolderBase]: 10490/18027 cut-off events. [2025-03-04 15:27:50,717 INFO L125 PetriNetUnfolderBase]: For 189/189 co-relation queries the response was YES. [2025-03-04 15:27:50,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32844 conditions, 18027 events. 10490/18027 cut-off events. For 189/189 co-relation queries the response was YES. Maximal size of possible extension queue 1119. Compared 146046 event pairs, 8602 based on Foata normal form. 6/11153 useless extension candidates. Maximal degree in co-relation 32702. Up to 14418 conditions per place. [2025-03-04 15:27:50,797 INFO L140 encePairwiseOnDemand]: 89/98 looper letters, 55 selfloop transitions, 25 changer transitions 0/106 dead transitions. [2025-03-04 15:27:50,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 106 transitions, 524 flow [2025-03-04 15:27:50,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:27:50,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:27:50,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 376 transitions. [2025-03-04 15:27:50,800 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3836734693877551 [2025-03-04 15:27:50,800 INFO L175 Difference]: Start difference. First operand has 90 places, 88 transitions, 250 flow. Second operand 10 states and 376 transitions. [2025-03-04 15:27:50,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 106 transitions, 524 flow [2025-03-04 15:27:50,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 106 transitions, 466 flow, removed 12 selfloop flow, removed 5 redundant places. [2025-03-04 15:27:50,802 INFO L231 Difference]: Finished difference. Result has 97 places, 106 transitions, 390 flow [2025-03-04 15:27:50,802 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=390, PETRI_PLACES=97, PETRI_TRANSITIONS=106} [2025-03-04 15:27:50,803 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, 5 predicate places. [2025-03-04 15:27:50,803 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 106 transitions, 390 flow [2025-03-04 15:27:50,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 30.083333333333332) internal successors, (361), 12 states have internal predecessors, (361), 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-03-04 15:27:50,803 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:50,803 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:50,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 15:27:51,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-04 15:27:51,008 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 64 more)] === [2025-03-04 15:27:51,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:51,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1811038127, now seen corresponding path program 1 times [2025-03-04 15:27:51,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:51,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526393381] [2025-03-04 15:27:51,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:51,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:51,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:27:51,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:27:51,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:51,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:51,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:51,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:51,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526393381] [2025-03-04 15:27:51,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526393381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:51,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:51,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:27:51,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079878494] [2025-03-04 15:27:51,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:51,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:27:51,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:51,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:27:51,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:27:51,127 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 98 [2025-03-04 15:27:51,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 106 transitions, 390 flow. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 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-03-04 15:27:51,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:51,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 98 [2025-03-04 15:27:51,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:51,979 INFO L124 PetriNetUnfolderBase]: 10490/18043 cut-off events. [2025-03-04 15:27:51,979 INFO L125 PetriNetUnfolderBase]: For 250/250 co-relation queries the response was YES. [2025-03-04 15:27:52,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32913 conditions, 18043 events. 10490/18043 cut-off events. For 250/250 co-relation queries the response was YES. Maximal size of possible extension queue 1119. Compared 146037 event pairs, 8602 based on Foata normal form. 4/11169 useless extension candidates. Maximal degree in co-relation 32820. Up to 14433 conditions per place. [2025-03-04 15:27:52,065 INFO L140 encePairwiseOnDemand]: 93/98 looper letters, 84 selfloop transitions, 4 changer transitions 0/116 dead transitions. [2025-03-04 15:27:52,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 116 transitions, 643 flow [2025-03-04 15:27:52,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:27:52,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:27:52,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 228 transitions. [2025-03-04 15:27:52,068 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46530612244897956 [2025-03-04 15:27:52,068 INFO L175 Difference]: Start difference. First operand has 97 places, 106 transitions, 390 flow. Second operand 5 states and 228 transitions. [2025-03-04 15:27:52,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 116 transitions, 643 flow [2025-03-04 15:27:52,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 116 transitions, 610 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-03-04 15:27:52,071 INFO L231 Difference]: Finished difference. Result has 101 places, 107 transitions, 396 flow [2025-03-04 15:27:52,071 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=396, PETRI_PLACES=101, PETRI_TRANSITIONS=107} [2025-03-04 15:27:52,072 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, 9 predicate places. [2025-03-04 15:27:52,072 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 107 transitions, 396 flow [2025-03-04 15:27:52,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 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-03-04 15:27:52,072 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:52,072 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:52,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:27:52,073 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 64 more)] === [2025-03-04 15:27:52,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:52,073 INFO L85 PathProgramCache]: Analyzing trace with hash -562136903, now seen corresponding path program 1 times [2025-03-04 15:27:52,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:52,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161122239] [2025-03-04 15:27:52,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:52,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:52,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:27:52,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:27:52,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:52,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:52,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:27:52,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:52,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161122239] [2025-03-04 15:27:52,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161122239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:52,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:52,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:27:52,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369023934] [2025-03-04 15:27:52,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:52,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:27:52,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:52,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:27:52,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:27:52,229 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 98 [2025-03-04 15:27:52,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 107 transitions, 396 flow. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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-03-04 15:27:52,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:52,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 98 [2025-03-04 15:27:52,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:53,824 INFO L124 PetriNetUnfolderBase]: 17689/29508 cut-off events. [2025-03-04 15:27:53,825 INFO L125 PetriNetUnfolderBase]: For 224/224 co-relation queries the response was YES. [2025-03-04 15:27:53,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54442 conditions, 29508 events. 17689/29508 cut-off events. For 224/224 co-relation queries the response was YES. Maximal size of possible extension queue 1220. Compared 236790 event pairs, 6442 based on Foata normal form. 0/18538 useless extension candidates. Maximal degree in co-relation 54364. Up to 13584 conditions per place. [2025-03-04 15:27:53,971 INFO L140 encePairwiseOnDemand]: 94/98 looper letters, 119 selfloop transitions, 2 changer transitions 0/149 dead transitions. [2025-03-04 15:27:53,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 149 transitions, 727 flow [2025-03-04 15:27:53,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:27:53,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:27:53,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 197 transitions. [2025-03-04 15:27:53,973 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6700680272108843 [2025-03-04 15:27:53,973 INFO L175 Difference]: Start difference. First operand has 101 places, 107 transitions, 396 flow. Second operand 3 states and 197 transitions. [2025-03-04 15:27:53,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 149 transitions, 727 flow [2025-03-04 15:27:53,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 149 transitions, 723 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 15:27:53,976 INFO L231 Difference]: Finished difference. Result has 103 places, 108 transitions, 406 flow [2025-03-04 15:27:53,976 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=406, PETRI_PLACES=103, PETRI_TRANSITIONS=108} [2025-03-04 15:27:53,976 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, 11 predicate places. [2025-03-04 15:27:53,977 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 108 transitions, 406 flow [2025-03-04 15:27:53,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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-03-04 15:27:53,977 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:53,977 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:53,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:27:53,977 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 64 more)] === [2025-03-04 15:27:53,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:53,978 INFO L85 PathProgramCache]: Analyzing trace with hash -562136906, now seen corresponding path program 1 times [2025-03-04 15:27:53,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:53,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456923429] [2025-03-04 15:27:53,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:53,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:53,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:27:53,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:27:53,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:53,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:54,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:27:54,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:54,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456923429] [2025-03-04 15:27:54,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456923429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:54,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:54,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 15:27:54,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047355997] [2025-03-04 15:27:54,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:54,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:27:54,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:54,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:27:54,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:27:54,132 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 98 [2025-03-04 15:27:54,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 108 transitions, 406 flow. Second operand has 6 states, 6 states have (on average 33.833333333333336) internal successors, (203), 6 states have internal predecessors, (203), 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-03-04 15:27:54,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:54,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 98 [2025-03-04 15:27:54,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:56,817 INFO L124 PetriNetUnfolderBase]: 25394/42181 cut-off events. [2025-03-04 15:27:56,817 INFO L125 PetriNetUnfolderBase]: For 1102/1102 co-relation queries the response was YES. [2025-03-04 15:27:56,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79599 conditions, 42181 events. 25394/42181 cut-off events. For 1102/1102 co-relation queries the response was YES. Maximal size of possible extension queue 1454. Compared 344545 event pairs, 18919 based on Foata normal form. 0/27768 useless extension candidates. Maximal degree in co-relation 79505. Up to 26573 conditions per place. [2025-03-04 15:27:57,009 INFO L140 encePairwiseOnDemand]: 90/98 looper letters, 172 selfloop transitions, 12 changer transitions 0/211 dead transitions. [2025-03-04 15:27:57,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 211 transitions, 992 flow [2025-03-04 15:27:57,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:27:57,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:27:57,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 354 transitions. [2025-03-04 15:27:57,013 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6020408163265306 [2025-03-04 15:27:57,013 INFO L175 Difference]: Start difference. First operand has 103 places, 108 transitions, 406 flow. Second operand 6 states and 354 transitions. [2025-03-04 15:27:57,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 211 transitions, 992 flow [2025-03-04 15:27:57,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 211 transitions, 981 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:27:57,016 INFO L231 Difference]: Finished difference. Result has 109 places, 112 transitions, 446 flow [2025-03-04 15:27:57,016 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=446, PETRI_PLACES=109, PETRI_TRANSITIONS=112} [2025-03-04 15:27:57,017 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, 17 predicate places. [2025-03-04 15:27:57,017 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 112 transitions, 446 flow [2025-03-04 15:27:57,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 33.833333333333336) internal successors, (203), 6 states have internal predecessors, (203), 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-03-04 15:27:57,017 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:57,017 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:57,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:27:57,017 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 64 more)] === [2025-03-04 15:27:57,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:57,018 INFO L85 PathProgramCache]: Analyzing trace with hash -246373061, now seen corresponding path program 1 times [2025-03-04 15:27:57,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:57,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106188811] [2025-03-04 15:27:57,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:57,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:57,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:27:57,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:27:57,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:57,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:57,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:27:57,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:57,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106188811] [2025-03-04 15:27:57,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106188811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:57,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:57,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:27:57,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551789042] [2025-03-04 15:27:57,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:57,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:27:57,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:57,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:27:57,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:27:57,069 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 98 [2025-03-04 15:27:57,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 112 transitions, 446 flow. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 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-03-04 15:27:57,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:57,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 98 [2025-03-04 15:27:57,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:02,015 INFO L124 PetriNetUnfolderBase]: 45510/71215 cut-off events. [2025-03-04 15:28:02,015 INFO L125 PetriNetUnfolderBase]: For 4439/4583 co-relation queries the response was YES. [2025-03-04 15:28:02,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148196 conditions, 71215 events. 45510/71215 cut-off events. For 4439/4583 co-relation queries the response was YES. Maximal size of possible extension queue 1953. Compared 567660 event pairs, 23239 based on Foata normal form. 1086/49742 useless extension candidates. Maximal degree in co-relation 148099. Up to 39345 conditions per place. [2025-03-04 15:28:02,433 INFO L140 encePairwiseOnDemand]: 92/98 looper letters, 158 selfloop transitions, 5 changer transitions 0/190 dead transitions. [2025-03-04 15:28:02,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 190 transitions, 962 flow [2025-03-04 15:28:02,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:28:02,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:28:02,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 256 transitions. [2025-03-04 15:28:02,434 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6530612244897959 [2025-03-04 15:28:02,435 INFO L175 Difference]: Start difference. First operand has 109 places, 112 transitions, 446 flow. Second operand 4 states and 256 transitions. [2025-03-04 15:28:02,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 190 transitions, 962 flow [2025-03-04 15:28:02,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 190 transitions, 955 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:28:02,483 INFO L231 Difference]: Finished difference. Result has 113 places, 116 transitions, 482 flow [2025-03-04 15:28:02,483 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=482, PETRI_PLACES=113, PETRI_TRANSITIONS=116} [2025-03-04 15:28:02,484 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, 21 predicate places. [2025-03-04 15:28:02,484 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 116 transitions, 482 flow [2025-03-04 15:28:02,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 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-03-04 15:28:02,484 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:02,484 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:28:02,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:28:02,485 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 64 more)] === [2025-03-04 15:28:02,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:02,485 INFO L85 PathProgramCache]: Analyzing trace with hash -85114605, now seen corresponding path program 1 times [2025-03-04 15:28:02,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:02,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897734972] [2025-03-04 15:28:02,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:02,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:02,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:28:02,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:28:02,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:02,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:02,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:28:02,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:02,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897734972] [2025-03-04 15:28:02,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897734972] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:28:02,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821963880] [2025-03-04 15:28:02,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:02,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:02,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:28:02,604 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:28:02,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 15:28:02,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:28:02,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:28:02,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:02,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:02,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 15:28:02,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:28:02,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:28:02,745 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:28:02,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:28:02,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821963880] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:28:02,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:28:02,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-03-04 15:28:02,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569110208] [2025-03-04 15:28:02,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:28:02,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 15:28:02,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:02,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 15:28:02,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2025-03-04 15:28:02,866 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 98 [2025-03-04 15:28:02,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 116 transitions, 482 flow. Second operand has 17 states, 17 states have (on average 30.647058823529413) internal successors, (521), 17 states have internal predecessors, (521), 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-03-04 15:28:02,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:02,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 98 [2025-03-04 15:28:02,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:08,970 INFO L124 PetriNetUnfolderBase]: 49307/84448 cut-off events. [2025-03-04 15:28:08,971 INFO L125 PetriNetUnfolderBase]: For 26463/27314 co-relation queries the response was YES. [2025-03-04 15:28:09,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181510 conditions, 84448 events. 49307/84448 cut-off events. For 26463/27314 co-relation queries the response was YES. Maximal size of possible extension queue 2571. Compared 786106 event pairs, 37550 based on Foata normal form. 755/60259 useless extension candidates. Maximal degree in co-relation 181378. Up to 55511 conditions per place. [2025-03-04 15:28:09,521 INFO L140 encePairwiseOnDemand]: 88/98 looper letters, 149 selfloop transitions, 41 changer transitions 0/217 dead transitions. [2025-03-04 15:28:09,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 217 transitions, 1289 flow [2025-03-04 15:28:09,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 15:28:09,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 15:28:09,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 516 transitions. [2025-03-04 15:28:09,523 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4050235478806907 [2025-03-04 15:28:09,523 INFO L175 Difference]: Start difference. First operand has 113 places, 116 transitions, 482 flow. Second operand 13 states and 516 transitions. [2025-03-04 15:28:09,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 217 transitions, 1289 flow [2025-03-04 15:28:09,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 217 transitions, 1280 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:28:09,582 INFO L231 Difference]: Finished difference. Result has 128 places, 136 transitions, 745 flow [2025-03-04 15:28:09,582 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=479, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=745, PETRI_PLACES=128, PETRI_TRANSITIONS=136} [2025-03-04 15:28:09,583 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, 36 predicate places. [2025-03-04 15:28:09,583 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 136 transitions, 745 flow [2025-03-04 15:28:09,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 30.647058823529413) internal successors, (521), 17 states have internal predecessors, (521), 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-03-04 15:28:09,583 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:09,584 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:28:09,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 15:28:09,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:09,784 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 64 more)] === [2025-03-04 15:28:09,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:09,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1972299484, now seen corresponding path program 1 times [2025-03-04 15:28:09,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:09,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198632801] [2025-03-04 15:28:09,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:09,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:09,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:28:09,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:28:09,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:09,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:09,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:28:09,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:09,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198632801] [2025-03-04 15:28:09,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198632801] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:28:09,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249240046] [2025-03-04 15:28:09,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:09,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:09,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:28:09,928 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:28:09,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 15:28:09,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:28:10,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:28:10,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:10,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:10,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:28:10,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:28:10,130 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 23 treesize of output 7 [2025-03-04 15:28:10,148 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:28:10,152 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:28:10,204 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 25 treesize of output 9 [2025-03-04 15:28:10,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:28:10,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249240046] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:28:10,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:28:10,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-03-04 15:28:10,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205699671] [2025-03-04 15:28:10,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:28:10,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 15:28:10,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:10,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 15:28:10,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-03-04 15:28:10,349 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 98 [2025-03-04 15:28:10,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 136 transitions, 745 flow. Second operand has 18 states, 18 states have (on average 29.5) internal successors, (531), 18 states have internal predecessors, (531), 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-03-04 15:28:10,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:10,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 98 [2025-03-04 15:28:10,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand